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

DOI10.1007/s10100-013-0295-6zbMath1339.91006OpenAlexW2043672253MaRDI QIDQ301322

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)

Related Items

Strong equilibria in games with the lexicographical improvement property

Cites Work

• Unnamed Item
• Unnamed Item
• Atomic routing games on maximum congestion
• Network topology and the efficiency of equilibrium
• Pure Nash equilibria in player-specific and weighted congestion games
• Efficient graph topologies in network routing games
• Minimum cost flow algorithms for series-parallel networks
• 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
• A class of games possessing pure-strategy Nash equilibria
• The complexity of pure Nash equilibria
• Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games
• A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees
• The Recognition of Series Parallel Digraphs
• Algorithms, games, and the internet
• The Price of Anarchy on Uniformly Related Machines Revisited
• Selfish Routing in Capacitated Networks
• Equilibrium points in n -person games
• Algorithms and Computation
• Approximation and Online Algorithms
• Atomic resource sharing in noncooperative networks

This page was built for publication: Computation of equilibria and the price of anarchy in bottleneck congestion games