Bidding mechanisms in graph games
From MaRDI portal
Publication:2662675
DOI10.1016/j.jcss.2021.02.008zbMath1480.91053arXiv1905.03835OpenAlexW3133764879MaRDI QIDQ2662675
Guy Avni, Thomas A. Henzinger, Đorđe Žikelić
Publication date: 14 April 2021
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.03835
parity gamesstochastic gamesmean-payoff gamesgraph gamesbidding gamesrandom-turn gamespoorman biddingRichman bidding
2-person games (91A05) Games involving graphs (91A43) Stochastic games, stochastic differential games (91A15) Auctions, bargaining, bidding and selling, and other market models (91B26)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Discrete bidding games
- The complexity of stochastic games
- Combinatorial games under auction play
- The complexity of mean payoff games on graphs
- Continuity of the value of competitive Markov decision processes
- Bidding games and efficient allocations
- Infinite-duration poorman-bidding games
- Bidding chess
- Bidding games on Markov decision processes
- Robustness of Structurally Equivalent Concurrent Parity Games
- Tug-of-war and the infinity Laplacian
- Infinite-duration Bidding Games
- Decidability of Second-Order Theories and Automata on Infinite Trees
This page was built for publication: Bidding mechanisms in graph games