Richman Games by Snehadri Das '23, Mathematics Colloquium

Richman Games by Snehadri Das ’23, Mathematics Colloquium, Wednesday, April 12, 1 – 1:45 pm, North Science Building 113, Wachenheim.

Abstract:  In this talk, we will cover results regarding “Richman games” in which players begin with a budget and bid for the right to take the next move, with the goal of moving a token to a particular vertex of a graph.  In doing so, we will discuss the optimal bids that players can make, as well as how much money a player must have in order to have a winning strategy.  Based on a paper by Andrew J. Lazarus and Daniel E. Lobb (1995), we will find optimal strategies in both hidden and visible information scenarios.