{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T19:10:38Z","timestamp":1710357038532},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,4,4]],"date-time":"2013-04-04T00:00:00Z","timestamp":1365033600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1007\/s00224-013-9463-2","type":"journal-article","created":{"date-parts":[[2013,4,3]],"date-time":"2013-04-03T09:33:25Z","timestamp":1364981605000},"page":"73-85","source":"Crossref","is-referenced-by-count":4,"title":["Partition Equilibrium Always Exists in Resource Selection Games"],"prefix":"10.1007","volume":"53","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","published-online":{"date-parts":[[2013,4,4]]},"reference":[{"key":"9463_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 University Press, Princeton (1959)"},{"key":"9463_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)"},{"issue":"1","key":"9463_CR3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s00224-011-9316-9","volume":"49","author":"C. Durr","year":"2011","unstructured":"Durr, C., Thang, N.K.: Non-clairvoyant scheduling games. Theory Comput. Syst. 49(1), 3\u201323 (2011)","journal-title":"Theory Comput. Syst."},{"key":"9463_CR4","series-title":"LNCS","first-page":"48","volume-title":"SAGT 2009","author":"M. Feldman","year":"2009","unstructured":"Feldman, M., Tennenholtz, M.: Partition equilibrium. In: SAGT 2009. LNCS, vol. 5814, pp. 48\u201359. Heidelberg, Springer (2009)"},{"key":"9463_CR5","series-title":"LNCS","first-page":"583","volume-title":"ICALP 2007","author":"A. Fiat","year":"2007","unstructured":"Fiat, A., Kaplan, H., Levi, M., Olonetsky, S.: Strong price of anarchy for machine load balancing. In: ICALP 2007. LNCS, vol. 4596, pp. 583\u2013594. Heidelberg, Springer (2007)"},{"issue":"4","key":"9463_CR6","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1145\/1383369.1383383","volume":"4","author":"D. Fotakis","year":"2008","unstructured":"Fotakis, D., Kontogiannis, S., Spirakis, P.: Atomic congestion games among coalitions. ACM Trans. Algorithms 4(4), 52 (2008)","journal-title":"ACM Trans. Algorithms"},{"key":"9463_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":"9463_CR8","volume-title":"Proc. 22nd Intl. Joint Conf. Artificial Intelligence (IJCAI)","author":"M. Hoefer","year":"2011","unstructured":"Hoefer, M., Penn, M., Polukarov, M., Skopalik, A., V\u00f6cking, B.: Considerate equilibrium. In: Proc. 22nd Intl. Joint Conf. Artificial Intelligence (IJCAI) (2011)"},{"key":"9463_CR9","doi-asserted-by":"crossref","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 Econ. Behav. 21, 85\u2013101 (1997)","journal-title":"Games Econ. Behav."},{"key":"9463_CR10","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/S0165-4896(03)00076-3","volume":"46","author":"R. Holzman","year":"2003","unstructured":"Holzman, R., Law-Yone, N.: Network structure and strong equilibrium in route selection games. Math. Soc. Sci. 46, 193\u2013205 (2003)","journal-title":"Math. Soc. Sci."},{"issue":"17","key":"9463_CR11","doi-asserted-by":"crossref","first-page":"1589","DOI":"10.1016\/j.tcs.2008.12.032","volume":"410","author":"N. Immorlica","year":"2009","unstructured":"Immorlica, N., Li, L., Mirrokni, V., Schulz, A.: Coordination mechanisms for selfish scheduling. Theor. Comput. Sci. 410(17), 1589\u20131598 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"9463_CR12","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1006\/game.1996.0044","volume":"14","author":"D. Monderer","year":"1996","unstructured":"Monderer, D., Shapley, L.: Potential games. Games Econ. Behav. 14, 124\u2013143 (1996)","journal-title":"Games Econ. Behav."},{"key":"9463_CR13","doi-asserted-by":"crossref","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. Int. J. Game Theory 2, 65\u201367 (1973)","journal-title":"Int. J. Game Theory"},{"key":"9463_CR14","first-page":"1184","volume-title":"Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","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 (SODA), pp. 1184\u20131185. Society for Industrial and Applied Mathematics, Philadelphia (2005)"},{"issue":"1","key":"9463_CR15","doi-asserted-by":"crossref","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 47(1), 79\u201396 (2007)","journal-title":"Algorithmica"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-013-9463-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-013-9463-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-013-9463-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,12]],"date-time":"2022-02-12T22:20:52Z","timestamp":1644704452000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-013-9463-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4,4]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["9463"],"URL":"https:\/\/doi.org\/10.1007\/s00224-013-9463-2","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4,4]]}}}