Sciweavers

243 search results - page 3 / 49
» Congestion games with failures
Sort
View
AAIM
2006
Springer
121views Algorithms» more  AAIM 2006»
14 years 3 months ago
Atomic Routing Games on Maximum Congestion
We study atomic routing games on networks in which players choose a path with the objective of minimizing the maximum congestion along the edges of their path. The social cost is t...
Costas Busch, Malik Magdon-Ismail
WINE
2009
Springer
184views Economy» more  WINE 2009»
14 years 4 months ago
Competitive Routing over Time
Congestion games are a fundamental and widely studied model for selfish allocation problems like routing and load balancing. An intrinsic property of these games is that players ...
Martin Hoefer, Vahab S. Mirrokni, Heiko Rögli...
WINE
2007
Springer
128views Economy» more  WINE 2007»
14 years 3 months ago
Total Latency in Singleton Congestion Games
Abstract. In this work, we consider singleton congestion games as a special class of (weighted) congestion games where each players' strategy consists only of a single resourc...
Martin Gairing, Florian Schoppmann
MST
2010
98views more  MST 2010»
13 years 8 months ago
Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy
Abstract. We investigate the effect of linear independence in the strategies of congestion games on the convergence time of best improvement sequences and on the pure Price of Anar...
Dimitris Fotakis
ESA
2005
Springer
77views Algorithms» more  ESA 2005»
14 years 3 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