Bottleneck Congestion Games with Logarithmic Price of Anarchy

DOI10.1007/978-3-642-16170-4_20zbMath1310.91015arXiv1003.4307OpenAlexW3137478448MaRDI QIDQ3162521

Costas Busch, Rajgopal Kannan

Publication date: 19 October 2010

Published in: Algorithmic Game Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1003.4307

Mathematics Subject Classification ID

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

Related Items (3)

Bottleneck Routing with Elastic Demands ⋮ Computing pure Nash and strong equilibria in bottleneck congestion games ⋮ Bottleneck routing with elastic demands

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Atomic routing games on maximum congestion
• Selfish load balancing and atomic congestion games
• A new model for selfish routing
• The price of selfish routing
• Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps
• Approximate equilibria and ball fusion
• Potential games
• Bounding the inefficiency of equilibria in nonatomic congestion games
• A class of games possessing pure-strategy Nash equilibria
• Selfish unsplittable flows
• Tight bounds for worst-case equilibria
• How bad is selfish routing?
• The price of anarchy of finite congestion games
• Algorithms, games, and the internet
• Approximating Congestion + Dilation in Networks via "Quality of Routing” Games
• Integer Programming and Combinatorial Optimization
• Computing Nash equilibria for scheduling on restricted parallel links
• Atomic resource sharing in noncooperative networks

This page was built for publication: Bottleneck Congestion Games with Logarithmic Price of Anarchy