8 search results - page 1 / 2 » Making Greed Work in Networks: A Game-Theoretic Analysis of ... |
SIGCOMM
1994
ACM
13 years 9 months ago
1994
ACM
This paper discusses congestion control from a game-theoretic perspective. There are two basic premises: (1) users are assumed to be independent and sel sh, and (2) central admini...
CN
2011
13 years 40 min ago
2011
In many scenarios network design is not enforced by a central authority, but arises from the interactions of several self-interested agents. This is the case of the Internet, wher...
SIGMETRICS
2004
ACM
13 years 10 months ago
2004
ACM
The Least Attained Service (LAS) scheduling policy, when used for scheduling packets over the bottleneck link of an Internet path, can greatly reduce the average flow time for sh...
MOBICOM
2003
ACM
13 years 10 months ago
2003
ACM
The competition among wireless data service providers brings in an option for the customers to switch their providers, due to unsatisfactory service or otherwise. However, the exi...
STOC
2006
ACM
14 years 5 months ago
2006
ACM
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...