Dynamic resource allocation games
From MaRDI portal
Publication:2286736
DOI10.1016/j.tcs.2019.06.031zbMath1443.91030OpenAlexW2958000619MaRDI QIDQ2286736
Guy Avni, Orna Kupferman, Thomas A. Henzinger
Publication date: 22 January 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2019.06.031
Applications of game theory (91A80) Dynamic games (91A25) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Potential and congestion games (91A14)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Network-formation games with regular objectives
- Worst-case equilibria
- Synthesis from component libraries with costs
- Network design with weighted players
- Games with secure equilibria
- Strategy logic
- Stackelberg strategies for atomic congestion games
- Strong equilibrium in congestion games
- A class of games possessing pure-strategy Nash equilibria
- The curse of simultaneity
- Subgame Perfection for Equilibria in Quantitative Reachability Games
- The Sequential Price of Anarchy for Atomic Congestion Games
- On Lookahead Equilibria in Congestion Games
- Pure Nash Equilibria in Concurrent Deterministic Games
- Reasoning About Strategies
- How bad is selfish routing?
- Hierarchical Network Formation Games
- The Price of Stability for Network Design with Fair Cost Allocation
- Alternating-time temporal logic
- The Curse of Sequentiality in Routing Games
- Rational Synthesis
- Nash Equilibrium for Upward-Closed Objectives
- A Theoretical Examination of Practical Game Playing: Lookahead Search
- Infinite-Duration Bidding Games
- Algorithms, games, and the internet
- Computer Science Logic
- Algorithmic Game Theory
- On the Existence of Pure Nash Equilibria in Weighted Congestion Games
