Sciweavers

Share
SIGECOM
2008
ACM

Altruism, selfishness, and spite in traffic routing

9 years 7 months ago
Altruism, selfishness, and spite in traffic routing
In this paper, we study the price of anarchy of traffic routing, under the assumption that users are partially altruistic or spiteful. We model such behavior by positing that the "cost" perceived by a user is a linear combination of the actual latency of the route chosen (selfish component), and the increase in latency the user causes for others (altruistic component). We show that if all users have a coefficient of at least > 0 for the altruistic component, then the price of anarchy is bounded by 1/, for all network topologies, arbitrary commodities, and arbitrary semi-convex latency functions. We extend this result to give more precise bounds on the price of anarchy for specific classes of latency functions, even for < 0 modeling spiteful behavior. In particular, we show that if all latency functions are linear, the price of anarchy is bounded by 4/(3 + 2 - 2 ). We next study non-uniform altruism distributions, where different users may have different coefficients ...
Po-An Chen, David Kempe
Added 15 Dec 2010
Updated 15 Dec 2010
Type Journal
Year 2008
Where SIGECOM
Authors Po-An Chen, David Kempe
Comments (0)
books