Basic network creation games

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2010, Pages 106-113

  Alon, Noga ^a,b   Demaine, Erik D ^c   Hajiaghayi, MohammadTaghi ^d,e   Leighton, Tom ^f,g  

^a TEL AVIV UNIVERSITY   (Israel)

^b INSTITUTE FOR ADVANCED STUDY   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^d AT AND T LABS RESEARCH   (United States)

^e Institute of Advanced Computer Science   (United States)

^f MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^g AKAMAI TECHNOLOGIES   (United States)

Author keywords

Nash equilibrium; Network design; Price of anarchy; Routing

Indexed keywords

CONSTANT FACTORS; LOCAL AVERAGE; LOWER BOUNDS; NASH EQUILIBRIUM; NATURAL NETWORKS; NETWORK CREATION; NETWORK DESIGN; POLYLOGARITHMIC; POLYNOMIAL-TIME; PRICE OF ANARCHY; TIGHT BOUND; UPPER BOUND;

POLYNOMIAL APPROXIMATION;

COSTS;

EID: 77954942810     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1810479.1810502     Document Type: Conference Paper

References (13)

1. S. ALBERS, On the value of coordination in network design, in Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, 2008. To appear.
2. S. ALBERS, S. EILTS, E. EVEN-DAR, Y. MANSOUR, AND L. RODITTY, On Nash equilibria for a network creation game, in Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, Miami, Florida, 2006, pp. 89-98.
3. N. ALON, Problems and results in extremal combinatorics. I, Discrete Mathematics, 273 (2003), pp. 31-53.
4. N. ANDELMAN, M. FELDMAN, AND Y. MANSOUR, Strong price of anarchy, in Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, 2007, pp. 189-198.
5. J. CORBO AND D. PARKES, The price of selfish behavior in bilateral network formation, in Proceedings of the 24th Annual ACM Symposium on Principles of Distributed Computing, Las Vegas, Nevada, 2005, pp. 99-107.
6. E. D. DEMAINE, Cache-oblivious algorithms and data structures, in Lecture Notes from the EEF Summer School on Massive Data Sets, Lecture Notes in Computer Science. To appear.
7. E. D. DEMAINE, M. HAJIAGHAYI, H. MAHINI, AND M. ZADIMOGHADDAM, The price of anarchy in network creation games, in Proceedings of the 26th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 2007, pp. 292-298.
8. -, The price of anarchy in cooperative network creation games, in Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS 2009), Freiburg, Germany, February 2009. To appear.
9. A. FABRIKANT, A. LUTHRA, E. MANEVA, C. H. PAPADIMITRIOU, AND S. SHENKER, On a network creation game, in Proceedings of the 22nd Annual Symposium on Principles of Distributed Computing, Boston, Massachusetts, 2003, pp. 347-351.
10. M. FRIGO, C. E. LEISERSON, H. PROKOP, AND S. RAMACHANDRAN, Cache-oblivious algorithms, in Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, New York, October 1999, pp. 285-297.
11. Y. HALEVI AND Y. MANSOUR, A network creation game with nonuniform interests, in Proceedings of the 3rd International Workshop on Internet and Network Economics, vol. 4858 of Lecture Notes in Computer Science, San Diego, CA, December 2007, pp. 287-292.
12. N. LAOUTARIS, L. J. POPLAWSKI, R. RAJARAMAN, R. SUNDARAM, AND S.-H. TENG, Bounded budget connection (BBC) games or how to make friends and inuence people, on a budget, in Proceedings of the 27th ACM Symposium on Principles of Distributed Computing, 2008, pp. 165-174.
13. T. TAO AND V. VU, Additive combinatorics, Cambridge University Press, Cambridge, 2006.