When ignorance helps: Graphical multicast cost sharing games

  • Authors:

  • Vittorio Bilò;Angelo Fanelli;Michele Flammini;Luca Moscardelli

  • Affiliations:

  • Dipartimento di Matematica, University of Salento, Provinciale Lecce-Arnesano, P.O. Box 193, 73100 Lecce, Italy;Department of Computer Science, RWTH Aachen University, Germany;Dipartimento di Informatica, University of LAquila, Via Vetoio, Loc. Coppito, 67100 LAquila, Italy;Dipartimento di Scienze, Viale Pindaro 42 - I-65127 Pescara, University of Chieti-Pescara, Italy

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2010

Quantified Score

Hi-index 5.23

Visualization

Abstract

In non-cooperative games played on highly decentralized networks the assumption that each player knows the strategy adopted by any other player may be too optimistic or even infeasible. In such situations, the set of players of which each player knows the chosen strategy can be modeled by means of a social knowledge graph in which nodes represent players and there is an edge from i to j if i knows j. Following the framework introduced in [7], we study the impact of social knowledge graphs on the fundamental multicast cost sharing game in which all the players want to receive the same communication from a given source in an undirected network. In the classical complete information case, such a game is known to be highly inefficient, since its price of anarchy can be as high as the total number of players @r. We first show that, under our incomplete information setting, pure Nash equilibria always exist only if the social knowledge graph is directed acyclic (DAG). We then prove that the price of stability of any DAG is at least 12log@r and provide a DAG lowering the classical price of anarchy to a value between 12log@r and log^2@r. If specific instances of the game are concerned, that is if the social knowledge graph can be selected as a function of the instance, we show that the price of stability is at least 4@r@r+3, and that the same bound holds also for the price of anarchy of any social knowledge graph (not only DAGs). Moreover, we provide a nearly matching upper bound by proving that, for any fixed instance, there always exists a DAG yielding a price of anarchy less than 4. Our results open a new window on how the performances of non-cooperative systems may benefit from the lack of total knowledge among players.