24 search results - page 3 / 5 » Equilibria and Efficiency Loss in Games on Networks |
STOC
2006
ACM
15 years 9 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...
INFOCOM
2006
IEEE
15 years 3 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...
CCS
2008
ACM
14 years 11 months ago
2008
ACM
A frequently proposed solution to node misbehavior in mobile ad hoc networks is to use reputation systems. But in ephemeral networks - a new breed of mobile networks where contact...
97
Voted
TON
2010
14 years 4 months ago
2010
We study the contention/interaction among wireless nodes and med -ium access control design in game theory framework. We define a general class of games, called random access game...
NETWORKS
2008
14 years 9 months ago
2008
In this paper, we present a combined study of price competition and traffic control in a congested network. We study a model in which service providers own the routes in a network...