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
- Selfishness Need Not Be Bad
- 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
- Network Topologies for Weakly Pareto Optimal Nonatomic Selfish Routing
- 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
- Network Pricing: How to Induce Optimal Flows Under Strategic Link Operators
- The price of atomic selfish ring routing
- 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
- Potential Games Are Necessary to Ensure Pure Nash Equilibria in Cost Sharing Games
- Topological implications of selfish neighbor selection in unstructured peer-to-peer networks
- Approximate Strong Equilibrium in Job Scheduling Games
- On the Price of Anarchy of Highly Congested Nonatomic Network 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
- Subjective-cost policy routing
- The price of optimum: complexity and approximation for a matching game
- Fast, Fair, and Efficient Flows in Networks
- Braess's Paradox in large random graphs
- 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
- 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
- Online Learning of Nash Equilibria in Congestion Games
- Optimal Cost-Sharing in General Resource Selection Games
- Toll caps in privatized road networks
- Braess' paradox: A cooperative game‐theoretic point of view
- Equilibria of Greedy Combinatorial Auctions
- 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
- 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
- Title not available (Why is that?)
- The Price of Stability of Weighted Congestion Games
- The Price of Stability of Weighted Congestion Games
- Scheduling to Maximize Participation
- Edge pricing of multicommodity networks for selfish users with elastic demands
- Collusion in atomic splittable routing games
- Dynamic Resource Allocation Games
- Linear tolls suffice: new bounds and algorithms for tolls in single source networks
- Transfer implementation in congestion games
- Sensitivity of Wardrop Equilibria
- 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
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)
