Infinite-Duration Bidding Games
From MaRDI portal
Publication:5111634
DOI10.4230/LIPIcs.CONCUR.2017.21zbMath1448.91061OpenAlexW2964073379MaRDI QIDQ5111634
Ventsislav Chonev, Guy Avni, Thomas A. Henzinger
Publication date: 27 May 2020
Full work available at URL: https://doi.org/10.4230/lipics.concur.2017.21
2-person games (91A05) Games involving graphs (91A43) Multistage and repeated games (91A20) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (4)
Infinite-duration poorman-bidding games ⋮ Unnamed Item ⋮ Dynamic resource allocation games ⋮ Infinite-Duration Bidding Games
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Network-formation games with regular objectives
- 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
- Gambler's ruin probability -- a general formula
- Non-Zero Sum Games for Reactive Synthesis
- Dynamic Resource Allocation Games
- Subgame Perfection for Equilibria in Quantitative Reachability Games
- Nash Equilibria in Concurrent Games with Büchi Objectives
- Analyzing Scrip Systems
- Approximating the Termination Value of One-Counter MDPs and Stochastic Games
- Hierarchical Network Formation Games
- The Odds of Staying on Budget
- Alternating-time temporal logic
- Controller Synthesis with Budget Constraints
- Rational Synthesis
- Degrees of Lookahead in Regular Infinite Games
- Secure equilibria in weighted games
- Infinite-Duration Bidding Games
- Variations on the Stochastic Shortest Path Problem
- Computer Science Logic
- How Much Lookahead is Needed to Win Infinite Games?
This page was built for publication: Infinite-Duration Bidding Games
