Abstract
We introduce a new class of network creation games, called mobile network creation games, modelling the spontaneous creation of communication networks by the distributed and uncoordinated interaction of k selfish mobile devices. Each device is owned by a player able to select a node in an underlying positions graph so as to minimize a cost function taking into account two components: the distance from her home position, and the number of players she is not connected to, with the connectivity costs being prevailing, i.e., the Nash Equilibria are stable solution states in which communication is possible among all the players. We show that the game always admits a Pure Nash equilibrium, even if the convergence after a finite number of improving movements is guaranteed only when players perform their best possible moves. More precisely, if initial positions are arbitrary, that is not necessarily coinciding with the home ones, an order of kD best moves is necessary (and sufficient) to reach an equilibrium, where D is the diameter of the positions graph. As for the Nash equilibria performances, we first prove that the price of stability is 1 (i.e. an optimal solution is also a Nash equilibrium). Moreover, we show that the lack of centralized control of mobile devices is a major issue in terms of final performance guaranteed. Namely, the price of anarchy is Θ(kD). Nevertheless, we are able to prove that if players start at their home positions, in Θ(k min {k 2,D}) best moves they reach an equilibrium approximating the optimal solution by a factor of Θ(k min {k,D}).
This research was partially supported by the PRIN 2008 research project COGENT (COmputational and GamE-theoretic aspects of uncoordinated NeTworks), funded by the Italian Ministry of University and Research.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ackermann, H., Röglin, H., Vöcking, B.: On the impact of combinatorial structure on congestion games. J. ACM 55(6) (2008)
Alon, N., Demaine, E.D., Hajiaghayi, M.T., Leighton, T.: Basic network creation games. In: SPAA, pp. 106–113. ACM (2010)
Anshelevich, E., Dasgupta, A., Kleinberg, J.M., Tardos, É., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. In: FOCS, pp. 295–304. IEEE Computer Society (2004)
Biló, V., Flammini, M., Monaco, G., Moscardelli, L.: On the performances of nash equilibria in isolation games. J. Comb. Optim. 22(3), 378–391 (2011)
Demaine, E.D., Hajiaghayi, M.T., Mahini, H., Sayedi-Roshkhar, A.S., Oveisgharan, S., Zadimoghaddam, M.: Minimizing movement. ACM Transactions on Algorithms 5(3) (2009)
Demaine, E.D., Hajiaghayi, M.T., Mahini, H., Zadimoghaddam, M.: The price of anarchy in network creation games. In: PODC, pp. 292–298. ACM (2007)
Demaine, E.D., Hajiaghayi, M.T., Mahini, H., Zadimoghaddam, M.: The price of anarchy in cooperative network creation games. In: STACS, pp. 301–312 (2009)
Demaine, E.D., Hajiaghayi, M.T., Marx, D.: Minimizing Movement: Fixed-Parameter Tractability. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 718–729. Springer, Heidelberg (2009)
Dürr, C., Thang, N.K.: Nash Equilibria in Voronoi Games on Graphs. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol. 4698, pp. 17–28. Springer, Heidelberg (2007)
Fabrikant, A., Papadimitriou, C.H., Talwar, K.: The complexity of pure nash equilibria. In: STOC, pp. 604–612. ACM (2004)
Fabrikant, A., Luthra, A., Maneva, E., Papadimitriou, C.H., Shenker, S.: On a network creation game. In: PODC, pp. 347–351. ACM (2003)
Feldmann, R., Mavronicolas, M., Monien, B.: Nash Equilibria for Voronoi Games on Transitive Graphs. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol. 5929, pp. 280–291. Springer, Heidelberg (2009)
Friggstad, Z., Salavatipour, M.R.: Minimizing movement in mobile facility location problems. In: FOCS, pp. 357–366. IEEE Computer Society (2008)
Jackson, M.O., Wolinsky, A.: A strategic model of social and economic networks. Journal of Economic Theory 71(1), 44–74 (1996)
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)
Leonardi, S., Sankowski, P.: Network formation games with local coalitions. In: PODC, pp. 299–305. ACM (2007)
Nash, J.: Non-cooperative games. The Annals of Mathematics 54(2), 286–295 (1951)
Papadimitriou, C.H.: Algorithms, Games, and the Internet (Extended Abstract). In: Yu, Y., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 1–3. Springer, Heidelberg (2001)
Zhao, Y., Chen, W., Teng, S.-H.: The isolation game: A game of distances. Theor. Comput. Sci. 410(47-49), 4905–4919 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Flammini, M., Gallotti, V., Melideo, G., Monaco, G., Moscardelli, L. (2012). Mobile Network Creation Games. In: Even, G., Halldórsson, M.M. (eds) Structural Information and Communication Complexity. SIROCCO 2012. Lecture Notes in Computer Science, vol 7355. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31104-8_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-31104-8_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31103-1
Online ISBN: 978-3-642-31104-8
eBook Packages: Computer ScienceComputer Science (R0)