12 search results - page 2 / 3 » The Price of Anarchy in Selfish Multicast Routing |
78
Voted
ICS
2010
Tsinghua U.
15 years 6 months ago
2010
Tsinghua U.
: We revisit price of anarchy in network routing, in a new model in which routing decisions are made by self-interested components of the network, as opposed to by the flows as in ...
ALGORITHMICA
2010
14 years 9 months ago
2010
We investigate the convergence of the price of anarchy after a limited number of moves in the classical multicast communication game when the underlying communication networks is ...
99
Voted
DFG
2009
Springer
15 years 4 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
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...
SIGECOM
2006
ACM
15 years 3 months ago
2006
ACM
We consider a multicast game with selfish non-cooperative players. There is a special source node and each player is interested in connecting to the source by making a routing de...