Dynamic Resource Allocation Games

DOI10.1007/978-3-662-53354-3_13zbMath1403.91059OpenAlexW2513940585MaRDI QIDQ2819456

Orna Kupferman, Guy Avni, Thomas A. Henzinger

Publication date: 29 September 2016

Published in: Algorithmic Game Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-53354-3_13

zbMATH Keywords

subgame perfect equilibriumdynamic settingresource allocation games

Mathematics Subject Classification ID

Games involving graphs (91A43) Dynamic games (91A25) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (9)

An abstraction-refinement methodology for reasoning about network games ⋮ Unnamed Item ⋮ Infinite-duration poorman-bidding games ⋮ The Inefficiency of Nash and Subgame Perfect Equilibria for Network Routing ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Infinite-Duration Bidding Games ⋮ Timed network games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Worst-case equilibria
• Network design with weighted players
• Strong equilibrium in congestion games
• A class of games possessing pure-strategy Nash equilibria
• The curse of simultaneity
• The Sequential Price of Anarchy for Atomic Congestion Games
• On Lookahead Equilibria in Congestion Games
• Synthesis from Component Libraries with Costs
• How bad is selfish routing?
• The Price of Stability for Network Design with Fair Cost Allocation
• Alternating-time temporal logic
• The Curse of Sequentiality in Routing Games
• Stackelberg Strategies for Atomic Congestion Games
• Synthesis from Component Libraries
• A Theoretical Examination of Practical Game Playing: Lookahead Search
• Network-Formation Games with Regular Objectives
• On the Existence of Pure Nash Equilibria in Weighted Congestion Games

This page was built for publication: Dynamic Resource Allocation Games