Author:
Bilò Davide,Gualà Luciano,Proietti Guido
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. http://www-mat.upc.es/grup_de_grafs/grafs/taula_delta_d.html/ Universitat Politécnica de Catalunya, Barcelona, Spain
2. Albers, S., Eilts, S., Even-Dar, E., Mansour, Y., Roditty, L.: On Nash equilibria for a network creation game. In: Proc. of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA 2006), pp. 89–98. ACM Press (2006)
3. Anshelevich, E., Dasgupta, A., Tardos, É., Wexler, T.: Near-optimal network design with selfish agents. In: Proc. of the 35th Annual ACM Symposium on Theory of Computing (STOC 2003), pp. 511–520. ACM Press (2003)
4. Alon, N., Demaine, E.D., Hajiaghayi, M., Leighton, T.: Basic network creation games. In: Proc. of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2010), pp. 106–113. ACM Press (2010)
5. Alon, N., Spencer, J.H.: The probabilistic method. John Wiley, New York (1992)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Locality-Based Network Creation Games;ACM Transactions on Parallel Computing;2016-06-28
2. Max Celebrity Games;Lecture Notes in Computer Science;2016
3. A Bounded Budget Network Creation Game;ACM Transactions on Algorithms;2015-06-23
4. Network Formation for Asymmetric Players and Bilateral Contracting;Theory of Computing Systems;2015-06-12
5. Network Creation Games with Traceroute-Based Strategies;Structural Information and Communication Complexity;2014