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
- Synthesis from component libraries with costs
- 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
- 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
- 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
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)
