Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness

DOI10.1007/978-3-642-15781-3_2zbMath1287.91026OpenAlexW2143381018MaRDI QIDQ3586380

Kshipra Bhawalkar, Tim Roughgarden, Martin Gairing

Publication date: 6 September 2010

Published in: Algorithms – ESA 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15781-3_2

Mathematics Subject Classification ID

Games involving graphs (91A43) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (21)

Cost-Sharing in Generalised Selfish Routing ⋮ On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games ⋮ Robust perfect equilibrium in large games ⋮ On Stackelberg Strategies in Affine Congestion Games ⋮ The Curse of Sequentiality in Routing Games ⋮ On Lookahead Equilibria in Congestion Games ⋮ Inefficiency of pure Nash equilibria in series-parallel network congestion games ⋮ Optimal Cost-Sharing in General Resource Selection Games ⋮ Unnamed Item ⋮ On lookahead equilibria in congestion games ⋮ LP-based covering games with low price of anarchy ⋮ Restoring Pure Equilibria to Weighted Congestion Games ⋮ Local smoothness and the price of anarchy in splittable congestion games ⋮ On the Existence of Pure Nash Equilibria in Weighted Congestion Games ⋮ Unnamed Item ⋮ On the Robustness of the Approximate Price of Anarchy in Generalized Congestion Games ⋮ Game efficiency through linear programming duality ⋮ Interplay between Security Providers, Consumers, and Attackers: A Weighted Congestion Game Approach ⋮ On Stackelberg strategies in affine congestion games ⋮ On the Price of Anarchy of cost-sharing in real-time scheduling systems ⋮ The Price of Stability of Weighted Congestion Games

This page was built for publication: Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness