Skip to main content
SpringerLink
Log in

On Network Formation Games with Heterogeneous Players and Basic Network Creation Games

  • Conference paper
  • First Online:
Algorithmic Aspects in Information and Management (AAIM 2016)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9778))

Included in the following conference series:

  • 421 Accesses

Abstract

We consider two variants of the network formation game that aims to capture the impact of selfish behavior, on behalf of the network administrators, on the overall network structure and performance. In particular, we study basic network creation games, where each player aims to minimize her distance to the remaining players, and we present an improved lower bound on the graph diameter of equilibria of this game. We also consider network formation games with a large number of heterogeneous players and monetary transfers, and prove tight bounds on the price of anarchy under realistic assumptions about the cost function. Finally, we argue about the setting where these heterogeneous players must be connected with additional node-disjoint paths to mitigate the impact of failures.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and 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

References

  1. Àlvarez, C., Serna, M., Fernàndez, A.: Network formation for asymmetric players and bilateral contracting. Theor. Comput. Syst. forthcoming. doi:10.1007/s00224-015-9640-6

    Google Scholar 

  2. Alon, N., Demaine, E., Hajiaghayi, M., Leighton, T.: Basic network creation games. SIAM J. Discrete Math. 27(2), 656–668 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  3. Alon, N., Demaine, E., Hajiaghayi, M., Kanellopoulos, P., Leighton, T.: Correction: basic network creation games. SIAM J. Discrete Math. 28(3), 1638–1640 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  4. Arcaute, E., Dyagilev, K., Johari, R., Mannor, S.: Dynamics in tree formation games. Games Econ. Behav. 79, 1–29 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  5. Bilò, D., Gualà, L., Leucci, S., Proietti, G.: Locality-based network creation games. In: Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 277–286 (2014)

    Google Scholar 

  6. Ehsani, S., Fadaee, S., Fazli, M., Mehrabian, A., Sadeghabad, S., Safari, M., Saghafian, M.: On a bounded budget network creation game. ACM Trans. Algorithms 11(4), 34 (2015)

    Article  MathSciNet  Google Scholar 

  7. Fabrikant, A., Luthra, A., Maneva, E., Papadimitriou, C.H., Shenker, S.: On a network creation game. In: Proceedings of the 22nd Annual Symposium on Principles of Distributed Computed (PODC), pp. 347–351 (2003)

    Google Scholar 

  8. Feldman, M., Immorlica, N., Lucier, B., Roughgarden, T., Syrgkanis, V.: The price of anarchy in large games. In: Proceedings of the 48th ACM Symposium on Theory of Computing (STOC) (2016)

    Google Scholar 

  9. Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, pp. 404–413. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  10. Lenzner, P.: On dynamics in basic network creation games. In: Persiano, G. (ed.) SAGT 2011. LNCS, vol. 6982, pp. 254–265. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  11. Meirom, E., Mannor, S., Orda, A.: Network formation games with heterogeneous players and the Internet structure. In: Proceedings of the 15th ACM Conference on Economics and Computation (EC), pp. 735–752 (2014)

    Google Scholar 

  12. Meirom, E., Mannor, S., Orda, A.: Formation games of reliable networks. In: Proceedings of the 2015 IEEE Conference on Computer Communications (INFOCOM), pp. 1760–1768 (2015)

    Google Scholar 

  13. Mamageisvhili, A., Mihalák, M., Müller, D.: Tree Nash equilibria in the network creation game. Internet Math. 11(4–5), 472–486 (2015)

    Article  MathSciNet  Google Scholar 

  14. Mihalák, M., Schlegel, J.C.: Asymmetric swap-equilibrium: a unifying equilibrium concept for network creation games. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol. 7464, pp. 693–704. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  15. Nikoletseas, S., Panagopoulou, P., Raptopoulos, C., Spirakis, P.G.: On the structure of equilibria in basic network formation. Theor. Comput. Sci. 590, 96–105 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  16. Panagopoulou, P.N.: Efficient equilibrium concepts in non-cooperative network formation. In: Zaroliagis, C., et al. (eds.) Spirakis Festschrift. LNCS, vol. 9295, pp. 384–395. Springer, Heidelberg (2015). doi:10.1007/978-3-319-24024-4_22

    Chapter  Google Scholar 

  17. Papadimitriou, C.H.: Algorithms, games and the Internet. In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC), pp. 749–753 (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering and Informatics, Computer Technology Institute and Press “Diophantus”, University of Patras, 26504, Rio, Greece

    Christos Kaklamanis, Panagiotis Kanellopoulos & Sophia Tsokana

Authors
  1. Christos Kaklamanis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Panagiotis Kanellopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sophia Tsokana
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Panagiotis Kanellopoulos .

Editor information

Editors and Affiliations

  1. Università degli Studi di Bergamo , Bergamo, Italy

    Riccardo Dondi

  2. Université de Nantes , Nantes, France

    Guillaume Fertin

  3. Università degli Studi di Milano-Bicocca , Milano, Italy

    Giancarlo Mauri

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Kaklamanis, C., Kanellopoulos, P., Tsokana, S. (2016). On Network Formation Games with Heterogeneous Players and Basic Network Creation Games. In: Dondi, R., Fertin, G., Mauri, G. (eds) Algorithmic Aspects in Information and Management. AAIM 2016. Lecture Notes in Computer Science(), vol 9778. Springer, Cham. https://doi.org/10.1007/978-3-319-41168-2_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-41168-2_11

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-41167-5

  • Online ISBN: 978-3-319-41168-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation