Sciweavers

157 search results - page 21 / 32
» Totality in arena games
Sort
View
GLOBECOM
2010
IEEE
13 years 5 months ago
A Coalition Formation Game in Partition Form for Peer-to-Peer File Sharing Networks
In current peer-to-peer file sharing networks, a large number of peers with heterogeneous connections simultaneously seek to download resources, e.g., files or file fragments, from...
Walid Saad, Zhu Han, Tamer Basar, Mérouane ...
MST
2010
196views more  MST 2010»
13 years 2 months ago
Non-Cooperative Cost Sharing Games via Subsidies
We consider a cost sharing system where users are selfish and act according to their own interest. There is a set of facilities and each facility provides services to a subset of ...
Niv Buchbinder, Liane Lewin-Eytan, Joseph Naor, Ar...
IPPS
2008
IEEE
14 years 1 months ago
Scaling alltoall collective on multi-core systems
MPI Alltoall is one of the most communication intense collective operation used in many parallel applications. Recently, the supercomputing arena has witnessed phenomenal growth o...
Rahul Kumar, Amith R. Mamidala, Dhabaleswar K. Pan...
INFOCOM
2010
IEEE
13 years 6 months ago
Price of Anarchy in Non-Cooperative Load Balancing
We investigate the price of anarchy of a load balancing game with K dispatchers. The service rates and holding costs are assumed to depend on the server, and the service disciplin...
Urtzi Ayesta, Olivier Brun, Balakrishna Prabhu
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
14 years 8 months ago
Intrinsic robustness of the price of anarchy
The price of anarchy (POA) is a worst-case measure of the inefficiency of selfish behavior, defined as the ratio of the objective function value of a worst Nash equilibrium of a g...
Tim Roughgarden