How bad is selfish routing?
From MaRDI portal
Publication:3196642
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
Cited in
(only showing first 100 items - show all)- Selfish Routing with Oblivious Users
- The price of anarchy is independent of the network topology
- Price of anarchy for mean field games
- The price of anarchy on uniformly related machines revisited
- Braess's Paradox in large random graphs
- Introduction to the special issue -- Algorithmic game theory -- STOC/FOCS/SODA 2011
- On the Braess paradox with nonlinear dynamics and control theory
- Malicious Bayesian Congestion Games
- The uniqueness property for networks with several origin-destination pairs
- On the price of anarchy of two-stage machine scheduling games
- Dynamics of a 2D piecewise linear Braess paradox model: effect of the third partition
- Network games with quantum strategies
- Synthesis from component libraries with costs
- Quality of strong equilibria for selfish bin packing with uniform cost sharing
- Parametric packing of selfish items and the subset sum algorithm
- Extending the notion of rationality of selfish agents: second order Nash equilibria
- Resolving Braess's paradox in random networks
- Social interactions and the prophylaxis of SI epidemics on networks
- A game-theoretic perspective of deep neural networks
- The price of anarchy in loss systems
- Timed network games with clocks
- Utilitarian resource assignment
- Price competition with elastic traffic
- Recursively modeling other agents for decision making: a research perspective
- Coordination mechanisms
- On the efficiency of price competition
- Equilibria for networks with malicious users
- The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands.
- \(r\)-extreme signalling for congestion control
- Continuum equilibria and global optimization for routing in dense static ad hoc networks
- Optimal routing of vehicles with communication capabilities in disasters
- Timed network games
- Selfish bin packing
- The impact of local policies on the quality of packet routing in paths, trees, and rings
- Agent-based randomized broadcasting in large networks
- 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
- A mean-risk model for the traffic assignment problem with stochastic travel times
- Potential games, path independence and Poisson's binomial distribution
- Nash equilibria in discrete routing games with convex latency functions
- Some anomalies of farsighted strategic behavior
- Approximate strong equilibria in job scheduling games with two uniformly related machines
- A polynomial-time algorithm for detecting the possibility of Braess paradox in directed graphs
- Cost-sharing in generalised selfish routing
- A class of selfish routing with oblivious agents
- Risk-averse selfish routing
- Bounding the inefficiency of the reliability-based continuous network design problem under cost recovery
- Balancing Load via Small Coalitions in Selfish Ring Routing Games
- A new scenario for Braess's paradox in power grids
- Online bottleneck matching
- Toll caps in privatized road networks
- Price and capacity competition
- Equilibrium and inefficiency in multi-product Cournot games
- The minimum tollbooth problem in atomic network congestion games with unsplittable flows
- Selfish routing
- Atomic congestion games with random players: network equilibrium and the price of anarchy
- Connectivity and equilibrium in random games
- Excluding Braess's paradox in nonatomic selfish routing
- Network QoS games: stability vs optimality tradeoff
- Introduction to computer science and economic theory
- Decompositions and potentials for normal form games
- Action-graph games
- Bounding the inefficiency of equilibria in nonatomic congestion games
- Braess's paradox in expanders
- Strong price of anarchy
- Constraint games for stable and optimal allocation of demands in SDN
- The price of stability for undirected broadcast network design with fair cost allocation is constant
- Monotonicity properties of user equilibrium policies for parallel batch systems
- The inefficiency of Nash and subgame perfect equilibria for network routing
- The price of selfish routing
- On spectrum sharing games
- Profit loss in differentiated oligopolies
- A convergence analysis of the price of anarchy in atomic congestion games
- Worst-case Nash equilibria in restricted routing
- Efficiency of atomic splittable selfish routing with polynomial cost functions
- Game-theoretic analysis of Internet switching with selfish users
- A Survey of Uniqueness Results for Selfish Routing
- The price of matching with metric preferences
- The cost of free spectrum
- Doing good with spam is hard
- A game-theoretic analysis of deep neural networks
- Two-group knapsack game
- Strong mediated equilibrium
- Braess' paradox: A cooperative game‐theoretic point of view
- An abstraction-refinement methodology for reasoning about network games
- On the existence of pure Nash equilibria in weighted congestion games
- Robust perfect equilibrium in large games
- Graphical congestion games
- On the price of anarchy for non-atomic congestion games under asymmetric cost maps and elastic demands
- A note on a parameter relating traffic equilibria and system optimal routing
- A mixed traffic assignment problem and its upper bound of efficiency loss
- Price of anarchy in a linear-state stochastic dynamic game
- Price of anarchy for supply chains with partial positive externalities
- When is selfish routing bad? The price of anarchy in light and heavy traffic
- Telecommunications network design: Technology impacts and future directions
- Achieving target equilibria in network routing games without knowing the latency functions
- On the efficiency of the proportional allocation mechanism for divisible resources
- Two-terminal routing games with unknown active players
- On the (in)efficiency of MFG equilibria
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)
