Sciweavers

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

77

Voted

JEA
2006

74views more JEA 2006»

Algorithms for pure Nash equilibria in weighted congestion games

15 years 2 months ago

Algorithms for pure Nash equilibria in weighted congestion games

Download www.cs.ubc.ca

Panagiota N. Panagopoulou, Paul G. Spirakis

Real-time Traffic

JEA 2006 |

claim paper

Related Content

» Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games

» Restoring Pure Equilibria to Weighted Congestion Games

» Weighted Congestion Games Price of Anarchy Universal WorstCase Examples and Tightness

» The price of anarchy of finite congestion games

» Symmetry in Network Congestion Games Pure Equilibria and Anarchy Cost

» Hardness of Pure Nash Equilibrium in Scheduling and Connection Games

» Congestion Games Optimization in Competition

» Intrinsic robustness of the price of anarchy

» The Complexity of Equilibria in Cost Sharing Games

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2006
Where	JEA
Authors	Panagiota N. Panagopoulou, Paul G. Spirakis

Comments (0)