Bidding mechanisms in graph games

Guy Avni, Thomas A. Henzinger, Đorđe Žikelić

Research output: Contribution to journalArticlepeer-review


A graph game proceeds as follows: two players move a token through a graph to produce a finite or infinite path, which determines the payoff of the game. We study bidding games in which in each turn, an auction determines which player moves the token. Bidding games were largely studied in combination with two variants of first-price auctions called “Richman” and “poorman” bidding. We study taxman bidding, which span the spectrum between the two. The game is parameterized by a constant τ∈[0,1]: portion τ of the winning bid is paid to the other player, and portion 1−τ to the bank. While finite-duration (reachability) taxman games have been studied before, we present, for the first time, results on infinite-duration taxman games: we unify, generalize, and simplify previous equivalences between bidding games and a class of stochastic games called random-turn games.

Original languageEnglish
Pages (from-to)133-144
Number of pages12
JournalJournal of Computer and System Sciences
StatePublished - Aug 2021

Bibliographical note

Funding Information:
This research was supported in part by the Austrian Science Fund (FWF) under grants S11402-N23 (RiSE/SHiNE) and Z211-N23 (Wittgenstein Award), and from the European Union's Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385 .

Publisher Copyright:
© 2021


  • Bidding games
  • Graph games
  • Mean-payoff games
  • Parity games
  • Poorman bidding
  • Random-turn games
  • Richman bidding
  • Stochastic games

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Networks and Communications
  • Computational Theory and Mathematics
  • Applied Mathematics


Dive into the research topics of 'Bidding mechanisms in graph games'. Together they form a unique fingerprint.

Cite this