Bidding mechanisms in graph games

• Main Authors: AVNI, Guy, HENZINGER, Thomas A., ZIKELIC, Dorde
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2021
• Subjects: Graph games; Bidding games; Richman bidding; Poorman bidding; Mean-payoff games; Parity games; Stochastic games; Random-turn games; Graphics and Human Computer Interfaces; Theory and Algorithms
• Online Access: https://ink.library.smu.edu.sg/sis_research/9060; https://ink.library.smu.edu.sg/context/sis_research/article/10063/viewcontent/1_s2.0_S0022000021000234_main.pdf
• Institution: Singapore Management University

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.