Recommendations
- STACS 2004
- Mathematical Foundations of Computer Science 2003
- scientific article; zbMATH DE number 2156279
- Automata, Languages and Programming
- Facets of the fully mixed Nash equilibrium conjecture
- scientific article; zbMATH DE number 2038735
- A non-cooperative game for two typologies users routing in networks with side constraints
- The structure and complexity of Nash equilibria for a selfish routing game
- The price of selfish routing
- Tradeoffs and average-case equilibria in selfish routing
Cites work
- scientific article; zbMATH DE number 2038735 (Why is no real title available?)
- scientific article; zbMATH DE number 2086616 (Why is no real title available?)
- scientific article; zbMATH DE number 6472625 (Why is no real title available?)
- A class of games possessing pure-strategy Nash equilibria
- Approximate equilibria and ball fusion
- Automata, Languages and Programming
- Automata, Languages and Programming
- Competitive routing in networks with polynomial costs
- Computing Nash equilibria for scheduling on restricted parallel links
- Congestion games with player-specific payoff functions
- Convergence time to Nash equilibrium in load balancing
- Equilibrium points in n -person games
- Integer Programming and Combinatorial Optimization
- Mathematical Foundations of Computer Science 2003
- Mathematical Foundations of Computer Science 2003
- Non-cooperative games
- Record Allocation for Minimizing Expected Retrieval Costs on Drum-Like Storage Devices
- Selfish traffic allocation for server farms
- Selfish unsplittable flows
- Structure and complexity of extreme Nash equilibria
- The price of anarchy for polynomial social cost
- The price of anarchy of finite congestion games
- The price of routing unsplittable flow
- The price of selfish routing
- Tight bounds for worst-case equilibria
- Tighter bounds on a heuristic for a partition problem
- Tradeoffs in worst-case equilibria
- Traffic assignment problem for a general network
- Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation
- Worst-case equilibria
- Über ein Paradoxon aus der Verkehrsplanung
Cited in
(27)- The price of anarchy of affine congestion games with similar strategies
- Exact price of anarchy for weighted congestion games with two players
- Computation and efficiency of potential function minimizers of combinatorial congestion games
- Efficiency of equilibria in uniform matroid congestion games
- A Survey of Uniqueness Results for Selfish Routing
- Which is the worst-case Nash equilibrium?
- The price of anarchy in nonatomic consumption-relevance congestion games
- Facets of the fully mixed Nash equilibrium conjecture
- Bottleneck congestion games with logarithmic price of anarchy
- Inefficiency of pure Nash equilibria in series-parallel network congestion games
- A selective tour through congestion games
- Atomic routing games on maximum congestion
- Reconciling selfish routing with social good
- STACS 2004
- Selfish routing with incomplete information
- On Stackelberg strategies in affine congestion games
- On the impact of singleton strategies in congestion games
- The price of anarchy for polynomial social cost
- Mathematical Foundations of Computer Science 2003
- scientific article; zbMATH DE number 2156279 (Why is no real title available?)
- Algorithms and Computation
- Tight bounds for selfish and greedy load balancing
- Efficiency analysis of load balancing games with and without activation costs
- On Stackelberg strategies in affine congestion games
- The theory and application of nondeterministic selfish routing model
- Selfish Routing in Capacitated Networks
- Routing selfish unsplittable traffic
This page was built for publication: A new model for selfish routing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q952441)
