50 search results - page 2 / 10 » Pricing network edges for heterogeneous selfish users |
STOC
2002
ACM
14 years 5 months ago
2002
ACM
We study the degradation in network performance caused by the selfish behavior of noncooperative network users. We consider a model of selfish routing in which the latency experie...
ICS
2010
Tsinghua U.
14 years 2 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 ...
SODA
2004
ACM
13 years 6 months ago
2004
ACM
We give several new upper and lower bounds on the worst-case severity of Braess's Paradox and the price of anarchy of selfish routing with respect to the maximum latency obje...
JSAC
2008
13 years 5 months ago
2008
In order to fully utilize scarce spectrum resources, dynamic spectrum allocation becomes a promising approach to increase the spectrum efficiency for wireless networks. However, th...
COCOON
2009
Springer
13 years 12 months ago
2009
Springer
: Network games play a fundamental role in understanding behavior in many domains, ranging from communication networks through markets to social networks. Such networks are used, a...