A Survey of Bidding Games on Graphs (Invited Paper)

DOI10.4230/LIPIcs.CONCUR.2020.2OpenAlexW3081994067MaRDI QIDQ5089263

Guy Avni, Thomas A. Henzinger

Publication date: 18 July 2022

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2020/12814/pdf/LIPIcs-CONCUR-2020-2.pdf/

zbMATH Keywords

paritymean-payoffbidding gamespoorman biddingRichman bidding

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Discrete bidding games
• Multi-battle contests
• The complexity of stochastic games
• Combinatorial games under auction play
• The strategic equivalence of rent-seeking, innovation, and patent-race games.
• Bidding games and efficient allocations
• Infinite-duration poorman-bidding games
• Bidding chess
• Quantitative analysis of smart contracts
• Bidding games on Markov decision processes
• Approximating the Termination Value of One-Counter MDPs and Stochastic Games
• Tug-of-war and the infinity Laplacian
• Endgames in bidding chess
• Alternating-time temporal logic
• Infinite-duration Bidding Games
• Decidability of Second-Order Theories and Automata on Infinite Trees

This page was built for publication: A Survey of Bidding Games on Graphs (Invited Paper)