Advertisement

Network Creation Games with Traceroute-Based Strategies

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

Abstract

Network creation games model the autonomous formation of an interconnected system of selfish users. In particular, when the network will serve as a digital communication infrastructure, each user is identified by a node of the network, and contributes to the build-up process by strategically balancing between her building cost (i.e., the number of links she personally activates in the network) and her usage cost (i.e., some function of the distance in the sought network to the other players). When the corresponding game is analyzed, the generally adopted assumption is that players have a common and complete information about the evolving network topology, which is quite unrealistic though, due to the massive size this may have in practice. In this paper, we thus relax this assumption, by instead letting the players have only a partial knowledge of the network. To this respect, we make use of three popular traceroute-based knowledge models used in network discovering (i.e., the activity of reconstructing the topology of an unknown network through queries at its nodes), namely: (i) distance vector, (ii) shortest-path tree view, and (iii) layered view. For all these models, we provide exhaustive answers to the canonical algorithmic game theoretic questions: convergence, computational complexity for a player of selecting a best response, and tight bounds to the price of anarchy, all of them computed w.r.t. a suitable (and unifying) equilibrium concept.

Keywords

Network Creation Games Local-Knowledge Equilibrium Convergence Dynamics Price of Anarchy 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alon, N., Demaine, E.D., Hajiaghayi, M., Leighton, T.: Basic network creation games. In: Proc. of the 22nd ACM Symp. on Parallelism in Algorithms and Architectures (SPAA 2010), pp. 106–113. ACM Press (2010)Google Scholar
  2. 2.
    Bampas, E., Bilò, D., Drovandi, G., Gualà, L., Klasing, R., Proietti, G.: Network verification via routing table queries. In: Kosowski, A., Yamashita, M. (eds.) SIROCCO 2011. LNCS, vol. 6796, pp. 270–281. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  3. 3.
    Beerliova, Z., Eberhard, F., Erlebach, T., Hall, A., Hoffman, M., Mihalák, M., Ram, S.: Network discovery and verification. IEEE Journal on Selected Areas in Communications 24(12), 2168–2181 (2006)CrossRefGoogle Scholar
  4. 4.
    Bilò, D., Gualà, L., Leucci, S., Proietti, G.: The max-distance network creation game on general host graphs. In: Goldberg, P.W. (ed.) WINE 2012. LNCS, vol. 7695, pp. 392–405. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  5. 5.
    Bilò, D., Gualà, L., Leucci, S., Proietti, G.: Locality-based network creation games. In: Proc. of the 26th ACM Symp. on Parallelism in Algorithms and Architectures (SPAA 2014), pp. 277–286. ACM Press (2014)Google Scholar
  6. 6.
    Bilò, D., Gualà, L., Proietti, G.: Bounded-distance network creation games. In: Goldberg, P.W. (ed.) WINE 2012. LNCS, vol. 7695, pp. 72–85. Springer, Heidelberg (2012)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 Annual ACM Symp. 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 Symp. 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 Symp. on Principles of Distributed Computing (PODC 2003), pp. 347–351. ACM Press (2003)Google Scholar
  10. 10.
    Graham, R., Hamilton, L., Levavi, A., Loh, P.-S.: Anarchy is free in network creation. In: Bonato, A., Mitzenmacher, M., Prałat, P. (eds.) WAW 2013. LNCS, vol. 8305, pp. 220–231. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  11. 11.
    Kawald, B., Lenzner, P.: On dynamics in selfish network creation. In: Proc. of the 25th ACM Symp. on Parallelism in Algorithms and Architectures (SPAA 2013), pp. 83–92. ACM Press (2013)Google Scholar
  12. 12.
    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 Symp. on Principles of Distributed Computing (PODC 2008), pp. 165–174. ACM Press (2008)Google Scholar
  13. 13.
    Lenzner, P.: Greedy selfish network creation. In: Goldberg, P.W. (ed.) WINE 2012. LNCS, vol. 7695, pp. 142–155. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  14. 14.
    Mamageishvili, A., Mihalák, M., Müller, D.: Tree Nash equilibria in the network creation game. In: Bonato, A., Mitzenmacher, M., Prałat, P. (eds.) WAW 2013. LNCS, vol. 8305, pp. 118–129. Springer, Heidelberg (2013)CrossRefGoogle 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
  16. 16.
    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)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Davide Bilò
    • 1
  • Luciano Gualà
    • 2
  • Stefano Leucci
    • 3
  • 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