Dynamic resource allocation games

DOI10.1007/978-3-662-53354-3_13MaRDI QIDQ2819456zbMATH OpenOpenAlexFDO

Authors Guy Avni, Orna Kupferman, 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

dynamic settingresource allocation gamessubgame perfect equilibrium

Mathematics Subject Classification ID

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

Recommendations

• Dynamic resource allocation games
• Conflicting congestion effects in resource allocation games
• Resource allocation games with multiple resource classes
• Utilitarian resource assignment
• Optimal cost-sharing in general resource selection games

Cites work

• A class of games possessing pure-strategy Nash equilibria
• A theoretical examination of practical game playing: lookahead search
• Alternating-time temporal logic
• Congestion games with multisets of resources and applications in synthesis
• How bad is selfish routing?
• scientific article; zbMATH DE number 3139273 (Why is no real title available?)
• scientific article; zbMATH DE number 5485547 (Why is no real title available?)
• scientific article; zbMATH DE number 4124989 (Why is no real title available?)
• scientific article; zbMATH DE number 2079324 (Why is no real title available?)
• scientific article; zbMATH DE number 1754580 (Why is no real title available?)
• Network design with weighted players
• Network-formation games with regular objectives
• On Lookahead Equilibria in Congestion Games
• On the existence of pure Nash equilibria in weighted congestion games
• Stackelberg Strategies for Atomic Congestion Games
• Strong equilibrium in congestion games
• Synthesis from Component Libraries
• Synthesis from component libraries with costs
• The curse of sequentiality in routing games
• The curse of simultaneity
• The Price of Stability for Network Design with Fair Cost Allocation
• The sequential price of anarchy for atomic congestion games
• Worst-case equilibria

Cited in

(28)

• Games of timing related to distribution of resources
• An abstraction-refinement methodology for reasoning about network games
• Phase structure of resource allocation games
• Timed network games
• Resource allocation based on DEA and non-cooperative game
• Infinite-duration poorman-bidding games
• Dynamic resource allocation games
• Dynamic contests with resource constraints
• Resource competition on integral polymatroids
• Resource allocation games with multiple resource classes
• scientific article; zbMATH DE number 5071026 (Why is no real title available?)
• The allocation of offensive and defensive resources in a territorial game
• Probabilistic resource pooling games
• Conflicting congestion effects in resource allocation games
• Selfish resource allocation in optical networks
• Timed network games with clocks
• The inefficiency of Nash and subgame perfect equilibria for network routing
• Timed network games
• Infinite-duration bidding games
• Distributed welfare games
• Symmetric subgame-perfect equilibria in resource allocation
• Resource contention games in multiclass stochastic flow models
• Dynamic Resource Allocation Mechanism for Network Interconnection Management
• scientific article; zbMATH DE number 7327943 (Why is no real title available?)
• Determinacy in discrete-bidding infinite-duration games
• Using Temporal Dummy Players in Cost-Sharing Games
• Computing the price of anarchy in atomic network congestion games (invited talk)
• Utilitarian resource assignment

This page was built for publication: Dynamic resource allocation games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2819456)