Infinite-duration poorman-bidding games
From MaRDI portal
Publication:2190378
DOI10.1007/978-3-030-04612-5_2zbMath1443.91070arXiv1804.04372OpenAlexW2797251385MaRDI QIDQ2190378
Rasmus Ibsen-Jensen, Guy Avni, Thomas A. Henzinger
Publication date: 18 June 2020
Full work available at URL: https://arxiv.org/abs/1804.04372
2-person games (91A05) Games involving graphs (91A43) Games on graphs (graph-theoretic aspects) (05C57) Algorithmic game theory and complexity (91A68)
Related Items (6)
Bidding mechanisms in graph games ⋮ Unnamed Item ⋮ Infinite-duration poorman-bidding games ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A Survey of Bidding Games on Graphs (Invited Paper)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
- Network-formation games with regular objectives
- The efficiency of best-response dynamics
- Games with secure equilibria
- Discrete bidding games
- Strategy logic
- Combinatorial games under auction play
- An abstraction-refinement methodology for reasoning about network games
- Bidding games and efficient allocations
- Optimizing scrip systems: crashes, altruists, hoarders, sybils and collusion
- Infinite-duration poorman-bidding games
- Bidding chess
- Dynamic Resource Allocation Games
- Reasoning About Strategies
- Tug-of-war and the infinity Laplacian
- Endgames in bidding chess
- Hierarchical Network Formation Games
- Alternating-time temporal logic
- Rational Synthesis
- Nash Equilibrium for Upward-Closed Objectives
- On (Subgame Perfect) Secure Equilibrium in Quantitative Reachability Games
- Deciding parity games in quasipolynomial time
- Infinite-Duration Bidding Games
- Computer Science Logic
- Algorithmic Game Theory
- Decidability of Second-Order Theories and Automata on Infinite Trees
This page was built for publication: Infinite-duration poorman-bidding games
