Restoring Pure Equilibria to Weighted Congestion Games

DOI10.1007/978-3-642-22012-8_43zbMath1334.91024OpenAlexW2147722484MaRDI QIDQ3012946

Tim Roughgarden, Konstantinos Kollias

Publication date: 7 July 2011

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22012-8_43

zbMATH Keywords

Shapley valuecongestion gamesnetwork design

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Games involving graphs (91A43) Deterministic network models in operations research (90B10)

Related Items

Cost-Sharing in Generalised Selfish Routing, Optimal cost sharing for capacitated facility location games, Tight Bounds for Cost-Sharing in Weighted Congestion Games, Cost-Sharing Scheduling Games on Restricted Unrelated Machines, Cost-sharing scheduling games on restricted unrelated machines, Computing Approximate Equilibria in Weighted Congestion Games via Best-Responses, Sharing Non-anonymous Costs of Multiple Resources Optimally, Optimal Cost-Sharing in General Resource Selection Games, The power of one evil secret agent, Designing cost-sharing methods for Bayesian games, Algorithms for computing the Shapley value of cooperative games on lattices, Unnamed Item, Non-cooperative queueing games on a network of single server queues, Dynamics of Profit-Sharing Games, On the Price of Anarchy of cost-sharing in real-time scheduling systems, Pure Nash equilibria in restricted budget games

Cites Work

• Unnamed Item
• Network design with weighted players
• The price of anarchy of serial, average and incremental cost sharing
• On weighted Shapley values
• Potential games
• Congestion games with player-specific payoff functions
• Fictitious play property for games with identical interests
• A class of games possessing pure-strategy Nash equilibria
• Selfish unsplittable flows
• Designing Network Protocols for Good Equilibria
• How bad is selfish routing?
• The Price of Stability for Network Design with Fair Cost Allocation
• Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness
• Potential, Value, and Consistency
• Intrinsic robustness of the price of anarchy
• Worst-Case Efficiency Analysis of Queueing Disciplines
• Exact Price of Anarchy for Polynomial Congestion Games
• The network equilibrium problem in integers
• The Price of Routing Unsplittable Flow
• On the Existence of Pure Nash Equilibria in Weighted Congestion Games