{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:35:55Z","timestamp":1725572155400},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540228233"},{"type":"electronic","value":"9783540286295"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-28629-5_10","type":"book-chapter","created":{"date-parts":[[2010,12,17]],"date-time":"2010-12-17T17:59:50Z","timestamp":1292608790000},"page":"177-179","source":"Crossref","is-referenced-by-count":1,"title":["Congestion Games and Coordination Mechanisms"],"prefix":"10.1007","author":[{"given":"Elias","family":"Koutsoupias","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Cole, R., Dodis, Y., Roughgarden, T.: Pricing network edges for heterogeneous selfish users. In: ACM STOC, pp. 521\u2013530 (2003)","DOI":"10.1145\/780542.780618"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Koutsoupias, E., Nanavati, A.: Coordination mechanisms. In: ICALP (2004)","DOI":"10.1007\/978-3-540-27836-8_31"},{"key":"10_CR3","unstructured":"Czumaj, A., V\u00f6cking, B.: Tight Bounds for Worst-case Equilibria. In: ACM-SIAM SODA, pp. 413\u2013420 (2002)"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Gairing, M., L\u00fccking, T., Mavronikolas, M., Monien, B.: Computing Nash equilibria for scheduling on restricted parallel links. In: STOC (2004)","DOI":"10.1145\/1007352.1007446"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Koutsoupias, E., Papadimitriou, C.H.: Worst-case equilibria. In: STACS, pp. 404\u2013413 (1999)","DOI":"10.1007\/3-540-49116-3_38"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Monderer, D., Tennenholtz, M.: k-Implementation. In: ACM EC, pp. 19\u201328 (2003)","DOI":"10.1145\/779928.779931"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H.: Algorithms, games, and the Internet. In: ACM STOC, pp. 749\u2013753 (2001)","DOI":"10.1145\/380752.380883"},{"key":"10_CR8","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. International Journal of Game Theory\u00a02, 65\u201367 (1973)","journal-title":"International Journal of Game Theory"},{"issue":"2","key":"10_CR9","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? Journal of the ACM\u00a049(2), 236\u2013259 (2002)","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-28629-5_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:25:38Z","timestamp":1605759938000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-28629-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228233","9783540286295"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-28629-5_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}