Bidding Games on Markov Decision Processes

Guy Avni, Thomas A. Henzinger, Rasmus Ibsen-Jensen, Petr Novotný

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


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.

Original languageEnglish
Title of host publicationReachability Problems - 13th International Conference, RP 2019, Proceedings
EditorsEmmanuel Filiot, Raphaël Jungers, Igor Potapov
PublisherSpringer Verlag
Number of pages12
ISBN (Print)9783030308056
StatePublished - 2019
Externally publishedYes
Event13th International Conference on Reachability Problems, RP 2019 - Brussels, Belgium
Duration: 11 Sep 201913 Sep 2019

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11674 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference13th International Conference on Reachability Problems, RP 2019

Bibliographical note

Publisher Copyright:
© 2019, Springer Nature Switzerland AG.

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Bidding Games on Markov Decision Processes'. Together they form a unique fingerprint.

Cite this