Nonadaptive Selfish Routing with Online Demands

DOI10.1007/978-3-540-77294-1_5zbMath1136.90320OpenAlexW2110964193MaRDI QIDQ5458504

Tobias Harks, László A. Végh

Publication date: 15 April 2008

Published in: Combinatorial and Algorithmic Aspects of Networking (Search for Journal in Brave)

Full work available at URL: http://www.mathstat.dal.ca/~caan2007/

Mathematics Subject Classification ID

Applications of game theory (91A80) Stochastic network models in operations research (90B15)

Related Items (4)

The quality of equilibria for set packing and throughput scheduling games ⋮ The Inefficiency of Nash and Subgame Perfect Equilibria for Network Routing ⋮ The sequential price of anarchy for affine congestion games with few players ⋮ Dynamic Atomic Congestion Games with Seasonal Flows

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Selfish load balancing and atomic congestion games
• Online algorithms. The state of the art
• The effect of collusion in congestion games
• How bad is selfish routing?
• Technical Note—Traffic Equilibrium Paradoxes
• The price of anarchy of finite congestion games
• On the Inefficiency of Equilibria in Congestion Games
• Tight Bounds for Selfish and Greedy Load Balancing
• Network Games with Atomic Players
• Inefficiency of Nash Equilibria
• Adaptive routing with stale information
• Competitive routing in networks with polynomial costs
• Competitive Online Multicommodity Routing
• Existence and Uniqueness of Equilibrium Points for Concave N-Person Games
• Über ein Paradoxon aus der Verkehrsplanung
• Traffic assignment problem for a general network
• Selfish Routing in Capacitated Networks
• The Price of Routing Unsplittable Flow
• The price of anarchy is independent of the network topology

This page was built for publication: Nonadaptive Selfish Routing with Online Demands