Abstract
We review here some recently proposed models of non-cooperative network creation games where the nodes of a network perform edge swaps in order to improve their communication costs. Our focus is on examining the structure of stable (equilibrium) networks that correspond to efficient notions of equilibria, in the sense that the nodes of the network are able to decide which links to add and which to remove in order to achieve a minimal cost, given the strategies of the other nodes. We also review results on the capability of the network nodes of converging into an equilibrium network by performing local selfish improvement steps.
This work was partially supported by the European Social Fund and Greek national funds through the research funding program Thales on “Algorithmic Game Theory” and by the EU ERC Project “ALGAME”.
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
References
Alon, N., Demaine, E.D., Hajiaghayi, M., Kanellopoulos, P., Leighton, T.: Correction: basic network creation games. SIAM J. Discrete Math. 28(3), 1638–1640 (2014)
Alon, N., Demaine, E.D., Hajiaghayi, M., Leighton, T.: Basic network creation games. In: Proceedings of the 22nd ACM symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 106–113. ACM, New York (2010). (Also in SIAM Journal on Discrete Mathematics, vol. 27(2), pp. 656–668, 2013)
Ehsani, S., Fazli, M., Mehrabian, A., Sadeghian Sadeghabad, S., Safari, M., Saghafian, M., ShokatFadaee, S.: On a bounded budget network creation game. In: Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 207–214 (2011)
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 Computing, pp. 347–351, Boston, Massachusetts (2003)
Kawald, B., Lenzner, P.: On dynamics in selfish network creation. In: Proceedings of the 25th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2013), pp. 83–92 (2013)
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)
Nikoletseas, S., Panagopoulou, P., Raptopoulos, C., Spirakis, P.G.: On the structure of equilibria in basic network formation. In: Gąsieniec, L., Wolter, F. (eds.) FCT 2013. LNCS, vol. 8070, pp. 259–270. Springer, Heidelberg (2013)
Lenzner, P.: Greedy selfish network creation. In: Goldberg, P.W. (ed.) WINE 2012. LNCS, vol. 7695, pp. 142–155. Springer, Heidelberg (2012)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Panagopoulou, P.N. (2015). Efficient Equilibrium Concepts in Non-cooperative Network Formation. In: Zaroliagis, C., Pantziou, G., Kontogiannis, S. (eds) Algorithms, Probability, Networks, and Games. Lecture Notes in Computer Science(), vol 9295. Springer, Cham. https://doi.org/10.1007/978-3-319-24024-4_22
Download citation
DOI: https://doi.org/10.1007/978-3-319-24024-4_22
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-24023-7
Online ISBN: 978-3-319-24024-4
eBook Packages: Computer ScienceComputer Science (R0)