Sciweavers

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

6

STOC
2004
ACM

favoriteEmaildiscussreport

84views Algorithms» more STOC 2004»

Computing Nash equilibria for scheduling on restricted parallel links

14 years 4 months ago

Computing Nash equilibria for scheduling on restricted parallel links

Download www.cs.ucy.ac.cy

Martin Gairing, Thomas Lücking, Marios Mavron

Real-time Traffic

Algorithms | Nash Equilibria | STOC 2004 |

claim paper

Related Content

» Convergence Time to Nash Equilibria

» Network Load Games

» Equilibria for two parallel links The strong price of anarchy versus the price of anarchy

» On a network creation game

» Tradeoffs and AverageCase Equilibria in Selfish Routing

» Worstcase Equilibria

» Nonclairvoyant Scheduling Games

» Stackelberg Strategies and Collusion in Network Games with Splittable Flow

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2004
Where	STOC
Authors	Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien

Comments (0)