Exact Price of Anarchy for Polynomial Congestion Games

DOI10.1137/090748986zbMath1231.91008OpenAlexW2011144523MaRDI QIDQ3115864

Burkhard Monien, Florian Schoppmann, Martin Gairing, Sebastian Aland, Dominic Dumrauf

Publication date: 11 February 2012

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/090748986

zbMATH Keywords

price of anarchyselfish routingatomic unsplittable congestion games

Mathematics Subject Classification ID

Noncooperative games (91A10) Games involving graphs (91A43)

Related Items (32)

Cost-Sharing in Generalised Selfish Routing ⋮ Tight Bounds for Cost-Sharing in Weighted Congestion Games ⋮ On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games ⋮ On Stackelberg Strategies in Affine Congestion Games ⋮ A Selective Tour Through Congestion Games ⋮ Computing Approximate Equilibria in Weighted Congestion Games via Best-Responses ⋮ Timing matters: online dynamics in broadcast games ⋮ Price of anarchy for parallel link networks with generalized mean objective ⋮ Unnamed Item ⋮ Price of Anarchy in Networks with Heterogeneous Latency Functions ⋮ On lookahead equilibria in congestion games ⋮ On approximate pure Nash equilibria in weighted congestion games with polynomial latencies ⋮ Non-atomic one-round walks in congestion games ⋮ Computation and efficiency of potential function minimizers of combinatorial congestion games ⋮ Local smoothness and the price of anarchy in splittable congestion games ⋮ Congestion games with priority-based scheduling ⋮ A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games ⋮ The price of anarchy of affine congestion games with similar strategies ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the Robustness of the Approximate Price of Anarchy in Generalized Congestion Games ⋮ Efficiency of Equilibria in Uniform Matroid Congestion Games ⋮ On Approximate Pure Nash Equilibria in Weighted Congestion Games with Polynomial Latencies ⋮ On Stackelberg strategies in affine congestion games ⋮ On the robustness of the approximate price of anarchy in generalized congestion games ⋮ On the Price of Anarchy of cost-sharing in real-time scheduling systems ⋮ The Price of Stability of Weighted Congestion Games ⋮ Atomic congestion games with random players: network equilibrium and the price of anarchy ⋮ Cooperative congestion games: existence of a Nash-stable coalition structure ⋮ The Price of Stability of Weighted Congestion Games ⋮ Timed network games ⋮ On the sequential price of anarchy of isolation games

This page was built for publication: Exact Price of Anarchy for Polynomial Congestion Games