Tradeoffs and average-case equilibria in selfish routing

DOI10.1145/1867719.1867721MaRDI QIDQ5892183zbMATH OpenOpenAlexFDO

Authors Martin Hoefer, Alexander Souza

Publication date 24 September 2015

Published in ACM Transactions on Computation Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1867719.1867721

zbMATH Keywords

average-case analysisprice of anarchyselfish routing

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) (n)-person games, (n>2) (91A06) Noncooperative games (91A10)

Recommendations

• Tradeoffs and Average-Case Equilibria in Selfish Routing
• The Influence of Link Restrictions on (Random) Selfish Routing
• The price of selfish routing
• The price of selfish routing
• The price of anarchy is independent of the network topology

Cited in

(41)

• Strategic pricing in next-hop routing with elastic demands
• Approximate equilibria and ball fusion
• Equilibria in routing games with edge priorities
• Evolutionary equilibrium in Bayesian routing games: specialization and niche formation
• Stability vs. optimality in selfish ring routing
• Mixed Nash equilibria in selfish routing problems with dynamic constraints
• Worst-case Nash equilibria in restricted routing
• Fast convergence of selfish rerouting
• Selfish transportation games
• Strategic pricing in next-hop routing with elastic demands
• Stochastic selfish routing
• Resilience of routing in parallel link networks
• Fast, Fair, and Efficient Flows in Networks
• On the Inefficiency of Equilibria in Congestion Games
• A Survey of Uniqueness Results for Selfish Routing
• Equilibria in dynamic selfish routing
• Smoothed performance guarantees for local search
• Performance guarantees of jump neighborhoods on restricted related parallel machines
• Paradoxes in a multi-criteria routing game
• Improved equilibria via public service advertising
• scientific article; zbMATH DE number 2086616 (Why is no real title available?)
• The Value of Information in Selfish Routing
• The price of selfish routing
• Bottleneck links, variable demand, and the tragedy of the commons
• The Price of Anarchy in Selfish Multicast Routing
• Nonadaptive Selfish Routing with Online Demands
• The Influence of Link Restrictions on (Random) Selfish Routing
• The Price of Stochastic Anarchy
• Algorithms – ESA 2004
• Integer Programming and Combinatorial Optimization
• ``Beat-your-rival routing games
• Tradeoffs and Average-Case Equilibria in Selfish Routing
• The price of anarchy is independent of the network topology
• Tight bounds for the price of anarchy and stability in sequential transportation games
• Price of anarchy for parallel link networks with generalized mean objective
• Potential game in parallel transport network with symmetric externalities
• Reconciling selfish routing with social good
• The price of anarchy for polynomial social cost
• A new model for selfish routing
• A note on a parameter relating traffic equilibria and system optimal routing
• The price of selfish routing

This page was built for publication: Tradeoffs and average-case equilibria in selfish routing

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