In two-player games on graphs, the players move a token through a graph to produce an infinite path, which determines the qualitative winner or quantitative payoff of the game. In bidding games, in each turn, we hold an auction between the two players to determine which player moves the token. Bidding games have largely been studied with concrete bidding mechanisms that are variants of a first-price auction: in each turn both players simultaneously submit bids, the higher bidder moves the token, and pays his bid to the lower bidder in Richman bidding, to the bank in poorman bidding, and in taxman bidding, the bid is split between the other player and the bank according to a predefined constant factor. Bidding games are deterministic games. They have an intriguing connection with a fragment of stochastic games called random-turn games. We study, for the first time, a combination of bidding games with probabilistic behavior; namely, we study bidding games that are played on Markov decision processes, where the players bid for the right to choose the next action, which determines the probability distribution according to which the next vertex is chosen. We study parity and mean-payoff bidding games on MDPs and extend results from the deterministic bidding setting to the probabilistic one.
|Title of host publication||Reachability Problems - 13th International Conference, RP 2019, Proceedings|
|Editors||Emmanuel Filiot, Raphaël Jungers, Igor Potapov|
|Number of pages||12|
|State||Published - 2019|
|Event||13th International Conference on Reachability Problems, RP 2019 - Brussels, Belgium|
Duration: 11 Sep 2019 → 13 Sep 2019
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||13th International Conference on Reachability Problems, RP 2019|
|Period||11/09/19 → 13/09/19|
Bibliographical notePublisher Copyright:
© 2019, Springer Nature Switzerland AG.
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science (all)