Unilateral Altruism in Network Routing Games with Atomic Players

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.
Type de document :
[Technical Report] 2011
Liste complète des métadonnées

Littérature citée [16 références]  Voir  Masquer  Télécharger

Contributeur : Amar Prakash Azad <>
Soumis le : mardi 16 août 2011 - 20:11:04
Dernière modification le : vendredi 16 septembre 2016 - 15:13:36
Document(s) archivé(s) le : jeudi 30 mars 2017 - 13:58:31


Fichiers produits par l'(les) auteur(s)


  • HAL Id : inria-00614842, version 1



Amar Prakash Azad, John Musacchio. Unilateral Altruism in Network Routing Games with Atomic Players. [Technical Report] 2011. 〈inria-00614842〉



Consultations de la notice


Téléchargements de fichiers