Congestion games with failures

DOI10.1016/J.DAM.2011.01.019MaRDI QIDQ642974zbMATHOpenAlexFDO

Authors Michal Penn, Maria Polukarov, Moshe Tennenholtz

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

algorithmsprice of anarchycongestion gamespure strategy Nash equilibriumresource failuressemi-strong Nash equilibrium

Mathematics Subject Classification ID

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

Recommendations

• Congestion games with load-dependent failures: Identical resources
• Congestion games with capacitated resources
• Pure Nash equilibria in a generalization of congestion games allowing resource failures
• Pure Nash equilibria in a generalization of congestion games allowing resource failures
• Taxed congestion games with failures

Cites work

• scientific article; zbMATH DE number 3139273 (Why is no real title available?)
• scientific article; zbMATH DE number 4167875 (Why is no real title available?)
• scientific article; zbMATH DE number 1226101 (Why is no real title available?)
• A class of games possessing pure-strategy Nash equilibria
• Algorithms, games, and the internet
• Bounding the inefficiency of equilibria in nonatomic congestion games
• Coalition-proof Nash equilibria. I: Concepts
• Coalition-proof Nash equilibria. II: Applications
• Coalition-proofness and correlation with arbitrary communication possibilities
• Congestion games with failures
• Congestion games with load-dependent failures: Identical resources
• Congestion games with player-specific payoff functions
• Fairness Measures for Resource Allocation
• Fast, Fair, and Efficient Flows in Networks
• How bad is selfish routing?
• Potential games
• Potential games with continuous player sets
• System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion
• Taxed congestion games with failures
• The Price of Stability for Network Design with Fair Cost Allocation
• The price of anarchy of finite congestion games
• The price of routing unsplittable flow
• Worst-case equilibria

Cited in

(11)

• Pure Nash equilibria in a generalization of congestion games allowing resource failures
• Uniform Mixed Equilibria in Network Congestion Games with Link Failures
• \(r\)-extreme signalling for congestion control
• Uniform mixed equilibria in network congestion games with link failures
• Taxed congestion games with failures
• On congestion games with player-specific costs and resource failures
• Fragility of the commons under prospect-theoretic risk attitudes
• Proof systems and transformation games
• Congestion games with failures
• Congestion games with load-dependent failures: Identical resources
• Pure Nash equilibria in a generalization of congestion games allowing resource failures

This page was built for publication: Congestion games with failures

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