Locality-based network creation games

作者: Davide Bilò , Luciano Gualà , Stefano Leucci , Guido Proietti

DOI: 10.1145/2612669.2612680

关键词:

摘要: Network creation games have been extensively studied, both from economists and computer scientists, due to their versatility in modeling individual-based community formation processes, which turn are the theoretical counterpart of several economics, social, computational applications on Internet. However, generally adopted assumption is that players a common complete information about ongoing network, quite unrealistic practice. In this paper, we consider more compelling scenario only limited network they embedded in. More precisely, explore game theoretic implications assuming view restricted k-neighborhood, one most qualified ,local-knowledge models used distributed computing. To respect, define suitable equilibrium concept provide comprehensive set upper lower bounds price anarchy for entire range values k.

参考文章(19)
Matúš Mihalák, Jan Christoph Schlegel, Asymmetric swap-equilibrium: a unifying equilibrium concept for network creation games mathematical foundations of computer science. pp. 693- 704 ,(2012) , 10.1007/978-3-642-32589-2_60
Béla Bollobás, Extremal Graph Theory ,(1978)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, The max-distance network creation game on general host graphs workshop on internet and network economics. pp. 392- 405 ,(2012) , 10.1007/978-3-642-35311-6_29
Pascal Lenzner, Greedy selfish network creation workshop on internet and network economics. pp. 142- 155 ,(2012) , 10.1007/978-3-642-35311-6_11
Bernd Kawald, Pascal Lenzner, On dynamics in selfish network creation acm symposium on parallel algorithms and architectures. pp. 83- 92 ,(2013) , 10.1145/2486159.2486185
Nikolaos Laoutaris, Laura J. Poplawski, Rajmohan Rajaraman, Ravi Sundaram, Shang-Hua Teng, Bounded budget connection (BBC) games or how to make friends and influence people, on a budget principles of distributed computing. pp. 165- 174 ,(2008) , 10.1145/1400751.1400774
Alex Fabrikant, Ankur Luthra, Elitza Maneva, Christos H. Papadimitriou, Scott Shenker, On a network creation game Proceedings of the twenty-second annual symposium on Principles of distributed computing - PODC '03. pp. 347- 351 ,(2003) , 10.1145/872035.872088
Erik D. Demaine, Mohammadtaghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam, The price of anarchy in network creation games ACM Transactions on Algorithms. ,vol. 8, pp. 1- 13 ,(2012) , 10.1145/2151171.2151176
Noga Alon, Erik D. Demaine, Mohammad T. Hajiaghayi, Tom Leighton, Basic Network Creation Games SIAM Journal on Discrete Mathematics. ,vol. 27, pp. 656- 668 ,(2013) , 10.1137/090771478
F. Lazebnik, V. A. Ustimenko, A. J. Woldar, A new series of dense graphs of high girth Bulletin of the American Mathematical Society. ,vol. 32, pp. 73- 79 ,(1995) , 10.1090/S0273-0979-1995-00569-0