Computation of equilibria and the price of anarchy in bottleneck congestion games

DOI10.1007/S10100-013-0295-6MaRDI QIDQ301322zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

complexityprice of anarchynetwork bottleneck gameoptimal equilibriaprice of stabilityunsplittable flow

Mathematics Subject Classification ID

Noncooperative games (91A10) Combinatorial games (91A46)

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

Cites work

• scientific article; zbMATH DE number 3139273 (Why is no real title available?)
• A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees
• A class of games possessing pure-strategy Nash equilibria
• Algorithms and Computation
• Algorithms, games, and the internet
• An improved general procedure for lexicographic bottleneck problems
• Approximation and Online Algorithms
• Atomic resource sharing in noncooperative networks
• Atomic routing games on maximum congestion
• Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games
• Efficient graph topologies in network routing games
• Equilibrium points in n -person games
• Lexicographic bottleneck combinatorial problems
• Minimum cost flow algorithms for series-parallel networks
• Network structure and strong equilibrium in route selection games.
• Network topology and the efficiency of equilibrium
• Pure Nash equilibria in player-specific and weighted congestion games
• Selfish Routing in Capacitated Networks
• Strong equilibria in games with the lexicographical improvement property
• The Price of Anarchy on Uniformly Related Machines Revisited
• The Recognition of Series Parallel Digraphs
• The complexity of pure Nash equilibria
• Worst-case equilibria

Cited in

(9)

• Computing pure Nash and strong equilibria in bottleneck congestion games
• Strong equilibria in games with the lexicographical improvement property
• Robust bottleneck routing games
• Bottleneck congestion games with logarithmic price of anarchy
• Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games
• On the inefficiency of equilibria in linear bottleneck congestion games
• scientific article; zbMATH DE number 6481601 (Why is no real title available?)
• The strong price of anarchy of linear bottleneck congestion games
• Price of anarchy for highly congested routing games in parallel networks

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)