116 search results - page 1 / 24 » "Beat-Your-Rival" Routing Games |
ISAAC
2005
Springer
13 years 10 months ago
2005
Springer
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...
DFG
2009
Springer
13 years 11 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...
WICON
2008
13 years 6 months ago
2008
We consider congestion games in wireless sensor networks that offer quantitatively distinct classes of routing paths. Each routing class is characterized by a service cost. Within...
IPCO
2010
13 years 6 months ago
2010
Abstract. We study the quality of equilibrium in atomic splittable routing games. We show that in single-source single-sink games on seriesparallel graphs, the price of collusion -...
WINE
2009
Springer
13 years 11 months ago
2009
Springer
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 ...