Unilateral Altruism in Network Routing Games with Atomic Players - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Poster Communications Year : 2011

Unilateral Altruism in Network Routing Games with Atomic Players

Amar Prakash Azad
  • Function : Author
  • PersonId : 914947
John Musacchio
  • Function : Author
  • PersonId : 914605

Abstract

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.
Fichier principal
Vignette du fichier
36-PID2142697.pdf (300.93 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00646340 , version 1 (29-11-2011)

Identifiers

  • HAL Id : hal-00646340 , version 1

Cite

Amar Prakash Azad, John Musacchio. Unilateral Altruism in Network Routing Games with Atomic Players. Roberto Cominetti and Sylvain Sorin and Bruno Tuffin. NetGCOOP 2011 : International conference on NETwork Games, COntrol and OPtimization, Oct 2011, Paris, France. pp.8. ⟨hal-00646340⟩

Collections

NETGCOOP2011
54 View
86 Download

Share

Gmail Facebook X LinkedIn More