An Updated Survey of Bidding Games on Graphs

Guy Avni, Thomas A. Henzinger

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publication47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022
EditorsStefan Szeider, Robert Ganian, Alexandra Silva
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959772563
DOIs
StatePublished - 1 Aug 2022
Event47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022 - Vienna, Austria
Duration: 22 Aug 202226 Aug 2022

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume241
ISSN (Print)1868-8969

Conference

Conference47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022
Country/TerritoryAustria
CityVienna
Period22/08/2226/08/22

Bibliographical note

Publisher Copyright:
© 2022 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. All rights reserved.

Keywords

  • Bidding games
  • Richman bidding
  • mean-payoff
  • parity
  • poorman bidding

ASJC Scopus subject areas

  • Software

Cite this