The strong price of anarchy of linear bottleneck congestion games
From MaRDI portal
Publication:905688
DOI10.1007/S00224-014-9598-9zbMATH Open1409.91012OpenAlexW2085695690MaRDI QIDQ905688FDOQ905688
Authors: Bart de Keijzer, Guido Schäfer, Orestis A. Telelis 
Publication date: 28 January 2016
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/24020
Recommendations
- Strong and Pareto Price of Anarchy in Congestion Games
- Bottleneck congestion games with logarithmic price of anarchy
- Computation of equilibria and the price of anarchy in 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
- Algorithms – ESA 2005
- On the inefficiency of equilibria in linear bottleneck congestion games
- The price of anarchy of affine congestion games with similar strategies
- The asymptotic price of anarchy for \(k\)-uniform congestion games
- Exact price of anarchy for polynomial congestion games
Cites Work
- Worst-case equilibria
- Worst-case equilibria
- A class of games possessing pure-strategy Nash equilibria
- Potential games
- Tight bounds for worst-case equilibria
- Strong Price of Anarchy for Machine Load Balancing
- Approximate equilibria and ball fusion
- Selfish load balancing
- The price of anarchy of finite congestion games
- Coordination mechanisms for selfish scheduling
- Strong equilibria in games with the lexicographical improvement property
- Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games
- Algorithms, games, and the internet
- Algorithms and Computation
- Atomic routing games on maximum congestion
- The price of routing unsplittable flow
- On the inefficiency of equilibria in linear bottleneck congestion games
- Acceptable points in games of perfect information
- Performance guarantees of local search for multiprocessor scheduling
- A linear time approximation algorithm for multiprocessor scheduling
- Tradeoffs in worst-case equilibria
- Strong price of anarchy
- Exact Price of Anarchy for Polynomial Congestion Games
- Stretch in Bottleneck Games
Cited In (7)
- On the inefficiency of equilibria in linear bottleneck congestion games
- Computation of equilibria and the price of anarchy in bottleneck congestion games
- Local smoothness and the price of anarchy in splittable congestion games
- Strong and Pareto Price of Anarchy in Congestion Games
- Price of anarchy for highly congested routing games in parallel networks
- Bottleneck congestion games with logarithmic price of anarchy
- Strong equilibria in games with the lexicographical improvement property
This page was built for publication: The strong price of anarchy of linear bottleneck congestion games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q905688)
