Congestion games with failures

DOI10.1016/j.dam.2011.01.019zbMath1245.91007OpenAlexW2005014657MaRDI QIDQ642974

Maria Polukarov, Moshe Tennenholtz, Michal Penn

Publication date: 27 October 2011

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2011.01.019

zbMATH Keywords

algorithmscongestion gamesprice of anarchypure strategy Nash equilibriumresource failuressemi-strong Nash equilibrium

Mathematics Subject Classification ID

Noncooperative games (91A10) Queues and service in operations research (90B22) Other game-theoretic models (91A40)

Related Items (9)

Congestion games with load-dependent failures: Identical resources ⋮ On congestion games with player-specific costs and resource failures ⋮ Proof systems and transformation games ⋮ Pure Nash equilibria in a generalization of congestion games allowing resource failures ⋮ Unnamed Item ⋮ Congestion games with failures ⋮ r-extreme signalling for congestion control ⋮ Taxed congestion games with failures ⋮ Fragility of the commons under prospect-theoretic risk attitudes

Cites Work

• Congestion games with failures
• Congestion games with load-dependent failures: Identical resources
• Coalition-proof Nash equilibria. I: Concepts
• Coalition-proof Nash equilibria. II: Applications
• Coalition-proofness and correlation with arbitrary communication possibilities
• Potential games
• Bounding the inefficiency of equilibria in nonatomic congestion games
• Congestion games with player-specific payoff functions
• Taxed congestion games with failures
• A class of games possessing pure-strategy Nash equilibria
• How bad is selfish routing?
• Fast, Fair, and Efficient Flows in Networks
• The Price of Stability for Network Design with Fair Cost Allocation
• Fairness Measures for Resource Allocation
• The price of anarchy of finite congestion games
• Algorithms, games, and the internet
• System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion
• The Price of Routing Unsplittable Flow
• Potential games with continuous player sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Congestion games with failures