Nash equilibria in discrete routing games with convex latency functions
From MaRDI portal
Publication:955351
DOI10.1016/J.JCSS.2008.07.001zbMath1152.91324OpenAlexW1996249306MaRDI QIDQ955351
Manuel Rode, Thomas Lücking, Burkhard Monien, Marios Mavronicolas, Martin Gairing
Publication date: 19 November 2008
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2008.07.001
Noncooperative games (91A10) Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (9)
Atomic routing games on maximum congestion ⋮ On Stackelberg Strategies in Affine Congestion Games ⋮ A Selective Tour Through Congestion Games ⋮ Price of anarchy for parallel link networks with generalized mean objective ⋮ Efficiency analysis of load balancing games with and without activation costs ⋮ Tight bounds for selfish and greedy load balancing ⋮ Computation and efficiency of potential function minimizers of combinatorial congestion games ⋮ Facets of the fully mixed Nash equilibrium conjecture ⋮ On Stackelberg strategies in affine congestion games
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The price of anarchy for polynomial social cost
- Selfish load balancing and atomic congestion games
- On the structure and complexity of worst-case equilibria
- New complexity results about Nash equilibria
- The price of selfish routing
- Submodular flow problem with a nonseparable cost function
- Approximate equilibria and ball fusion
- Congestion games with player-specific payoff functions
- Selfish routing with incomplete information
- Tradeoffs in worst-case equilibria
- A class of games possessing pure-strategy Nash equilibria
- Structure and complexity of extreme Nash equilibria
- Selfish unsplittable flows
- Non-cooperative games
- Tight bounds for worst-case equilibria
- How bad is selfish routing?
- Selfish traffic allocation for server farms
- Convergence time to Nash equilibrium in load balancing
- The price of anarchy of finite congestion games
- Tight Bounds for Selfish and Greedy Load Balancing
- A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
- Algorithms, games, and the internet
- STACS 2004
- Mathematical Foundations of Computer Science 2003
- Exact Price of Anarchy for Polynomial Congestion Games
- Facets of the Fully Mixed Nash Equilibrium Conjecture
- Bounds on Multiprocessing Timing Anomalies
- Traffic assignment problem for a general network
- Automata, Languages and Programming
- Equilibrium points in n -person games
- Approximation and Online Algorithms
- Computing Nash equilibria for scheduling on restricted parallel links
- The Price of Routing Unsplittable Flow
This page was built for publication: Nash equilibria in discrete routing games with convex latency functions
