How bad is selfish routing?

DOI10.1145/506147.506153zbMATH Open1323.90011OpenAlexW2112269231WikidataQ56386816 ScholiaQ56386816MaRDI QIDQ3196642FDOQ3196642

Authors: Tim Roughgarden, Éva Tardos 

Publication date: 30 October 2015

Published in: Journal of the ACM (Search for Journal in Brave)

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

Recommendations

• Selfish routing
• When is selfish routing bad? The price of anarchy in light and heavy traffic
• The price of selfish routing
• The price of selfish routing
• SOFSEM 2006: Theory and Practice of Computer Science
• How much can taxes help selfish routing?
• scientific article; zbMATH DE number 2119661
• Algorithms – ESA 2004
• Selfish Routing with Oblivious Users
• Selfish routing in public services

zbMATH Keywords

network flowNash equilibriaselfish routingBraess's paradox

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Applications of game theory (91A80) Noncooperative games (91A10)

Cited In (only showing first 100 items - show all)

• Introduction to the special issue -- Algorithmic game theory -- STOC/FOCS/SODA 2011
• On the price of anarchy of two-stage machine scheduling games
• Synthesis from component libraries with costs
• Recursively modeling other agents for decision making: a research perspective
• Equilibria for networks with malicious users
• Continuum equilibria and global optimization for routing in dense static ad hoc networks
• Optimal routing of vehicles with communication capabilities in disasters
• The impact of local policies on the quality of packet routing in paths, trees, and rings
• Agent-based randomized broadcasting in large networks
• Potential games, path independence and Poisson's binomial distribution
• Toll caps in privatized road networks
• The inefficiency of Nash and subgame perfect equilibria for network routing
• Braess' paradox: A cooperative game‐theoretic point of view
• A game-theoretic analysis of deep neural networks
• Game-theoretic analysis of Internet switching with selfish users
• An abstraction-refinement methodology for reasoning about network games
• A note on a parameter relating traffic equilibria and system optimal routing
• On the (in)efficiency of MFG equilibria
• Achieving target equilibria in network routing games without knowing the latency functions
• Two-terminal routing games with unknown active players
• Competitive online multicommodity routing
• Agent incentives of a proportional sharing mechanism in resource sharing
• Dynamic resource allocation games
• Title not available (Why is that?)
• Scheduling to Maximize Participation
• Edge pricing of multicommodity networks for selfish users with elastic demands
• Collusion in atomic splittable routing games
• Linear tolls suffice: new bounds and algorithms for tolls in single source networks
• Transfer implementation in congestion games
• Sensitivity of Wardrop Equilibria
• Online learning of Nash equilibria in congestion games
• Equilibria of greedy combinatorial auctions
• Management of Variable Data Streams in Networks
• A paradox in optimal flow control of \(M/M/n\) queues
• Strategic pricing in next-hop routing with elastic demands
• On cost sharing in the provision of a binary and excludable public good
• A mathematical model for the TCP tragedy of the commons
• Sensitivity of Wardrop equilibria
• Capacitated network design games
• A network pricing game for selfish traffic
• The Price of Stochastic Anarchy
• Topological price of anarchy bounds for clustering games on networks
• Competitive contagion in networks
• The price of stability of weighted congestion games
• The price of stability of weighted congestion games
• A bin packing game with cardinality constraints under the best cost rule
• Scheduling to maximize participation
• Sensitivity of wardrop equilibria: revisited
• Optimal cost-sharing in general resource selection games
• The price of anarchy of affine congestion games with similar strategies
• Recent studies of agent incentives in internet resource allocation and pricing
• The no-wait flow-shop paradox
• Resilience of routing in parallel link networks
• Malicious Bayesian Congestion Games
• Dynamics of a 2D piecewise linear Braess paradox model: effect of the third partition
• Network games with quantum strategies
• Quality of strong equilibria for selfish bin packing with uniform cost sharing
• Social interactions and the prophylaxis of SI epidemics on networks
• Resolving Braess's paradox in random networks
• Timed network games with clocks
• A game-theoretic perspective of deep neural networks
• Timed network games
• Cost-sharing in generalised selfish routing
• Risk-averse selfish routing
• A polynomial-time algorithm for detecting the possibility of Braess paradox in directed graphs
• Bounding the inefficiency of the reliability-based continuous network design problem under cost recovery
• Excluding Braess's paradox in nonatomic selfish routing
• Atomic congestion games with random players: network equilibrium and the price of anarchy
• Network QoS games: stability vs optimality tradeoff
• Braess's paradox in expanders
• The price of stability for undirected broadcast network design with fair cost allocation is constant
• Constraint games for stable and optimal allocation of demands in SDN
• A Survey of Uniqueness Results for Selfish Routing
• Improving the price of anarchy for selfish routing via coordination mechanisms
• On the price of anarchy for non-atomic congestion games under asymmetric cost maps and elastic demands
• When is selfish routing bad? The price of anarchy in light and heavy traffic
• Price of anarchy in a linear-state stochastic dynamic game
• Asymptotically optimal control of parallel tandem queues with loss
• Rare Nash equilibria and the price of anarchy in large static games
• Timed network games
• Equilibrium strategies for multiple interdictors on a common network
• Avoiding routing loops on the internet
• An overview on game theory applications to engineering
• Modelling equilibrium for a multi-criteria selfish routing network equilibrium flow problem
• The Price of Anarchy of generic valid utility systems
• Dynamic Atomic Congestion Games with Seasonal Flows
• Probabilistic selfish routing in parallel batch and single-server queues
• Congestion avoiding heuristic path generation for the proactive route guidance
• Beyond Pigouvian taxes: a worst case analysis
• A traffic congestion analysis by user equilibrium and system optimum with incomplete information
• On the sequential price of anarchy of isolation games
• Models of Non-atomic Congestion Games – From Unicast to Multicast Routing
• Minimizing the total travel time with limited unfairness in traffic networks
• Minimal-time mean field games
• Nonlinear day-to-day traffic dynamics with driver experience delay: modeling, stability and bifurcation analysis
• How bad is the merger paradox?
• How bad is the merger paradox?
• Wealth Inequality and the Price of Anarchy
• Capacity-constrained wardrop equilibria and application to multi-connectivity in 5G networks
• Bottleneck links, variable demand, and the tragedy of the commons

This page was built for publication: How bad is selfish routing?

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