A new model for selfish routing
From MaRDI portal
Publication:952441
DOI10.1016/J.TCS.2008.06.045zbMATH Open1154.91011OpenAlexW2075004702MaRDI QIDQ952441FDOQ952441
Authors: Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode 
Publication date: 12 November 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.06.045
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
Applications of game theory (91A80) Communication networks in operations research (90B18) Traffic problems in operations research (90B20)
Cites Work
- Non-cooperative games
- Equilibrium points in n -person games
- Worst-case equilibria
- A class of games possessing pure-strategy Nash equilibria
- Über ein Paradoxon aus der Verkehrsplanung
- Tight bounds for worst-case equilibria
- Traffic assignment problem for a general network
- The price of selfish routing
- Selfish unsplittable flows
- Congestion games with player-specific payoff functions
- Competitive routing in networks with polynomial costs
- Title not available (Why is that?)
- Approximate equilibria and ball fusion
- Convergence time to Nash equilibrium in load balancing
- The price of anarchy of finite congestion games
- Title not available (Why is that?)
- Mathematical Foundations of Computer Science 2003
- The price of routing unsplittable flow
- Tighter bounds on a heuristic for a partition problem
- Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation
- Selfish traffic allocation for server farms
- Computing Nash equilibria for scheduling on restricted parallel links
- Title not available (Why is that?)
- Tradeoffs in worst-case equilibria
- Structure and complexity of extreme Nash equilibria
- Record Allocation for Minimizing Expected Retrieval Costs on Drum-Like Storage Devices
- Mathematical Foundations of Computer Science 2003
- Automata, Languages and Programming
- The price of anarchy for polynomial social cost
- Integer Programming and Combinatorial Optimization
- Automata, Languages and Programming
Cited In (27)
- Which is the worst-case Nash equilibrium?
- Facets of the fully mixed Nash equilibrium conjecture
- STACS 2004
- On the impact of singleton strategies in congestion games
- Routing selfish unsplittable traffic
- Computation and efficiency of potential function minimizers of combinatorial congestion games
- A Survey of Uniqueness Results for Selfish Routing
- Exact price of anarchy for weighted congestion games with two players
- Efficiency of equilibria in uniform matroid congestion games
- Tight bounds for selfish and greedy load balancing
- Mathematical Foundations of Computer Science 2003
- Selfish routing with incomplete information
- The theory and application of nondeterministic selfish routing model
- Atomic routing games on maximum congestion
- Algorithms and Computation
- The price of anarchy in nonatomic consumption-relevance congestion games
- Inefficiency of pure Nash equilibria in series-parallel network congestion games
- On Stackelberg strategies in affine congestion games
- Bottleneck congestion games with logarithmic price of anarchy
- A selective tour through congestion games
- The price of anarchy for polynomial social cost
- Title not available (Why is that?)
- Efficiency analysis of load balancing games with and without activation costs
- On Stackelberg strategies in affine congestion games
- Selfish Routing in Capacitated Networks
- The price of anarchy of affine congestion games with similar strategies
- Reconciling selfish routing with social good
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)
