We first discuss Zermelo’s theorem: that games like tic-tac-toe or chess have a solution. That is, either there is a way for player 1 to force a win, or there is a way for player 1 to force a tie, or there is a way for player 2 to force a win. The proof is by induction. Then we formally define and informally discuss both perfect information and strategies in ... Show More
Jun 2018
Lecture 22
- Repeated Games: Cheating, Punishment, and Outsourcing
In business or personal relationships, promises and threats of good and bad behavior tomorrow may provide good incentives for good behavior today, but, to work, these promises and threats must be credible. In particular, they must come from equilibrium behavior tomorrow, and henc ... Show More
1h 15m
Apr 2024
Episode 274: Sofia De Jesus
Send us a textExploring the Complex Landscape of AI in Education with Sofia De Jesus In this episode of the My EdTech Life Podcast, I sit down with Sofia De Jesus, an associate program manager at CMUCS Academy, CSTA Equity Fellow, and author, to discuss the intricacies of AI in e ... Show More
1h 6m
Dec 2023
“Great Buys” in Education: Maximizing learning in low and middle-income countries
In this episode, we are featuring Benjamin Piper, the Director of Global Education at the Bill & Melinda Gates Foundation. Ben sheds light on the groundbreaking work of the Global Education Evidence Advisory Panel (GEEAP). With an exhaustive analysis of over 13,000 academic studi ... Show More
28m 28s