A Survey of Bidding Games on Graphs (Invited Paper)
From MaRDI portal
Publication:5089263
Cites work
- scientific article; zbMATH DE number 5869590 (Why is no real title available?)
- scientific article; zbMATH DE number 3148886 (Why is no real title available?)
- scientific article; zbMATH DE number 7561655 (Why is no real title available?)
- scientific article; zbMATH DE number 5685899 (Why is no real title available?)
- scientific article; zbMATH DE number 7327943 (Why is no real title available?)
- Alternating-time temporal logic
- Approximating the termination value of one-counter MDPs and stochastic games
- Bidding chess
- Bidding games and efficient allocations
- Bidding games on Markov decision processes
- Combinatorial games under auction play
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Discrete bidding games
- Endgames in bidding chess
- Infinite-duration Bidding Games
- Infinite-duration poorman-bidding games
- Multi-battle contests
- One-counter Markov decision processes
- Quantitative analysis of smart contracts
- The complexity of stochastic games
- The strategic equivalence of rent-seeking, innovation, and patent-race games.
- Tug-of-war and the infinity Laplacian
Cited in
(3)
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)
