Chapter

Mathematical Foundations of Computer Science 2008

Volume 5162 of the series Lecture Notes in Computer Science pp 108-119

When Ignorance Helps: Graphical Multicast Cost Sharing Games

  • Vittorio BilòAffiliated withDepartment of Mathematics, University of Salento
  • , Angelo FanelliAffiliated withDepartment of Computer Science, University of L’Aquila
  • , Michele FlamminiAffiliated withDepartment of Computer Science, University of L’Aquila
  • , Luca MoscardelliAffiliated withDepartment of Computer Science, University of L’Aquila

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 unfeasible. 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 [3], we study the impact of social knowledge graphs on the fundamental multicast cost sharing game in which all the players wants to receive the same communication from a given source. Such a game in the classical complete information case is known to be highly inefficient, since its price of anarchy can be as high as the total number of players ρ. 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 \(\frac 1 2\log\rho\) and provide a DAG lowering the classical price of anarchy to a value between \(\frac 1 2\log\rho\) and log2 ρ. 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 \(\frac{4\rho}{\rho+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 and can be considered, in some sense, as another evidence of the famous Braess’ paradox.