{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T13:52:08Z","timestamp":1770990728974,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540771043","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77105-0_28","type":"book-chapter","created":{"date-parts":[[2007,12,3]],"date-time":"2007-12-03T06:59:37Z","timestamp":1196665177000},"page":"287-292","source":"Crossref","is-referenced-by-count":7,"title":["A Network Creation Game with Nonuniform Interests"],"prefix":"10.1007","author":[{"given":"Yair","family":"Halevi","sequence":"first","affiliation":[]},{"given":"Yishay","family":"Mansour","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Albers, S., Eilts, S., Even-Dar, E., Mansour, Y., Roditty, L.: On nash equilibria for a network creation game. In: SODA, pp. 89\u201398 (2006)","DOI":"10.1145\/1109557.1109568"},{"issue":"1","key":"28_CR2","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s003730200002","volume":"18","author":"N. Alon","year":"2002","unstructured":"Alon, N., Hoory, S., Linial, N.: The Moore Bound for Irregular Graphs. Graphs and Combinatorics\u00a018(1), 53\u201357 (2002)","journal-title":"Graphs and Combinatorics"},{"key":"28_CR3","unstructured":"Andelman, N., Feldman, M., Mansour, Y.: Strong Price of Anarchy. In: SODA (2007)"},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"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\u2013304 (2004)","DOI":"10.1109\/FOCS.2004.68"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Anshelevich, E., Dasgupta, A., Tardos, E., Wexler, T.: Near-optimal network design with selfish agents. In: STOC, pp. 511\u2013520 (2003)","DOI":"10.1145\/780542.780617"},{"issue":"5","key":"28_CR6","doi-asserted-by":"publisher","first-page":"1181","DOI":"10.1111\/1468-0262.00155","volume":"68","author":"V. Bala","year":"2000","unstructured":"Bala, V., Goyal, S.: A Noncooperative Model of Network Formation. Econometrica\u00a068(5), 1181\u20131229 (2000)","journal-title":"Econometrica"},{"key":"28_CR7","volume-title":"Extremal graph theory","author":"B. Bollobas","year":"1978","unstructured":"Bollobas, B.: Extremal graph theory. Academic Press, London (1978)"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Corbo, J., Parkes, D.: The price of selfish behavior in bilateral network formation. In: PODC, pp. 99\u2013107 (2005)","DOI":"10.1145\/1073814.1073833"},{"issue":"4","key":"28_CR9","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1287\/moor.1040.0098","volume":"29","author":"J.R. Correa","year":"2004","unstructured":"Correa, J.R., Schulz, A.S., Stier-Moses, N.E.: Selfish Routing in Capacitated Networks. Mathematics of Operations Research\u00a029(4), 961\u2013976 (2004)","journal-title":"Mathematics of Operations Research"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"Czumaj, A., Krysta, P., Vocking, B.: Selfish traffic allocation for server farms. In: STOC, pp. 287\u2013296 (2002)","DOI":"10.1145\/509907.509952"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Luthra, A., Maneva, E., Papadimitriou, C.H., Shenker, S.: On a network creation game. In: PODC, pp. 347\u2013351 (2003)","DOI":"10.1145\/872035.872088"},{"key":"28_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/3-540-45465-9_12","volume-title":"Automata, Languages and Programming","author":"D. Fotakis","year":"2002","unstructured":"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.\u00a02380, pp. 123\u2013134. Springer, Heidelberg (2002)"},{"key":"28_CR13","unstructured":"Halevi, Y.: A Network Creation Game with Nonuniform Interests. Master\u2019s thesis, School of Computer Science, Tel Aviv University (2007), \n                      \n                        http:\/\/www.tau.ac.il\/~yairhale\/publish\/halevi_nincg_thesis.pdf"},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"Jain, K., Vazirani, V.: Applications of approximation algorithms to cooperative games. In: STOC, pp. 364\u2013372 (2001)","DOI":"10.1145\/380752.380825"},{"key":"28_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/3-540-49116-3_38","volume-title":"STACS 1999","author":"E. Koutsoupias","year":"1999","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, pp. 404\u2013413. Springer, Heidelberg (1999)"},{"issue":"2","key":"28_CR16","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49","author":"T. Roughgarden","year":"2002","unstructured":"Roughgarden, T., Tardos, \u00c9.: How bad is selfish routing?. Journal of the ACM (JACM)\u00a049(2), 236\u2013259 (2002)","journal-title":"Journal of the ACM (JACM)"}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77105-0_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:00:24Z","timestamp":1619521224000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77105-0_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540771043"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77105-0_28","relation":{},"subject":[]}}