Sciweavers

33 search results - page 4 / 7
» Congestion Games, Load Balancing, and Price of Anarchy
Sort
View
ICALP
2011
Springer
12 years 8 months ago
Restoring Pure Equilibria to Weighted Congestion Games
Abstract. Congestion games model several interesting applications, including routing and network formation games, and also possess attractive theoretical properties, including the ...
Konstantinos Kollias, Tim Roughgarden
GLOBECOM
2009
IEEE
14 years 4 days ago
Price of Anarchy for Cognitive MAC Games
—In this paper, we model and analyze the interactions between secondary users in a spectrum overlay cognitive system as a cognitive MAC game. In this game, each secondary user ca...
Lok Man Law, Jianwei Huang, Mingyan Liu, Shuo-Yen ...
ISAAC
2005
Springer
104views Algorithms» more  ISAAC 2005»
13 years 11 months ago
Network Load Games
We study network load games, a class of routing games in networks which generalize selfish routing games on networks consisting of parallel links. In these games, each user aims t...
Ioannis Caragiannis, Clemente Galdi, Christos Kakl...
WINE
2005
Springer
107views Economy» more  WINE 2005»
13 years 11 months ago
Price of Anarchy of Network Routing Games with Incomplete Information
We consider a class of networks where n agents need to send their traffic from a given source to a given destination over m identical, non-intersecting, and parallel links. For suc...
Dinesh Garg, Yadati Narahari
IPTPS
2004
Springer
13 years 10 months ago
Uncoordinated Load Balancing and Congestion Games in P2P Systems
In P2P systems, users often have many choices of peers from whom to download their data. Each user cares primarily about its own response time, which depends on how many other use...
Subhash Suri, Csaba D. Tóth, Yunhong Zhou