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 uniqueness property for networks with several origin-destination pairs
- On the Braess paradox with nonlinear dynamics and control theory
- Parametric packing of selfish items and the subset sum algorithm
- The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands.
- Selfish bin packing
- Some anomalies of farsighted strategic behavior
- Online bottleneck matching
- Bounding the inefficiency of equilibria in nonatomic congestion games
- Decompositions and potentials for normal form games
- Action-graph games
- Strong price of anarchy
- The price of selfish routing
- On the existence of pure Nash equilibria in weighted congestion games
- Two-group knapsack game
- Robust perfect equilibrium in large games
- Graphical congestion games
- Tight bounds for selfish and greedy load balancing
- Almost budget-balanced VCG mechanisms to assign multiple objects
- Tight bounds for cost-sharing in weighted congestion games
- The toll effect on price of anarchy when costs are nonlinear and asymmetric
- An efficient and almost budget balanced cost sharing method
- How much can taxes help selfish routing?
- Measuring the power of soft correlated equilibrium in 2-facility simple non-increasing linear congestion games
- A geometric approach to the price of anarchy in nonatomic congestion games
- A survey on networking games in telecommunications
- Adaptive routing with stale information
- Design of price mechanisms for network resource allocation via price of anarchy
- ``Beat-your-rival routing games
- The Price of Anarchy on Uniformly Related Machines Revisited
- Computational social choice for coordination in agent networks
- Stackelberg thresholds in network routing games or the value of altruism
- Strong equilibrium in cost sharing connection games
- A generalization of correlated equilibrium: a new protocol
- On the performance of approximate equilibria in congestion games
- Computing approximate Nash equilibria in network congestion games
- The price of anarchy of serial, average and incremental cost sharing
- Atomic routing games on maximum congestion
- Strategic decentralization in binary choice composite congestion games
- Choice of routes in congested traffic networks: Experimental tests of the Braess paradox
- Stackelberg strategies for selfish routing in general multicommodity networks
- Congestion games with linearly independent paths: convergence time and price of anarchy
- On the severity of Braess's paradox: designing networks for selfish users is hard
- A note on a selfish bin packing problem
- Demand allocation with latency cost functions
- Computing Approximate Nash Equilibria in Network Congestion Games
- Stackelberg strategies and collusion in network games with splittable flow
- User equilibria for a parallel queueing system with state dependent routing
- HOW INDIVIDUALS LEARN TO TAKE TURNS: EMERGENCE OF ALTERNATING COOPERATION IN A CONGESTION GAME AND THE PRISONER'S DILEMMA
- On the efficiency of equilibria in mean-field oscillator games
- Non-cooperative facility location and covering games
- Non-cooperative tree creation
- Microeconomics-based resource allocation in overlay networks by using non-strategic behavior modeling
- The price of routing unsplittable flow
- A survey on the continuous nonlinear resource allocation problem
- An overview of Stackelberg pricing in networks
- Network design to anticipate selfish evacuation routing
- Equilibrium network design of shared-vehicle systems
- The combination of continuous network design and route guidance
- Cooperative power-aware scheduling in grid computing environments
- Title not available (Why is that?)
- Approximation and collusion in multicast cost sharing
- Selfish unsplittable flows
- Pricing bridges to cross a river
- Price of anarchy for highly congested routing games in parallel networks
- Designing fast converging cost sharing methods for multicast transmissions
- Bottleneck congestion games with logarithmic price of anarchy
- Congestion games with malicious players
- Serve or skip: the power of rejection in online bottleneck matching
- Approximating Wardrop equilibria with finitely many agents
- Toward microeconomic allocation of resources in multi-service overlay networks
- The worst absolute surplus loss in the problem of commons: random priority versus average cost
- Convergence and approximation in potential games
- Congestion games with failures
- Further results on capacitated network design games
- Self-interested routing in queueing networks
- Nonpreemptive coordination mechanisms for identical machines
- A paradox in a queueing network with state-dependent routing and loss
- Efficiency analysis of load balancing games with and without activation costs
- Computer science and decision theory
- Restoring Pure Equilibria to Weighted Congestion Games
- Social context congestion games
- The price of selfish routing
- The price of anarchy is independent of the network topology
- Selfish Routing with Oblivious Users
- Collusion in atomic splittable routing games
- Maximizing the minimum load: the cost of selfishness
- Introduction to the special issue -- Algorithmic game theory -- STOC/FOCS/SODA 2011
- On the price of anarchy of two-stage machine scheduling games
- 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
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)
