The LSV seminar takes place on Tuesday at 11:00 AM. The usual location is the conference room at Pavillon des Jardins (venue). If you wish to be informed by e-mail about upcoming seminars, please contact Stéphane Le Roux and Matthias Fuegger.
The seminar is open to public and does not require any form of registration.
A graph game is a two-player zero-sum game in which the players move a token throughout a graph to produce an infinite path, which determines the winner or payoff of the game. In bidding games, in each turn, we hold an auction (bidding) to determine which player moves the token. We consider several concrete bidding mechanisms and study their effect on the properties of the game. Specifically, bidding games, and in particular bidding games of infinite duration, have an intriguing equivalence with random-turn games, which is a fragment of stochastic games in which the player who moves is chosen randomly in each turn. I will survey our results on how changes to the bidding mechanisms lead to unexpected differences in the equivalence with random-turn games.