{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T05:23:17Z","timestamp":1775020997515,"version":"3.50.1"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,3,26]],"date-time":"2014-03-26T00:00:00Z","timestamp":1395792000000},"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":[[2015,10]]},"DOI":"10.1007\/s00224-014-9541-0","type":"journal-article","created":{"date-parts":[[2014,3,25]],"date-time":"2014-03-25T07:46:53Z","timestamp":1395733613000},"page":"598-616","source":"Crossref","is-referenced-by-count":5,"title":["Congestion Games with Capacitated Resources"],"prefix":"10.1007","volume":"57","author":[{"given":"Laurent","family":"Gourv\u00e8s","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00e9r\u00f4me","family":"Monnot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefano","family":"Moretti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nguyen Kim","family":"Thang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,3,26]]},"reference":[{"issue":"4","key":"9541_CR1","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1080\/15427951.2008.10129171","volume":"5","author":"H Ackermann","year":"2008","unstructured":"Ackermann, H., Goldberg, P., Mirrokni, V., R\u00f6glin, H., V\u00f6cking, B.: A unified approach to congestion games and two-sided markets. Internet Math. 5(4), 439\u2013457 (2008)","journal-title":"Internet Math."},{"key":"9541_CR2","doi-asserted-by":"crossref","unstructured":"Ackermann, H., R\u00f6glin, H., V\u00f6cking, B.: On the impact of combinatorial structure on congestion games. J. ACM 55(6) (2008)","DOI":"10.1145\/1455248.1455249"},{"issue":"4","key":"9541_CR3","doi-asserted-by":"crossref","first-page":"1602","DOI":"10.1137\/070680096","volume":"38","author":"E Anshelevich","year":"2008","unstructured":"Anshelevich, E., Dasgupta, A., Kleinberg, J., Tardos, E., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. SIAM J. Comput. 38(4), 1602\u20131623 (2008)","journal-title":"SIAM J. Comput."},{"key":"9541_CR4","unstructured":"Bauer, S., Clark, D., Lehr, W.: The evolution of internet congestion In: TPRC 2009, 37th Research Conference on Communication, Information and Internet Policy (2009)"},{"issue":"2","key":"9541_CR5","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1007\/s00453-010-9417-x","volume":"61","author":"V Bil\u00f2","year":"2011","unstructured":"Bil\u00f2, V., Fanelli, A., Flammini, M., Moscardelli, L.: Graphical congestion games. Algorithmica 61(2), 274\u2013297 (2011)","journal-title":"Algorithmica"},{"key":"9541_CR6","first-page":"138","volume":"6","author":"A Campbell","year":"1996","unstructured":"Campbell, A., Aurrecoechea, C., Hauw, L.: A review of QoS architectures. ACM Multimedia Systems J. 6, 138\u2013151 (1996)","journal-title":"ACM Multimedia Systems J."},{"key":"9541_CR7","unstructured":"Chien, S., Sinclair, A.: Convergence to approximate nash equilibria in congestion games In: SODA, pp 169\u2013178 (2007)"},{"key":"9541_CR8","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Koutsoupias, E.: The price of anarchy of finite congestion games In: STOC, pp 67\u201373 (2005)","DOI":"10.1145\/1060590.1060600"},{"issue":"4","key":"9541_CR9","doi-asserted-by":"crossref","first-page":"961","DOI":"10.1287\/moor.1040.0098","volume":"29","author":"J Correa","year":"2004","unstructured":"Correa, J., Schulz, A., Stier-Moses, N.: Selfish routing in capacitated networks. Math. Oper. Res. 29(4), 961\u2013976 (2004)","journal-title":"Math. Oper. Res."},{"key":"9541_CR10","unstructured":"Czerny, A.I., Mitusch, K., Tanner, A.: Priority rules versus scarcity premiums in rail markets. WHU Otto Beisheim School of Management - Working Paper Series in Economics 10(3) (2010)"},{"key":"9541_CR11","doi-asserted-by":"crossref","unstructured":"Even-Dar, E., Kesselman, A., Mansour, Y.: Convergence time to nash equilibrium in load balancing. ACM Trans. Algoritm. 3(3) (2007)","DOI":"10.1145\/1273340.1273348"},{"key":"9541_CR12","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Papadimitriou, C., Talwar, K.: The complexity of pure nash equilibria In: STOC, pp 604\u2013612 (2004)","DOI":"10.1145\/1007352.1007445"},{"key":"9541_CR13","doi-asserted-by":"crossref","unstructured":"Farzad, B., Olver, N., Vetta, A.: A priority-based model of routing. Chic. J. Theor. Comput. Sci., 1 (2008)","DOI":"10.4086\/cjtcs.2008.001"},{"key":"9541_CR14","doi-asserted-by":"crossref","unstructured":"Feldman, M., Ron, T.: Capacitated network design games. In: Serna, M. (ed.) Algorithmic Game Theory - 5th International Symposium, SAGT 2012, Barcelona, Spain, 22\u201323 October 2012. Proceedings of Lecture Notes in Computer Science, vol. 7615, pp. 132\u2013143. Springer (2012)","DOI":"10.1007\/978-3-642-33996-7_12"},{"issue":"36","key":"9541_CR15","doi-asserted-by":"crossref","first-page":"3305","DOI":"10.1016\/j.tcs.2008.01.004","volume":"410","author":"D Fotakis","year":"2009","unstructured":"Fotakis, D., Kontogiannis, S., Koutsoupias, E., Mavronicolas, M., Spirakis, P.: The structure and complexity of nash equilibria for a selfish routing game. Theor. Comput. Sci. 410(36), 3305\u20133326 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"9541_CR16","doi-asserted-by":"crossref","unstructured":"Gairing, M., L\u00fccking, T., Mavronicolas, M., Monien, B.: Computing nash equilibria for scheduling on restricted parallel linksIn: STOC, pp 613\u2013622. ACM (2004)","DOI":"10.1145\/1007352.1007446"},{"issue":"1","key":"9541_CR17","doi-asserted-by":"crossref","first-page":"9","DOI":"10.2307\/2312726","volume":"69","author":"D Gale","year":"1962","unstructured":"Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Am. Math. Mon. 69(1), 9\u201315 (1962)","journal-title":"Am. Math. Mon."},{"key":"9541_CR18","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)"},{"key":"9541_CR19","doi-asserted-by":"crossref","unstructured":"Gourv\u00e8s, L., Monnot, J., Moretti, S., Nguyen Kim, T.: Congestion games with capacitated resources. In: Serna, M. (ed.) Algorithmic Game Theory - 5th International Symposium, SAGT 2012, Barcelona, Spain, 22\u201323 October 2012. Proceedings of Lecture Notes in Computer Science, vol. 7615, pp.204\u2013215. Springer (2012)","DOI":"10.1007\/978-3-642-33996-7_18"},{"key":"9541_CR20","unstructured":"Gourv\u00e8s, L., Moretti, S.: Progress in Combinatorial Optimization. Combinatorial optimization problems arising from interactive congestion situations. ISTE Ltd, Wiley (2011)"},{"key":"9541_CR21","unstructured":"Ieong, S., McGrew, R., Nudelman, E., Shoham, Y., Sun, Q.: Fast and compact: a simple class of congestion games In: AAAI, pp 489\u2013494 (2005)"},{"issue":"4","key":"9541_CR22","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/j.regsciurbeco.2010.03.009","volume":"40","author":"H Konishi","year":"2010","unstructured":"Konishi, H., Mun, S.: Carpooling and congestion pricing: Hov and hot lanes. Reg. Sci. Urban Econ. 40(4), 173\u2013186 (2010)","journal-title":"Reg. Sci. Urban Econ."},{"key":"9541_CR23","doi-asserted-by":"crossref","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: 16th Annual Symposium on Theoretical Aspects of Computer Science, pp. 404\u2013413 (1999)","DOI":"10.1007\/3-540-49116-3_38"},{"issue":"2","key":"9541_CR24","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/j.cosrev.2009.04.003","volume":"3","author":"E Koutsoupias","year":"2009","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. Comput. Sci. Rev. 3(2), 65\u201369 (2009)","journal-title":"Comput. Sci. Rev."},{"key":"9541_CR25","doi-asserted-by":"crossref","unstructured":"Lee, K.D., Leung, V.C.M.: Utility-based rate-controlled parallel wireless transmission of multimedia streams with multiple importance levels. IEEE Trans. Mob. Comput., 81\u201392 (2009)","DOI":"10.1109\/TMC.2008.74"},{"key":"9541_CR26","unstructured":"Leyton-Brown, K., Tennenholtz, M.: Local-effect games. In: Lehmann, D.J., Muller, R., Sandholm, T. (eds.) Computing and Markets, volume 05011 of Dagstuhl Seminar Proceedings. Internationales Begegnungs- und Forschungszentrum f\u00fcr Informatik (IBFI), Schloss Dagstuhl, Germany IBFI, Schloss Dagstuhl, Germany (2005)"},{"issue":"12","key":"9541_CR27","doi-asserted-by":"crossref","first-page":"2107","DOI":"10.1057\/jors.2010.190","volume":"62","author":"G Lulli","year":"2011","unstructured":"Lulli, G., Pietropaoli, U., Ricciardi, N.: Service network design for freight railway transportation: the italian case. J. Oper. Res. Soc. 62(12), 2107\u20132119 (2011)","journal-title":"J. Oper. Res. Soc."},{"key":"9541_CR28","unstructured":"Mangold, S., Choi, S., May, P., Klein, O., Hiertz, G., Stibor, L.: IEEE 802.11e Wireless LAN for quality of serviceProceedings of European Wireless, vol. 18, pp 32\u201339 (2002)"},{"issue":"1","key":"9541_CR29","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1006\/game.1996.0027","volume":"13","author":"I Milchtaich","year":"1996","unstructured":"Milchtaich, I.: Congestion games with player-specific payoff functions. Games and Economic Behavior 13(1), 111\u2013124 (1996)","journal-title":"Games and Economic Behavior"},{"key":"9541_CR30","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 and Economic Behavior 14, 124\u2013143 (1996)","journal-title":"Games and Economic Behavior"},{"issue":"1","key":"9541_CR31","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1073\/pnas.36.1.48","volume":"36","author":"J Nash","year":"1950","unstructured":"Nash, J.: Equilibrium points in n-person games. Proceedings of the National Academy of Sciences of the United States of America 36(1), 48\u201349 (1950)","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"key":"9541_CR32","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"},{"issue":"2","key":"9541_CR33","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0022-0531(85)90106-1","volume":"36","author":"AE Roth","year":"1985","unstructured":"Roth, A.E.: The college admissions problem is not equivalent to the marriage problem. J. Econ. Theory 36(2), 277\u2013288 (1985)","journal-title":"J. Econ. Theory"},{"key":"9541_CR34","unstructured":"Serna, M. (ed.) Algorithmic Game Theory - 5th International Symposium, SAGT 2012, Barcelona, Spain, 22\u201323 October 2012. Proceedings of Lecture Notes in Computer Science, vol. 7615. Springer (2012)"},{"issue":"1","key":"9541_CR35","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/S1389-1286(02)00456-5","volume":"42","author":"X Su","year":"2003","unstructured":"Su, X., De Veciana, G.: Predictive routing to enhance qos for stream-based flows sharing excess bandwidth. Comput. Netw. 42(1), 65\u201380 (2003)","journal-title":"Comput. Netw."},{"key":"9541_CR36","unstructured":"V\u00f6cking, B.: Congestion games: optimization in competition. In: ACiD Workshop, Text in Algorithmics, vol. 7, pp. 9\u201320 (2006)"},{"key":"9541_CR37","unstructured":"Voorneveld, M.: Potential Games and Interactive Decisions with Multiple Criteria. PhD thesis, Tilburg University (1999)"},{"key":"9541_CR38","doi-asserted-by":"crossref","unstructured":"Zhao, Z., Willman, B., Weber, S., de Oliveira, J.C.: Performance analysis of a parallel link network with preemption In: 40th Annual Conference on Information Sciences and Systems, pp 271\u2013276 (2006)","DOI":"10.1109\/CISS.2006.286477"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-014-9541-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-014-9541-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-014-9541-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,8]],"date-time":"2019-08-08T21:54:45Z","timestamp":1565301285000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-014-9541-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3,26]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,10]]}},"alternative-id":["9541"],"URL":"https:\/\/doi.org\/10.1007\/s00224-014-9541-0","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,3,26]]}}}