Skip to main content

Bounded-Distance Network Creation Games

  • Conference paper
Internet and Network Economics (WINE 2012)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 7695))

Included in the following conference series:


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)}\).

This work was partially supported by the PRIN 2008 research project COGENT (COmputational and GamE-theoretic aspects of uncoordinated NeTworks), funded by the Italian Ministry of Education, University, and Research.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others


  1. Universitat Politécnica de Catalunya, Barcelona, Spain

  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. 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. 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. Alon, N., Spencer, J.H.: The probabilistic method. John Wiley, New York (1992)

    MATH  Google Scholar 

  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)

    Chapter  Google Scholar 

  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. 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. 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. Jackson, M.O., Wolinsky, A.: A strategic model of social and economic networks. Journal of Economic Theory 71(1), 44–74 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  11. Jackson, M.O.: Social and Economic Networks. Princeton University Press (2010)

    Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  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. 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. 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)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations


Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bilò, D., Gualà, L., Proietti, G. (2012). Bounded-Distance Network Creation Games. In: Goldberg, P.W. (eds) Internet and Network Economics. WINE 2012. Lecture Notes in Computer Science, vol 7695. Springer, Berlin, Heidelberg.

Download citation

  • DOI:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-35310-9

  • Online ISBN: 978-3-642-35311-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics