1087 search results - page 3 / 218 » Dynamics in congestion games |
STOC
2009
ACM
14 years 9 months ago
2009
ACM
We study a general sub-class of concave games, which we call socially concave games. We show that if each player follows any no-external regret minimization procedure then the dyn...
IPTPS
2004
Springer
14 years 1 months ago
2004
Springer
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...
DFG
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. We give an overview of important results for non-atomic congestion games in their traditional form along with self-contained and short proofs and then present new results...
INFOCOM
2008
IEEE
14 years 3 months ago
2008
IEEE
—We consider a scenario in which users share an access point and are mainly interested in VoIP applications. Each user is allowed to adapt to varying network conditions by choosi...
STOC
2006
ACM
14 years 9 months ago
2006
ACM