Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

18

ESA
2010
Springer

favoriteEmaildiscussreport

236views Algorithms» more ESA 2010»

Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games

13 years 5 months ago

Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games

Download www-i1.informatik.rwth-aachen.de

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

Real-time Traffic

Algorithms | Bottleneck Congestion Games | ESA 2010 | Improvement Dynamics | Strong Equilibria |

claim paper

Related Content

» On the Complexity of Paretooptimal Nash and Strong Equilibria

» Symmetry in Network Congestion Games Pure Equilibria and Anarchy Cost

» Approximating pure nash equilibrium in cut party affiliation and satisfiability games

» The Complexity of Equilibria in Cost Sharing Games

» Computing equilibria for congestion games with imperfect information

» Near Rationality and Competitive Equilibria in Networked Systems

» Spatial spectrum access game nash equilibria and distributed learning

» Market sharing games applied to content distribution in adhoc networks

» Asynchronous Congestion Games

Post Info
More Details (n/a)

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)