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, both players have budgets, and in each turn, we hold an "auction" (bidding) to determine which player moves the token. In this survey, we consider several bidding mechanisms and 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 in which in each turn, the player who moves is chosen randomly. We summarize how minor changes in the bidding mechanism lead to unexpected differences in the equivalence with random-turn games.
|Title of host publication||47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022|
|Editors||Stefan Szeider, Robert Ganian, Alexandra Silva|
|Publisher||Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing|
|State||Published - 1 Aug 2022|
|Event||47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022 - Vienna, Austria|
Duration: 22 Aug 2022 → 26 Aug 2022
|Name||Leibniz International Proceedings in Informatics, LIPIcs|
|Conference||47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022|
|Period||22/08/22 → 26/08/22|
Bibliographical notePublisher Copyright:
© 2022 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. All rights reserved.
- Bidding games
- poorman bidding
- Richman bidding
ASJC Scopus subject areas