2022 Spring - Program
Richman Games, first developed in the 1980s by David Richman, extend the notion of combinatorial games. Rather than typical game play in which the two players alternate turns, an auction between the players determines who gets to move next. We’ll examine the basic results, especially the existence of Richman values for a large class of games on directed graphs. These values not only determine who has a winning strategy, they inform the players about optimal moves. We will explore other problems and variants of Richman games. The goal for this talk is not to learn deep theory associated with the games nor to give rigorous proofs of the results. Instead, we present interesting questions and situations for further analysis by students and instructors alike.