Sciweavers

Share
ESA
2010
Springer

Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games

3 years 8 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
Added 09 Nov 2010
Updated 09 Nov 2010
Type Conference
Year 2010
Where ESA
Authors Tobias Harks, Martin Hoefer, Max Klimm, Alexander Skopalik
Comments (0)
books