{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:21:28Z","timestamp":1725895288925},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642339950"},{"type":"electronic","value":"9783642339967"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33996-7_18","type":"book-chapter","created":{"date-parts":[[2012,10,6]],"date-time":"2012-10-06T07:27:01Z","timestamp":1349508421000},"page":"204-215","source":"Crossref","is-referenced-by-count":3,"title":["Congestion Games with Capacitated Resources"],"prefix":"10.1007","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","reference":[{"issue":"4","key":"18_CR1","doi-asserted-by":"publisher","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 Mathematics\u00a05(4), 439\u2013457 (2008)","journal-title":"Internet Mathematics"},{"key":"18_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":"18_CR3","doi-asserted-by":"publisher","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.\u00a038(4), 1602\u20131623 (2008)","journal-title":"SIAM J. Comput."},{"key":"18_CR4","unstructured":"Bauer, S., Clark, D., Lehr, W.: The evolution of internet congestion. In: 37th Research Conference on Communication, Information and Internet Policy, TPRC 2009 (2009)"},{"key":"18_CR5","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 Journal\u00a06, 138\u2013151 (1996)","journal-title":"ACM Multimedia Systems Journal"},{"key":"18_CR6","unstructured":"Chien, S., Sinclair, A.: Convergence to approximate nash equilibria in congestion games. In: SODA, pp. 169\u2013178 (2007)"},{"issue":"4","key":"18_CR7","doi-asserted-by":"publisher","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.\u00a029(4), 961\u2013976 (2004)","journal-title":"Math. Oper. Res."},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Even-Dar, E., Kesselman, A., Mansour, Y.: Convergence time to nash equilibrium in load balancing. ACM Transactions on Algorithms 3(3) (2007)","DOI":"10.1145\/1273340.1273348"},{"key":"18_CR9","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":"18_CR10","doi-asserted-by":"crossref","unstructured":"Farzad, B., Olver, N., Vetta, A.: A priority-based model of routing. Chicago J. Theor. Comput. Sci. 1 (2008)","DOI":"10.4086\/cjtcs.2008.001"},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/3-540-45465-9_12","volume-title":"Automata, Languages and Programming","author":"D. Fotakis","year":"2002","unstructured":"Fotakis, D., Kontogiannis, S., Koutsoupias, E., Mavronicolas, M., Spirakis, P.: The Structure and Complexity of Nash Equilibria for a Selfish Routing Game. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 123\u2013134. Springer, Heidelberg (2002)"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Gairing, M., L\u00fccking, T., Mavronicolas, M., Monien, B.: Computing nash equilibria for scheduling on restricted parallel links. In: STOC, pp. 613\u2013622. ACM (2004)","DOI":"10.1145\/1007352.1007446"},{"key":"18_CR13","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. W. H. Freeman and Company, New York (1979)"},{"key":"18_CR14","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)"},{"key":"18_CR15","unstructured":"Mangold, S., Choi, S., May, P., Klein, O., Hiertz, G., Stibor, L.: IEEE 802.11e Wireless LAN for quality of service. In: Proc. European Wireless, vol.\u00a018, pp. 32\u201339 (2002)"},{"issue":"1","key":"18_CR16","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-specific payoff functions. Games and Economic Behavior\u00a013(1), 111\u2013124 (1996)","journal-title":"Games and Economic Behavior"},{"key":"18_CR17","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":"18_CR18","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":"18_CR19","unstructured":"V\u00f6cking, B.: Congestion games: Optimization in competition. In: ACiD Workshop. Texts in Algorithmics, vol.\u00a07, pp. 9\u201320 (2006)"}],"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-33996-7_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,20]],"date-time":"2019-01-20T09:23:04Z","timestamp":1547976184000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33996-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642339950","9783642339967"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33996-7_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}