Competitive online multicommodity routing

DOI10.1007/s00224-009-9187-5zbMath1175.90097OpenAlexW2050307721MaRDI QIDQ839644

Tobias Harks, Marc E. Pfetsch, Stefan Heinz

Publication date: 2 September 2009

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.483.531

zbMATH Keywords

competitive analysisunsplittable flowmulticommodity routingonline network optimization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms (68W40) Traffic problems in operations research (90B20)

Related Items

The quality of equilibria for set packing and throughput scheduling games, The Inefficiency of Nash and Subgame Perfect Equilibria for Network Routing, Smart routing of electric vehicles for load balancing in smart grids, Competitive routing over time, The sequential price of anarchy for affine congestion games with few players, Dynamic Atomic Congestion Games with Seasonal Flows

Cites Work

• Increasing internet capacity using local search
• Selfish load balancing and atomic congestion games
• Online algorithms. The state of the art
• Geometric algorithms and combinatorial optimization.
• A class of games possessing pure-strategy Nash equilibria
• The Impact of Oligopolistic Competition in Networks
• How bad is selfish routing?
• The price of anarchy of finite congestion games
• Tight Bounds for Selfish and Greedy Load Balancing
• Competitive routing in networks with polynomial costs
• Competitive Online Multicommodity Routing
• Über ein Paradoxon aus der Verkehrsplanung
• Traffic assignment problem for a general network
• Selfish Routing in Capacitated Networks
• The Price of Routing Unsplittable Flow
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item