How bad is selfish routing?
From MaRDI portal
Publication:3196642
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
Deterministic network models in operations research (90B10) Applications of game theory (91A80) Noncooperative games (91A10)
Cited In (only showing first 100 items - show all)
- The price of anarchy on uniformly related machines revisited
- Extending the notion of rationality of selfish agents: second order Nash equilibria
- Price competition with elastic traffic
- Utilitarian resource assignment
- Coordination mechanisms
- On the efficiency of price competition
- A mean-risk model for the traffic assignment problem with stochastic travel times
- Inefficiency of logit-based stochastic user equilibrium in a traffic network under ATIS
- Restrictive mechanism of flow control among non-cooperative internet users
- A selfish routing based network improvement problem
- Nash equilibria in discrete routing games with convex latency functions
- Equilibrium and inefficiency in multi-product Cournot games
- Price and capacity competition
- Introduction to computer science and economic theory
- Connectivity and equilibrium in random games
- On spectrum sharing games
- Worst-case Nash equilibria in restricted routing
- Monotonicity properties of user equilibrium policies for parallel batch systems
- Profit loss in differentiated oligopolies
- Efficiency of atomic splittable selfish routing with polynomial cost functions
- Strong mediated equilibrium
- Telecommunications network design: Technology impacts and future directions
- A mixed traffic assignment problem and its upper bound of efficiency loss
- Price of anarchy for supply chains with partial positive externalities
- On the efficiency of the proportional allocation mechanism for divisible resources
- Efficient methods for selfish network design
- Pairwise cooperations in selfish ring routing for minimax linear latency
- Price of Anarchy in Networks with Heterogeneous Latency Functions
- Degrading network capacity may improve performance: private versus public monitoring in the Braess paradox
- Equilibria in routing games with edge priorities
- Network routing
- Local smoothness and the price of anarchy in splittable congestion games
- Auctioning or assigning an object: some remarkable VCG mechanisms
- On the price of anarchy of highly congested nonatomic network games
- The price of atomic selfish ring routing
- Selfishness need not be bad
- Tradeoffs in worst-case equilibria
- Price of anarchy for parallel link networks with generalized mean objective
- Inefficiency of pure Nash equilibria in series-parallel network congestion games
- Convergence of best-response dynamics in games with conflicting congestion effects
- Buyer-supplier games: optimization over the core
- Local and global price of anarchy of graphical games
- Topological implications of selfish neighbor selection in unstructured peer-to-peer networks
- Approximate Strong Equilibrium in Job Scheduling Games
- Stackelberg Strategies and Collusion in Network Games with Splittable Flow
- Nash equilibria and the price of anarchy for flows over time
- Truthful mechanisms for selfish routing and two-parameter agents
- Minimizing Rosenthal potential in multicast games
- The price of anarchy for polynomial social cost
- Bounding the inefficiency of the C-logit stochastic user equilibrium assignment
- A BGP-based mechanism for lowest-cost routing
- Stability vs. optimality in selfish ring routing
- Network characterizations for excluding Braess's paradox
- The Pareto frontier of inefficiency in mechanism design
- Dynamic resource allocation games
- Network pricing: how to induce optimal flows under strategic link operators
- Subjective-cost policy routing
- The price of optimum: complexity and approximation for a matching game
- Fast, Fair, and Efficient Flows in Networks
- Network topologies for weakly Pareto optimal nonatomic selfish routing
- Potential games are \textit{necessary} to ensure pure Nash equilibria in cost sharing games
- Braess's Paradox in large random graphs
- Maximizing the minimum load: the cost of selfishness
- 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
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)
