Computation of equilibria and the price of anarchy in bottleneck congestion games
From MaRDI portal
Publication:301322
DOI10.1007/S10100-013-0295-6zbMATH Open1339.91006OpenAlexW2043672253MaRDI QIDQ301322FDOQ301322
Authors: T. L. Werth, Sven O. Krumke, Heike Sperber 
Publication date: 30 June 2016
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10100-013-0295-6
Recommendations
- Bottleneck congestion games with logarithmic price of anarchy
- Computing pure Nash and strong equilibria in bottleneck congestion games
- Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games
- The strong price of anarchy of linear bottleneck congestion games
- Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy
- Congestion games with linearly independent paths: convergence time and price of anarchy
- Efficient computation of approximate pure Nash equilibria in congestion games
- On the Performance of Approximate Equilibria in Congestion Games
- On the performance of approximate equilibria in congestion games
- Price of anarchy for highly congested routing games in parallel networks
complexityprice of anarchynetwork bottleneck gameoptimal equilibriaprice of stabilityunsplittable flow
Cites Work
- Equilibrium points in n -person games
- Worst-case equilibria
- Selfish Routing in Capacitated Networks
- A class of games possessing pure-strategy Nash equilibria
- Title not available (Why is that?)
- Minimum cost flow algorithms for series-parallel networks
- The Recognition of Series Parallel Digraphs
- The complexity of pure Nash equilibria
- Pure Nash equilibria in player-specific and weighted congestion games
- A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees
- Efficient graph topologies in network routing games
- An improved general procedure for lexicographic bottleneck problems
- Lexicographic bottleneck combinatorial problems
- Network structure and strong equilibrium in route selection games.
- Strong equilibria in games with the lexicographical improvement property
- Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games
- Algorithms, games, and the internet
- The Price of Anarchy on Uniformly Related Machines Revisited
- Algorithms and Computation
- Approximation and Online Algorithms
- Atomic resource sharing in noncooperative networks
- Atomic routing games on maximum congestion
- Network topology and the efficiency of equilibrium
Cited In (9)
- Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games
- On the inefficiency of equilibria in linear bottleneck congestion games
- Computing pure Nash and strong equilibria in bottleneck congestion games
- The strong price of anarchy of linear bottleneck congestion games
- Price of anarchy for highly congested routing games in parallel networks
- Bottleneck congestion games with logarithmic price of anarchy
- Title not available (Why is that?)
- Strong equilibria in games with the lexicographical improvement property
- Robust bottleneck routing games
This page was built for publication: Computation of equilibria and the price of anarchy in bottleneck congestion games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q301322)
