Bounded-Distance Network Creation Games

  • Davide Bilò
  • Luciano Gualà
  • Guido Proietti
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7695)


A network creation game simulates a decentralized and non-cooperative building of a communication network. Informally, there are n players sitting on the network nodes, which attempt to establish a reciprocal communication by activating, incurring a certain cost, any of their incident links. The goal of each player is to have all the other nodes as close as possible in the resulting network, while buying as few links as possible. According to this intuition, any model of the game must then appropriately address a balance between these two conflicting objectives. Motivated by the fact that a player might have a strong requirement about its centrality in the network, in this paper we introduce a new setting in which if a player maintains its (either maximum or average) distance to the other nodes within a given bound, then its cost is simply equal to the number of activated edges, otherwise its cost is unbounded. We study the problem of understanding the structure of pure Nash equilibria of the resulting games, that we call MaxBD and SumBD, respectively. For both games, we show that when distance bounds associated with players are non-uniform, then equilibria can be arbitrarily bad. On the other hand, for MaxBD, we show that when nodes have a uniform bound R on the maximum distance, then the Price of Anarchy (PoA) is lower and upper bounded by 2 and \(O\left(n^{\frac{1}{\lfloor\log_3 R\rfloor+1}}\right)\) for R ≥ 3 (i.e., the PoA is constant as soon as R is Ω(n ε ), for some ε > 0), while for the interesting case R = 2, we are able to prove that the PoA is \(\Omega(\sqrt{n})\) and \(O(\sqrt{n \log n} )\). For the uniform SumBD we obtain similar (asymptotically) results, and moreover we show that the PoA becomes constant as soon as the bound on the average distance is \(2^{\omega\big({\sqrt{\log n}}\big)}\).


Nash Equilibrium Minimum Degree Social Optimum Distance Bound Extremal Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1. Universitat Politécnica de Catalunya, Barcelona, Spain
  2. 2.
    Albers, S., Eilts, S., Even-Dar, E., Mansour, Y., Roditty, L.: On Nash equilibria for a network creation game. In: Proc. of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA 2006), pp. 89–98. ACM Press (2006)Google Scholar
  3. 3.
    Anshelevich, E., Dasgupta, A., Tardos, É., Wexler, T.: Near-optimal network design with selfish agents. In: Proc. of the 35th Annual ACM Symposium on Theory of Computing (STOC 2003), pp. 511–520. ACM Press (2003)Google Scholar
  4. 4.
    Alon, N., Demaine, E.D., Hajiaghayi, M., Leighton, T.: Basic network creation games. In: Proc. of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2010), pp. 106–113. ACM Press (2010)Google Scholar
  5. 5.
    Alon, N., Spencer, J.H.: The probabilistic method. John Wiley, New York (1992)zbMATHGoogle Scholar
  6. 6.
    Baumann, N., Stiller, S.: The Price of Anarchy of a Network Creation Game with Exponential Payoff. In: Monien, B., Schroeder, U.-P. (eds.) SAGT 2008. LNCS, vol. 4997, pp. 218–229. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  7. 7.
    Demaine, E.D., Hajiaghayi, M., Mahini, H., Zadimoghaddam, M.: The price of anarchy in network creation games. In: Proc. of the 36th ACM Symposium on Principles of Distributed Computing (PODC 2007), pp. 292–298. ACM Press (2007)Google Scholar
  8. 8.
    Ehsani, S., Fazli, M., Mehrabian, A., Sadeghabad, S.S., Saghafian, M., Shokatfadaee, S., Safari, M.: On a bounded budget network creation game. In: Proc. of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2011), pp. 207–214. ACM Press (2011)Google Scholar
  9. 9.
    Fabrikant, A., Luthra, A., Maneva, E., Papadimitriou, C.H., Shenker, S.: On a network creation game. In: Proc. of the 22nd Symposium on Principles of Distributed Computing (PODC 2003), pp. 347–351. ACM Press (2003)Google Scholar
  10. 10.
    Jackson, M.O., Wolinsky, A.: A strategic model of social and economic networks. Journal of Economic Theory 71(1), 44–74 (1996)MathSciNetzbMATHCrossRefGoogle Scholar
  11. 11.
    Jackson, M.O.: Social and Economic Networks. Princeton University Press (2010)Google Scholar
  12. 12.
    Kariv, O., Hakimi, S.L.: An algorithmic approach to network location problems. II: The p-medians. SIAM J. Applied Math. 37(3), 539–560 (1979)MathSciNetzbMATHCrossRefGoogle Scholar
  13. 13.
    Koutsoupias, E., Papadimitriou, C.H.: Worst-Case Equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, pp. 404–413. Springer, Heidelberg (1999)Google Scholar
  14. 14.
    Laoutaris, N., Poplawski, L.J., Rajaraman, R., Sundaram, R., Teng, S.-H.: Bounded budget connection (BBC) games or how to make friends and influence people, on a budget. In: Proc. of the 27th ACM Symposium on Principles of Distributed Computing (PODC 2008), pp. 165–174. ACM Press (2008)Google Scholar
  15. 15.
    Mihalák, M., Schlegel, J.C.: The Price of Anarchy in Network Creation Games Is (Mostly) Constant. In: Kontogiannis, S., Koutsoupias, E., Spirakis, P.G. (eds.) SAGT 2010. LNCS, vol. 6386, pp. 276–287. Springer, Heidelberg (2010)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Davide Bilò
    • 1
  • Luciano Gualà
    • 2
  • Guido Proietti
    • 3
    • 4
  1. 1.Dipartimento di Scienze Umanistiche e SocialiUniversità di SassariItaly
  2. 2.Dipartimento di Ingegneria dell’ImpresaUniversità di Roma “Tor Vergata”Italy
  3. 3.Dipartimento di Ingegneria e Scienze dell’Informazione e MatematicaUniversità degli Studi dell’AquilaItaly
  4. 4.Istituto di Analisi dei Sistemi ed InformaticaCNRRomeItaly

Personalised recommendations