Sciweavers

27 search results - page 1 / 6
» The Price of Anarchy for Polynomial Social Cost
Sort
View
MFCS
2004
Springer
13 years 10 months ago
The Price of Anarchy for Polynomial Social Cost
Abstract. In this work, we consider an interesting variant of the wellstudied KP model [18] for selfish routing that reflects some influence from the much older Wardrop model [3...
Martin Gairing, Thomas Lücking, Marios Mavron...
STOC
2005
ACM
122views Algorithms» more  STOC 2005»
14 years 5 months ago
The price of anarchy of finite congestion games
We consider the price of anarchy of pure Nash equilibria in congestion games with linear latency functions. For asymmetric games, the price of anarchy of maximum social cost is ( ...
George Christodoulou, Elias Koutsoupias
DAGSTUHL
2007
13 years 6 months ago
Equilibria for two parallel links: The strong price of anarchy versus the price of anarchy
Following recent interest in the strong price of anarchy (SPOA), we consider this measure, as well as the well known price of anarchy (POA) for the job scheduling problem on two u...
Leah Epstein
ESA
2007
Springer
153views Algorithms» more  ESA 2007»
13 years 8 months ago
Tradeoffs and Average-Case Equilibria in Selfish Routing
We consider the price of selfish routing in terms of tradeoffs and from an average-case perspective. Each player in a network game seeks to send a message with a certain length by...
Martin Hoefer, Alexander Souza
ESA
2005
Springer
77views Algorithms» more  ESA 2005»
13 years 10 months ago
On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games
We consider the price of stability for Nash and correlated equilibria of linear congestion games. The price of stability is the optimistic price of anarchy, the ratio of the cost ...
George Christodoulou, Elias Koutsoupias