Discrete Bidding Games
<-- Return to the list
Date: 09-18-2007
Start Time:
4:00pm
End Time: 5:00pm
Speaker: Mike Develin, American Institute of Mathematics and Columbia University
Location: 622 Math
ABSTRACT
Given a two-player combinatorial game G, the discrete bidding version of G involves giving each player a number of bidding chips to start, and having the players bid for the right to make the next move. This setup had been previously investigated for the continuous case by Lazarus et al. under the name of Richman games; continuous bidding games turn out to be equivalent to random-turn games. We investigate the discrete version,noting similarities and surprising differences to the continuous version; most notably, it is not always true that in the large-chip limit the discrete biddinggame reduces to the continuous one.
This is joint work with Sam Payne(Stanford).
BIO
More information about Dr. Mike Develin can be found here.