{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T08:45:40Z","timestamp":1743065140651,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642161698"},{"type":"electronic","value":"9783642161704"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16170-4_5","type":"book-chapter","created":{"date-parts":[[2010,10,13]],"date-time":"2010-10-13T12:08:07Z","timestamp":1286971687000},"page":"42-53","source":"Crossref","is-referenced-by-count":0,"title":["Partition Equilibrium Always Exists in Resource Selection Games"],"prefix":"10.1007","author":[{"given":"Elliot","family":"Anshelevich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bugra","family":"Caskurlu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ameya","family":"Hate","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","volume-title":"Contributions to Theory of Games IV","author":"R. Aumann","year":"1959","unstructured":"Aumann, R.: Acceptable Points in General Cooperative n-person Games. In: Contributions to Theory of Games IV. Princeton Univ. Press, Princeton (1959)"},{"key":"5_CR2","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1145\/1060590.1060599","volume-title":"Proceedings of The Thirty-Seventh Annual ACM Symposium on Theory of Computing","author":"B. Awerbuch","year":"2005","unstructured":"Awerbuch, B., Azar, Y., Epstein, L.: The Price of Routing Unsplittable Flow. In: Proceedings of The Thirty-Seventh Annual ACM Symposium on Theory of Computing, pp. 57\u201366. ACM, New York (2005)"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-642-04645-2_13","volume-title":"Algorithmic Game Theory","author":"C. Durr","year":"2009","unstructured":"Durr, C., Kim Thang, N.: Non-clairvoyant Scheduling Games. In: Mavronicolas, M., Papadopoulou, V.G. (eds.) SAGT 2009. LNCS, vol.\u00a05814, pp. 135\u2013146. Springer, Heidelberg (2009)"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-642-04645-2_6","volume-title":"Algorithmic Game Theory","author":"M. Feldman","year":"2009","unstructured":"Feldman, M., Tenneholtz, M.: Partition Equilibrium. In: Mavronicolas, M., Papadopoulou, V.G. (eds.) SAGT 2009. LNCS, vol.\u00a05814, pp. 48\u201359. Springer, Heidelberg (2009)"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/978-3-540-73420-8_51","volume-title":"Automata, Languages and Programming","author":"A. Fiat","year":"2007","unstructured":"Fiat, A., Kaplan, H., Levi, M., Olonetsky, S.: Strong Price of Anarchy for Machine Load Balancing. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 583\u2013594. Springer, Heidelberg (2007)"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/11786986_50","volume-title":"Automata, Languages and Programming","author":"D. Fotakis","year":"2006","unstructured":"Fotakis, D., Kontogiannis, S., Spirakis, P.: Atomic Congestion Games Among Coalitions. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04051, pp. 572\u2013583. Springer, Heidelberg (2006)"},{"key":"5_CR7","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1145\/1132516.1132529","volume-title":"Proceedings of The Thirty-Eighth Annual ACM Symposium on Theory of Computing","author":"A. Hayrapetyan","year":"2006","unstructured":"Hayrapetyan, A., Tardos, \u00c9., Wexler, T.: The Effect of Collusion in Congestion Games. In: Proceedings of The Thirty-Eighth Annual ACM Symposium on Theory of Computing, pp. 89\u201398. ACM, New York (2006)"},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1006\/game.1997.0592","volume":"21","author":"R. Holzman","year":"1997","unstructured":"Holzman, R., Law-Yone, N.: Strong Equilibrium in Congestion Games. Games and Economic Behavior\u00a021, 85\u2013101 (1997)","journal-title":"Games and Economic Behavior"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Holzman, R., Law-Yone, N.: Network structure and strong equilibrium in route selection games. Mathematical Social Sciences\u00a046, 193\u2013205 (2003)","DOI":"10.1016\/S0165-4896(03)00076-3"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/11600930_7","volume-title":"Internet and Network Economics","author":"N. Immorlica","year":"2005","unstructured":"Immorlica, N., Li, L., Mirrokni, V., Schulz, A.: Coordination Mechanisms for Selfish Scheduling. In: Deng, X., Ye, Y. (eds.) WINE 2005. LNCS, vol.\u00a03828, pp. 55\u201369. Springer, Heidelberg (2005)"},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1006\/game.1996.0044","volume":"14","author":"D. Monderer","year":"1996","unstructured":"Monderer, D., Shapley, L.: Potential Games. Games and Economic Behavior\u00a014, 124\u2013143 (1996)","journal-title":"Games and Economic Behavior"},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"R. Rosenthal","year":"1973","unstructured":"Rosenthal, R.: A class of games possessing pure-strategy Nash equilibria. International Journal of Game Theory\u00a02, 65\u201367 (1973)","journal-title":"International Journal of Game Theory"},{"key":"5_CR13","first-page":"1184","volume-title":"Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"T. Roughgarden","year":"2005","unstructured":"Roughgarden, T.: Selfish Routing with Atomic Players. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1184\u20131185. Society for Industrial and Applied Mathematics, Philadelphia (2005)"},{"issue":"1","key":"5_CR14","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s00453-006-1211-4","volume":"47","author":"S. Suri","year":"2007","unstructured":"Suri, S., Toth, C., Zhou, Y.: Selfish Load Balancing and Atomic Congestion Games. Algorithmica\u00a047(1), 79\u201396 (2007)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16170-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,11]],"date-time":"2021-11-11T19:40:48Z","timestamp":1636659648000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16170-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642161698","9783642161704"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16170-4_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}