Network Creation Games: Think Global - Act Local

作者: Andreas Cord-Landwehr , Pascal Lenzner

DOI:

关键词:

摘要: We investigate a non-cooperative game-theoretic model for the formation of communication networks by selfish agents. Each agent aims central position at minimum cost creating edges. In particular, general (Fabrikant et al., PODC'03) became popular studying structure Internet or social networks. Despite its significance, locality in this game was first studied only recently (Bil\`o SPAA'14), where worst case presented, which came with high efficiency loss terms quality equilibria. Our main contribution is new and more optimistic view on locality: agents are limited their knowledge actions to local ranges, but can probe different strategies finally choose best. study influence our notion hardness computing best responses, convergence equilibria, Moreover, we compare strength versus non-local strategy-changes. results address gap between original variant. On bright side, line observations from model, yet have non-constant lower bound price anarchy.

参考文章(14)
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
Elias Koutsoupias, Christos Papadimitriou, Worst-case equilibria symposium on theoretical aspects of computer science. pp. 404- 413 ,(1999) , 10.1007/3-540-49116-3_38
David P. Williamson, David B. Shmoys, The Design of Approximation Algorithms ,(2011)
Vijay Arya, Naveen Garg, Rohit Khandekar, Adam Meyerson, Kamesh Munagala, Vinayaka Pandit, Local Search Heuristics for k -Median and Facility Location Problems SIAM Journal on Computing. ,vol. 33, pp. 544- 562 ,(2004) , 10.1137/S0097539702416402
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
Elliot Anshelevich, Anirban Dasgupta, Jon Kleinberg, Éva Tardos, Tom Wexler, Tim Roughgarden, The Price of Stability for Network Design with Fair Cost Allocation SIAM Journal on Computing. ,vol. 38, pp. 1602- 1623 ,(2008) , 10.1137/070680096
Venkatesh Bala, Sanjeev Goyal, A Noncooperative Model of Network Formation Networks and Groups. ,vol. 68, pp. 141- 184 ,(2003) , 10.1007/978-3-540-24790-6_7
Pascal Lenzner, On dynamics in basic network creation games algorithmic game theory. pp. 254- 265 ,(2011) , 10.1007/978-3-642-24829-0_23