168 search results - page 3 / 34 » The price of selfish routing |
WICON
2008
14 years 8 days 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...
FOCS
2004
IEEE
14 years 2 months ago
2004
IEEE
We examine how the selfish behavior of heterogeneous users in a network can be regulated through economic dis
STOC
2003
ACM
14 years 11 months ago
2003
ACM
INFOCOM
2006
IEEE
14 years 4 months ago
2006
IEEE
—We consider routing games where the performance of each user is dictated by the worst (bottleneck) element it employs. We are given a network, finitely many (selfish) users, eac...
ICC
2007
IEEE
14 years 5 months ago
2007
IEEE
– In this paper, we propose an auction mechanism for routing in mobile ad hoc networks with selfish nodes. Our approach is to promote bidding for end-to-end routes, as opposed to...