Unilateral Altruism in Network Routing Games with Atomic Players

Details Unilateral Altruism in Network Routing Games with Atomic Players Unilateral Altruism in Network Routing Games with Atomic Players

2011-08-05

arxiv.org/abs/1108.1233v2

Computer Science

Computer Science and Game Theory

Scientific paper

We study a routing game in which one of the players unilaterally acts altruistically by taking into consideration the latency cost of other players as well as his own. By not playing selfishly, a player can not only improve the other players' equilibrium utility but also improve his own equilibrium utility. To quantify the effect, we define a metric called the Value of Unilateral Altruism (VoU) to be the ratio of the equilibrium utility of the altruistic user to the equilibrium utility he would have received in Nash equilibrium if he were selfish. We show by example that the VoU, in a game with nonlinear latency functions and atomic players, can be arbitrarily large. Since the Nash equilibrium social welfare of this example is arbitrarily far from social optimum, this example also has a Price of Anarchy (PoA) that is unbounded. The example is driven by there being a small number of players since the same example with non-atomic players yields a Nash equilibrium that is fully efficient.

Affiliated with

Also associated with

No associations

Rating

Unilateral Altruism in Network Routing Games with Atomic Players does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Unilateral Altruism in Network Routing Games with Atomic Players, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Unilateral Altruism in Network Routing Games with Atomic Players will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-667700