A new model for selfish routing

DOI10.1016/J.TCS.2008.06.045zbMath1154.91011OpenAlexW2075004702MaRDI QIDQ952441

Marios Mavronicolas, Burkhard Monien, Manuel Rode, Thomas Lücking

Publication date: 12 November 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.06.045

zbMATH Keywords

congestion gamescoordination ratioquadratic social costworst-case Nash equilibrium

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Applications of game theory (91A80) Traffic problems in operations research (90B20)

Related Items (16)

Bottleneck Congestion Games with Logarithmic Price of Anarchy ⋮ Atomic routing games on maximum congestion ⋮ On Stackelberg Strategies in Affine Congestion Games ⋮ A Selective Tour Through Congestion Games ⋮ Inefficiency of pure Nash equilibria in series-parallel network congestion games ⋮ Exact price of anarchy for weighted congestion games with two players ⋮ Efficiency analysis of load balancing games with and without activation costs ⋮ Tight bounds for selfish and greedy load balancing ⋮ Computation and efficiency of potential function minimizers of combinatorial congestion games ⋮ Facets of the fully mixed Nash equilibrium conjecture ⋮ The price of anarchy of affine congestion games with similar strategies ⋮ Which is the worst-case Nash equilibrium? ⋮ Unnamed Item ⋮ The price of anarchy in nonatomic consumption-relevance congestion games ⋮ Efficiency of Equilibria in Uniform Matroid Congestion Games ⋮ On Stackelberg strategies in affine congestion games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The price of anarchy for polynomial social cost
• The price of selfish routing
• Tighter bounds on a heuristic for a partition problem
• Approximate equilibria and ball fusion
• Congestion games with player-specific payoff functions
• Tradeoffs in worst-case equilibria
• A class of games possessing pure-strategy Nash equilibria
• Structure and complexity of extreme Nash equilibria
• Selfish unsplittable flows
• Non-cooperative games
• Tight bounds for worst-case equilibria
• Selfish traffic allocation for server farms
• Convergence time to Nash equilibrium in load balancing
• The price of anarchy of finite congestion games
• Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation
• Record Allocation for Minimizing Expected Retrieval Costs on Drum-Like Storage Devices
• Competitive routing in networks with polynomial costs
• Mathematical Foundations of Computer Science 2003
• Mathematical Foundations of Computer Science 2003
• Automata, Languages and Programming
• Über ein Paradoxon aus der Verkehrsplanung
• Traffic assignment problem for a general network
• Integer Programming and Combinatorial Optimization
• Automata, Languages and Programming
• Equilibrium points in n -person games
• Computing Nash equilibria for scheduling on restricted parallel links
• The Price of Routing Unsplittable Flow

This page was built for publication: A new model for selfish routing