Sciweavers

ESA
2010
Springer
236views Algorithms» more  ESA 2010»
13 years 5 months ago
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
Tobias Harks, Martin Hoefer, Max Klimm, Alexander ...