A network creation game with nonuniform interests

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4858 LNCS, Issue , 2007, Pages 287-292

  Halevi, Yair ^a   Mansour, Yishay ^a,b  

^a TEL AVIV UNIVERSITY   (Israel)

^b GOOGLE INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER NETWORKS; COST FUNCTIONS; PROBABILITY; SET THEORY;

NASH EQUILIBRIA; NETWORK CREATION GAME; SOCIAL COSTS;

GAME THEORY;

EID: 38449093973     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77105-0_28     Document Type: Conference Paper

References (15)

1. Albers, S., Eilts, S., Even-Dar, E., Mansour, Y., Roditty, L.: On nash equilibria for a network creation game. In: SODA, pp. 89-98 (2006)
2. Alon, N., Hoory, S., Linial, N.: The Moore Bound for Irregular Graphs. Graphs and Combinatorics 18(1), 53-57 (2002)
3. Andelman, N., Feldman, M., Mansour, Y.: Strong Price of Anarchy. In: SODA (2007)
4. Anshelevich, E., Dasgupta, A., Kleinberg, J., Tardos, E., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. In: FOCS, pp. 295-304 (2004)
5. Anshelevich, E., Dasgupta, A., Tardos, E., Wexler, T.: Near-optimal network design with selfish agents. In: STOC, pp. 511-520 (2003)
6. Bala, V., Goyal, S.: A Noncooperative Model of Network Formation. Econometrica 68(5), 1181-1229 (2000)
7. [7 Bollobas, B.: Extremal graph theory. Academic Press, London (1978)
8. [8 Corbo, J., Parkes, D.: The price of selfish behavior in bilateral network formation. In: PODC, pp. 99-107 (2005)
9. Correa, J.R., Schulz, A.S., Stier-Moses, N.E.: Selfish Routing in Capacitated Networks. Mathematics of Operations Research 29(4), 961-976 (2004)
10. Czumaj, A., Krysta, P., Vocking, B.: Selfish traffic allocation for server farms. In: STOC, pp. 287-296 (2002)
11. Fabrikant, A., Luthra, A., Maneva, E., Papadimitriou, C.H., Shenker, S.: On a network creation game. In: PODC, pp. 347-351 (2003)
12. Fotakis, D., Kontogiannis, S., Koutsoupias, E., Mavronicolas, M., Spirakis, P.: The Structure and Complexity of Nash Equilibria for a Selfish Routing Game. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 123-134. Springer, Heidelberg (2002)
13. Halevi, Y.: A Network Creation Game with Nonuniform Interests. Master's thesis, School of Computer Science, Tel Aviv University (2007), http://www.tau.ac.il/~yairhale/publish/halevi.nincg-thesis.pdf [14] Jain, K., Vazirani, V.: Applications of approximation algorithms to cooperative games. In: STOC, pp. 364-372 (2001)
14. Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, pp. 404-413. Springer, Heidelberg (1999)
15. Roughgarden, T., Tardos, É.: How bad is selfish routing?. Journal of the ACM (JACM) 49(2), 236-259 (2002)