Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games

Bottleneck congestion games properly model the properties of many real-world network routing applications. They are known to possess strong equilibria

• Type: Conference
• Year: 2010
• Where: ESA
• Authors: Tobias Harks, Martin Hoefer, Max Klimm, Alexander Skopalik
• Keywords: Algorithms, Bottleneck Congestion Games, ESA 2010, Improvement Dynamics, Strong Equilibria