Sciweavers

179 search results - page 3 / 36
» Asynchronous Congestion Games
Sort
View
WINE
2009
Springer
184views Economy» more  WINE 2009»
14 years 1 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 1 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
ENTCS
2010
113views more  ENTCS 2010»
13 years 7 months ago
Geometry of Synthesis II: From Games to Delay-Insensitive Circuits
This paper extends previous work on the compilation of higher-order imperative languages into digital circuits [4]. We introduce concurrency, an essential feature in the context o...
Dan R. Ghica, Alex Smith
MST
2010
98views more  MST 2010»
13 years 5 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 27 days 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