{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T11:28:35Z","timestamp":1778498915964,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642248283","type":"print"},{"value":"9783642248290","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-24829-0_22","type":"book-chapter","created":{"date-parts":[[2011,10,3]],"date-time":"2011-10-03T09:11:38Z","timestamp":1317633098000},"page":"236-253","source":"Crossref","is-referenced-by-count":13,"title":["On the Existence of Pure Strategy Nash Equilibria in Integer\u2013Splittable Weighted Congestion Games"],"prefix":"10.1007","author":[{"given":"Long","family":"Tran-Thanh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria","family":"Polukarov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Archie","family":"Chapman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alex","family":"Rogers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicholas R.","family":"Jennings","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","unstructured":"Beier, R., Czumaj, A., Krysta, P., V\u00f6cking, B.: Computing equilibria for congestion games with (im)perfect information. In: Proc. of SODA 2004, pp. 746\u2013755 (2004)"},{"key":"22_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-642-04645-2_20","volume-title":"Algorithmic Game Theory","author":"A. Byde","year":"2009","unstructured":"Byde, A., Polukarov, M., Jennings, N.R.: Games with congestion-averse utilities. In: Mavronicolas, M., Papadopoulou, V.G. (eds.) SAGT 2009. LNCS, vol.\u00a05814, pp. 220\u2013232. Springer, Heidelberg (2009)"},{"issue":"6","key":"22_CR3","doi-asserted-by":"publisher","first-page":"1421","DOI":"10.1287\/opre.1080.0653","volume":"57","author":"R. Cominetti","year":"2009","unstructured":"Cominetti, R., Correa, J.R., Stier-Moses, N.E.: The impact of oligopolistic competition in networks. Operations Research\u00a057(6), 1421\u20131437 (2009)","journal-title":"Operations Research"},{"issue":"4","key":"22_CR4","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1287\/moor.1080.0322","volume":"33","author":"J. Dunkel","year":"2008","unstructured":"Dunkel, J., Schulz, A.: On the complexity of pure-strategy nash equilibria in congestion and local-effect games. Mathemathics of Operations Research\u00a033(4), 851\u2013868 (2008)","journal-title":"Mathemathics of Operations Research"},{"key":"22_CR5","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 99","author":"E. Koutsoupias","year":"1999","unstructured":"Koutsoupias, E., Papadimitriou, C.H.: Worst\u2013case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, p. 404. Springer, Heidelberg (1999)"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Krysta, P., Sanders, P., V\u00f6cking, B.: Scheduling and traffic allocation for tasks with bounded splittability. In: Proc. of the 28th International Symposium on Mathematical Foundations of Computer Science, pp. 500\u2013510 (2003)","DOI":"10.1007\/978-3-540-45138-9_44"},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/j.geb.2005.08.005","volume":"56","author":"D.S. Leslie","year":"2006","unstructured":"Leslie, D.S., Collins, E.J.: Generalised weakened fictitious play. Games and Economic Behavior\u00a056, 285\u2013298 (2006)","journal-title":"Games and Economic Behavior"},{"key":"22_CR8","unstructured":"Leyton-Brown, K., Tennenholtz, M.: Local-effect games. In: Proc. of IJCAI 2003, pp. 772\u2013780 (2003)"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Marden, J.R., Arslan, G., Shamma, J.S.: Regret based dynamics: Convergence in weakly acyclic games. In: Proc. of AAMAS 2007, pp. 194\u2013201 (2007)","DOI":"10.1145\/1329125.1329175"},{"key":"22_CR10","unstructured":"Meyers, C.: Network flow problems and congestion games: complexity and approximation results. Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, MA, USA. AAI0809430 (2006)"},{"issue":"1","key":"22_CR11","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1006\/game.1996.0027","volume":"13","author":"I. Milchtaich","year":"1996","unstructured":"Milchtaich, I.: Congestion games with player\u2013specific payoff functions. Games and Economic Behavior\u00a013(1), 111\u2013124 (1996)","journal-title":"Games and Economic Behavior"},{"key":"22_CR12","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.S.: Potential games. Games and Economic Behavior\u00a014, 124\u2013143 (1996)","journal-title":"Games and Economic Behavior"},{"issue":"5","key":"22_CR13","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1109\/90.251910","volume":"1","author":"A. Orda","year":"1993","unstructured":"Orda, A., Rom, R., Shimkin, N.: Competitive routing in multiuser communication networks. IEEE\/ACM Trans. Networking\u00a01(5), 510\u2013521 (1993)","journal-title":"IEEE\/ACM Trans. Networking"},{"issue":"1","key":"22_CR14","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/j.geb.2009.03.004","volume":"67","author":"M. Penn","year":"2009","unstructured":"Penn, M., Polukarov, M., Tennenholtz, M.: Congestion games with load-dependent failures: Identical resources. Games and Economic Behavior\u00a067(1), 156\u2013173 (2009a)","journal-title":"Games and Economic Behavior"},{"issue":"3","key":"22_CR15","doi-asserted-by":"publisher","first-page":"706","DOI":"10.1287\/moor.1090.0394","volume":"34","author":"M. Penn","year":"2009","unstructured":"Penn, M., Polukarov, M., Tennenholtz, M.: Random order congestion games. Mathematics of Op. Res.\u00a034(3), 706\u2013725 (2009b)","journal-title":"Mathematics of Op. Res."},{"key":"22_CR16","doi-asserted-by":"publisher","first-page":"520","DOI":"10.2307\/1911749","volume":"33","author":"J. Rosen","year":"1965","unstructured":"Rosen, J.: Existence and uniqueness of equilibrium points for concave n-person games. Econometrica\u00a033, 520\u2013534 (1965)","journal-title":"Econometrica"},{"key":"22_CR17","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"R.W. Rosenthal","year":"1973","unstructured":"Rosenthal, R.W.: A class of games possessing pure-strategy Nash equilibria. Int. J. of Game Theory\u00a02, 65\u201367 (1973a)","journal-title":"Int. J. of Game Theory"},{"key":"22_CR18","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1002\/net.3230030104","volume":"3","author":"R.W. Rosenthal","year":"1973","unstructured":"Rosenthal, R.W.: The network equilibrium problem in integers. Networks\u00a03, 53\u201359 (1973b)","journal-title":"Networks"},{"issue":"2","key":"22_CR19","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49","author":"T. Roughgarden","year":"2002","unstructured":"Roughgarden, T., Tardos, E.: How bad is selfish routing? J. ACM\u00a049(2), 236\u2013259 (2002)","journal-title":"J. ACM"},{"key":"22_CR20","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1007\/s00453-001-0098-3","volume":"32","author":"H. Shachnai","year":"2002","unstructured":"Shachnai, H., Tamir, T.: Multiprocessor scheduling with machine allotment and parallelism constraints. Algorithmica\u00a032, 651\u2013678 (2002)","journal-title":"Algorithmica"},{"key":"22_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1007\/978-3-642-10841-9_61","volume-title":"Internet and Network Economics","author":"T.D. Voice","year":"2009","unstructured":"Voice, T.D., Polukarov, M., Jennings, N.R.: On the impact of strategy and utility structures on congestion-averse games. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol.\u00a05929, pp. 600\u2013607. Springer, Heidelberg (2009)"}],"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-24829-0_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,26]],"date-time":"2019-01-26T05:00:13Z","timestamp":1548478813000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24829-0_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642248283","9783642248290"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24829-0_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}