A Survey of Bidding Games on Graphs (Invited Paper)

DOI10.4230/LIPICS.CONCUR.2020.2OpenAlexW3081994067MaRDI QIDQ5089263FDOQ5089263

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

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

Cited In (3)

• Title not available (Why is that?)
• Bidding mechanisms in graph games
• Stochastic games with disjunctions of multiple objectives

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089263)