Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games

DOI10.1007/978-3-642-15781-3_3MaRDI QIDQ3586381zbMATH OpenOpenAlexFDO

Authors Tobias Harks, Martin Hoefer, Max Klimm, Alexander Skopalik

Publication date 6 September 2010

Published in Algorithms – ESA 2010 (Search for Journal in Brave)

Full work available at URL https://research.utwente.nl/en/publications/computing-pure-nash-and-strong-equilibria-in-bottleneck-congestion-games(4067cc21-1b71-4a03-ac6d-f5687c55579c).html

Mathematics Subject Classification ID

Noncooperative games (91A10) Games involving graphs (91A43)

Recommendations

• Computing pure Nash and strong equilibria in bottleneck congestion games
• Efficient computation of approximate pure Nash equilibria in congestion games
• Computation of equilibria and the price of anarchy in bottleneck congestion games
• Algorithms for pure Nash equilibria in weighted congestion games
• Computing approximate Nash equilibria in network congestion games
• Computing Approximate Nash Equilibria in Network Congestion Games
• Settling the complexity of Nash equilibrium in congestion games
• Improving approximate pure Nash equilibria in congestion games
• Computing approximate pure Nash equilibria in Shapley value weighted congestion games
• Pure Nash equilibria in player-specific and weighted congestion games

Cited in

(14)

• Computing pure Nash equilibria in network revenue management games
• Computing the strong Nash equilibrium for Markov chains games
• Computation and efficiency of potential function minimizers of combinatorial congestion games
• Computing the strong \(L_p\)-Nash equilibrium for Markov chains games: convergence and uniqueness
• Strong equilibria in games with the lexicographical improvement property
• Collusion in atomic splittable routing games
• Computation of equilibria and the price of anarchy in bottleneck congestion games
• On the complexity of Pareto-optimal Nash and strong equilibria
• On the impact of combinatorial structure on congestion games
• Algorithms for pure Nash equilibria in weighted congestion games
• On the complexity of Pareto-optimal Nash and strong equilibria
• Computing pure Nash and strong equilibria in bottleneck congestion games
• Equilibria in bottleneck games
• The strong price of anarchy of linear bottleneck congestion games

This page was built for publication: Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3586381)