Abstract
Network formation games capture two conflicting objectives of self-interested nodes in a network. On one hand, such a node wishes to be able to reach all other nodes in the network; on the other hand, it wishes to minimize its cost of participation. We focus on myopic dynamics in a class of such games inspired by transportation and communication models. A key property of the dynamics we study is that they are local: nodes can only deviate to form links with others in a restricted neighborhood. Despite this locality, we find that our dynamics converge to efficient or nearly efficient outcomes in a range of settings of interest.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Jackson, M.O.: A survey of models of network formation: Stability and efficiency. Working Paper 1161, California Institute of Technology, Division of the Humanities and Social Sciences (2003)
Jackson, M.O.: The stability and efficiency of economic and social networks. Microeconomics 0211011, EconWPA (November, 2002)
Jackson, M.O., Wolinsky, A.: A strategic model of social and economic networks. Journal of Economic Theory 71(1), 44–74 (1996)
Arcaute, E., Johari, R., Mannor, S.: Network formation: Bilateral contracting and myopic dynamics. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, vol. 4858, pp. 191–207. Springer, Heidelberg (2007)
Johari, R., Mannor, S., Tsitsiklis, J.N.: A contract-based model for directed network formation. Games and Economic Behavior 56(2), 201–224 (2006)
Jackson, M.O., Watts, A.: The existence of pairwise stable networks. Seoul Journal of Economics 14(3), 299–321 (2001)
Jackson, M.O., Watts, A.: The evolution of social and economic networks. Journal of Economic Theory 106(2), 265–295 (2002)
Roughgarden, T.: Selfish Routing and the Price of Anarchy. MIT Press, Cambridge (2005)
Lin Chen, H., Roughgarden, T., Valiant, G.: Designing networks with good equilibria. In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2007) (2008)
Anshelevich, E., Dasgupta, A., Tardos, É., Wexler, T.: Near-optimal network design with selfish agents. In: Proceedings of ACM Symposium on the Theory of Computing, pp. 511–520 (2003)
Fiat, A., Kaplan, H., Levy, M., Olonetsky, S., Shabo, R.: On the price of stability for designing undirected networks with fair cost allocations. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4051, pp. 608–618. Springer, Heidelberg (2006)
Fudenberg, D., Levine, D.K.: The Theory of Learning in Games. MIT Press, Cambridge (1998)
Cesa-Bianchi, N., Lugosi, G.: Prediction, Learning, and Games. Cambridge University Press, Cambridge (2004)
Mannor, S., Shamma, J.: Multi-agent learning for engineers. Artificial Intelligence, 417–422 (2007); Special Issue on Foundations of Multi-Agent Learning
Altman, E., Boulogne, T., El-Azouzi, R., Jiménez, T., Wynter, L.: A survey on networking games in telecommunications. Computers & Operations Research 33(2), 286–311 (2006)
Falkner, M., Devetsikiotis, M., Lambadaris, I.: An overview of pricing concepts for broadband IP networks. IEEE Communications Surveys 3(2) (2000)
Briscoe, B., Darlagiannis, V., Heckman, O., Oliver, H., Siris, V., Songhurst, D., Stiller, B.: A market managed multiservice Internet (M3I). Computer Communications 26(4), 404–414 (2003)
Komali, R., MacKenzie, A.: Distributed topology control in ad hoc networks: A game theoretic perspective. In: Proceedings of IEEE CCNC, pp. 563–568 (2006)
Eidenbenz, S., Kumar, V., Zust, S.: Equilibria in topology control games for ad hoc networks. In: Proceedings of International Conference on Mobile Computing and Networking, pp. 2–11 (2003)
Fabrikant, A., Luthra, A., Maneva, E.N., Papadimitriou, C.H., Shenker, S.: On a network creation game. In: Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing (PODC 2003), Boston, Massachusetts, USA, July 13-16, 2003, pp. 347–351 (2003)
Arcaute, E., Johari, R., Mannor, S.: Local two-stage myopic dynamics for network formation games. Technical report, Stanford University Management Science and Engineering (2008)
Osborne, M.J., Rubinstein, A.: Bargaining and Markets. Academic Press, San Diego (1990)
Bloch, F., Jackson, M.O.: The formation of networks with transfers among players. Journal of Economic Theory 133(1), 83–110 (2007)
Corbo, J., Parkes, D.: The price of selfish behavior in bilateral network formation. In: Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, PODC 2005, Las Vegas, NV, USA, July 17-20, 2005, pp. 99–107 (2005)
Arcaute, E., Johari, R., Mannor, S.: Network formation: Bilateral contracting and myopic dynamics. Technical report, Stanford University Management Science and Engineering (2007)
Papadimitriou, C.H.: Algorithms, games, and the internet. In: Proceedings on 33rd Annual ACM Symposium on Theory of Computing, Heraklion, Crete, Greece, July 6-8, 2001, pp. 749–753 (2001)
Anshelevich, E., Dasgupta, A., Kleinberg, J.M., Tardos, É., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. In: 45th Symposium on Foundations of Computer Science (FOCS 2004), Rome, Italy, 17-19 October 2004, pp. 295–304 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Arcaute, E., Johari, R., Mannor, S. (2008). Local Two-Stage Myopic Dynamics for Network Formation Games. In: Papadimitriou, C., Zhang, S. (eds) Internet and Network Economics. WINE 2008. Lecture Notes in Computer Science, vol 5385. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92185-1_33
Download citation
DOI: https://doi.org/10.1007/978-3-540-92185-1_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-92184-4
Online ISBN: 978-3-540-92185-1
eBook Packages: Computer ScienceComputer Science (R0)