The Influence of Link Restrictions on (Random) Selfish Routing

DOI10.1007/978-3-540-79309-0_4zbMATH Open1136.91343OpenAlexW1524913731MaRDI QIDQ5459969FDOQ5459969

Alexander Souza, Martin Hoefer

Publication date: 2 May 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-79309-0_4

Recommendations

• Tradeoffs and average-case equilibria in selfish routing
• Tradeoffs and Average-Case Equilibria in Selfish Routing
• The price of selfish routing
• The price of selfish routing
• The price of anarchy is independent of the network topology

Mathematics Subject Classification ID

Communication networks in operations research (90B18) (n)-person games, (n>2) (91A06) Games involving graphs (91A43) Network design and communication in computer systems (68M10)

Cites Work

• Worst-case equilibria
• Approximation algorithms for scheduling unrelated parallel machines
• The price of anarchy of finite congestion games
• Tight Bounds for Selfish and Greedy Load Balancing
• The Price of Routing Unsplittable Flow
• Selfish traffic allocation for server farms
• Title not available (Why is that?)
• Approximation and Online Algorithms
• Computing Nash equilibria for scheduling on restricted parallel links
• Selfish load balancing and atomic congestion games
• STACS 2004
• Structure and complexity of extreme Nash equilibria
• Automata, Languages and Programming
• Tradeoffs and Average-Case Equilibria in Selfish Routing
• A new average case analysis for completion time scheduling
• Approximation algorithms for single-source unsplittable flow

Cited In (1)

• Atomic routing games on maximum congestion

This page was built for publication: The Influence of Link Restrictions on (Random) Selfish Routing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5459969)