{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:10:37Z","timestamp":1742911837318,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319070001"},{"type":"electronic","value":"9783319070018"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07001-8_34","type":"book-chapter","created":{"date-parts":[[2014,7,9]],"date-time":"2014-07-09T15:13:03Z","timestamp":1404918783000},"page":"249-254","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Competition for Resources"],"prefix":"10.1007","author":[{"given":"Max","family":"Klimm","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,7,10]]},"reference":[{"issue":"6","key":"34_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1455248.1455249","volume":"55","author":"H Ackermann","year":"2008","unstructured":"Ackermann, H., R\u00f6glin, H., & V\u00f6cking, B. (2008). On the impact of combinatorial structure on congestion games. Journal of the ACM, 55(6), 1\u201322.","journal-title":"Journal of the ACM"},{"issue":"2","key":"34_CR2","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/j.geb.2008.03.005","volume":"65","author":"N Andelman","year":"2009","unstructured":"Andelman, N., Feldman, M., & Mansour, Y. (2009). Strong price of anarchy. Games and Economic Behavior, 65(2), 289\u2013317.","journal-title":"Games and Economic Behavior"},{"issue":"2\u20133","key":"34_CR3","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/j.tcs.2006.05.010","volume":"361","author":"B Awerbuch","year":"2006","unstructured":"Awerbuch, B., Azar, Y., Richter, Y., & Tsur, D. (2006). Tradeoffs in worst-case equilibria. Theoretical Computer Science, 361(2\u20133), 200\u2013209.","journal-title":"Theoretical Computer Science"},{"issue":"6","key":"34_CR4","doi-asserted-by":"publisher","first-page":"1173","DOI":"10.1109\/JSAC.2007.070811","volume":"25","author":"R Banner","year":"2007","unstructured":"Banner, R., & Orda, A. (2007). Bottleneck routing games in communication networks. IEEE Journal on Selected Areas in Communications, 25(6), 1173\u20131179.","journal-title":"IEEE Journal on Selected Areas in Communications"},{"issue":"3","key":"34_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1273340.1273348","volume":"3","author":"E Even-Dar","year":"2007","unstructured":"Even-Dar, E., Kesselman, A., & Mansour, Y. (2007). Convergence time to Nash equilibrium in load balancing. ACM Transactions on Algorithms, 3(3), 1\u201321.","journal-title":"ACM Transactions on Algorithms"},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Papadimitriou, C., Talwar, K. (2004). The complexity of pure Nash equilibria. In Proceedings of the thirty-sixth annual ACM symposium on theory of computing, pp. 604\u2013612.","DOI":"10.1145\/1007352.1007445"},{"issue":"2\u20133","key":"34_CR7","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/j.tcs.2005.09.024","volume":"348","author":"D Fotakis","year":"2005","unstructured":"Fotakis, D., Kontogiannis, S., & Spirakis, P. (2005). Selfish unsplittable flows. Theoretical Computer Science, 348(2\u20133), 226\u2013239.","journal-title":"Theoretical Computer Science"},{"key":"34_CR8","doi-asserted-by":"crossref","unstructured":"Goemans, M., Mirrokni, V., Vetta, A. (2005). Sink equilibria and convergence. In Proceedings of 46th annual IEEE symposium on foundations of computer science, pp. 142\u2013154.","DOI":"10.1109\/SFCS.2005.68"},{"key":"34_CR9","doi-asserted-by":"crossref","unstructured":"Harks, T., Klimm, M. (2011). Congestion games with variable demands. In Proceedings of the 13th conference on theoretical aspects of rationality and knowledge, pp. 111\u2013120.","DOI":"10.1145\/2000378.2000391"},{"issue":"3","key":"34_CR10","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1287\/moor.1120.0543","volume":"37","author":"T Harks","year":"2012","unstructured":"Harks, T., & Klimm, M. (2012). On the existence of pure Nash equilibria in weighted congestion games. Mathematics of Operations Research, 37(3), 419\u2013436.","journal-title":"Mathematics of Operations Research"},{"issue":"1","key":"34_CR11","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/s00224-011-9315-x","volume":"49","author":"T Harks","year":"2011","unstructured":"Harks, T., Klimm, M., & M\u00f6hring, R. (2011). Characterizing the existence of potential functions in weighted congestion games. Theory of Computing Systems, 49(1), 46\u201370.","journal-title":"Theory of Computing Systems"},{"key":"34_CR12","doi-asserted-by":"crossref","unstructured":"Harks, T., Hoefer, M., Klimm, M., & Skopalik, A. (2012a). Computing pure Nash and strong equilibria in bottleneck congestion games. To appear: Mathematical Programming.","DOI":"10.1007\/s10107-012-0521-3"},{"issue":"2","key":"34_CR13","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s00182-012-0322-1","volume":"42","author":"T Harks","year":"2012","unstructured":"Harks, T., Klimm, M., & M\u00f6hring, R. (2012b). Strong equilibria in games with the lexicographical improvement property. International Journal of Game Theory, 42(2), 461\u2013482.","journal-title":"International Journal of Game Theory"},{"key":"34_CR14","unstructured":"Klimm, M. (2012). Competition for resources: The equilibrium existence problem in congestion games. PhD thesis."},{"issue":"4","key":"34_CR15","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1023\/A:1016770831869","volume":"17","author":"L Libman","year":"2001","unstructured":"Libman, L., & Orda, A. (2001). Atomic resource sharing in noncooperative networks. Telecommunication Systems, 17(4), 385\u2013409.","journal-title":"Telecommunication Systems"},{"key":"34_CR16","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1073\/pnas.36.1.48","volume":"36","author":"J Nash","year":"1950","unstructured":"Nash, J. (1950). Equilibrium points in $$n$$-person games. Proceedings of the National Academy of Sciences, 36, 48\u201349.","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"34_CR17","first-page":"1","volume":"11","author":"P Panagopoulou","year":"2006","unstructured":"Panagopoulou, P., & Spirakis, P. (2006). Algorithms for pure Nash equilibria in weighted congestion games. Journal of Experimental Algorithmics, 11, 1\u201319.","journal-title":"Journal of Experimental Algorithmics"},{"issue":"1","key":"34_CR18","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"R Rosenthal","year":"1973","unstructured":"Rosenthal, R. (1973). A class of games possessing pure-strategy Nash equilibria. International Journal of Game Theory, 2(1), 65\u201367.","journal-title":"International Journal of Game Theory"}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2013"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07001-8_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T06:05:59Z","timestamp":1676873159000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-07001-8_34"}},"subtitle":["The Equilibrium Existence Problem in Congestion Games"],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319070001","9783319070018"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07001-8_34","relation":{},"ISSN":["0721-5924"],"issn-type":[{"type":"print","value":"0721-5924"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"10 July 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}