{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:32:40Z","timestamp":1759638760760},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319131283"},{"type":"electronic","value":"9783319131290"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-13129-0_35","type":"book-chapter","created":{"date-parts":[[2014,12,1]],"date-time":"2014-12-01T11:08:41Z","timestamp":1417432121000},"page":"429-434","source":"Crossref","is-referenced-by-count":14,"title":["The Sequential Price of Anarchy for Atomic Congestion Games"],"prefix":"10.1007","author":[{"given":"Jasper","family":"de Jong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Uetz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"35_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-642-38768-5_4","volume-title":"Computing and Combinatorics","author":"A. Angelucci","year":"2013","unstructured":"Angelucci, A., Bil\u00f2, V., Flammini, M., Moscardelli, L.: On the Sequential Price of Anarchy of Isolation Games. In: Du, D.-Z., Zhang, G. (eds.) COCOON 2013. LNCS, vol.\u00a07936, pp. 17\u201328. Springer, Heidelberg (2013)"},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Epstein, A.: The Price of Routing Unsplittable Flow. In: Proceedings 37th STOC, pp. 57\u201366 (2005)","DOI":"10.1145\/1060590.1060599"},{"key":"35_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-642-38016-7_19","volume-title":"Approximation and Online Algorithms","author":"V. Bil\u00f2","year":"2013","unstructured":"Bil\u00f2, V., Flammini, M., Monaco, G., Moscardelli, L.: Some Anomalies of Farsighted Strategic Behavior. In: Erlebach, T., Persiano, G. (eds.) WAOA 2012. LNCS, vol.\u00a07846, pp. 229\u2013241. Springer, Heidelberg (2013)"},{"key":"35_CR4","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Flammini, M., Kaklamanis, C., Kanellopoulos, P., Moscardelli, L.: Tight Bounds for Selfish and Greedy Load Balancing. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006, Part I. LNCS, vol.\u00a04051, pp. 311\u2013322. Springer, Heidelberg (2006)","DOI":"10.1007\/11786986_28"},{"key":"35_CR5","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Koutsoupias, E.: The Price of Anarchy of Finite Congestion Games. In: Proceedings 37th STOC, pp. 67\u201373 (2005)","DOI":"10.1145\/1060590.1060600"},{"key":"35_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-642-38233-8_12","volume-title":"Algorithms and Complexity","author":"J. Jong de","year":"2013","unstructured":"de Jong, J., Uetz, M., Wombacher, A.: Decentralized Throughput Scheduling. In: Spirakis, P.G., Serna, M. (eds.) CIAC 2013. LNCS, vol.\u00a07878, pp. 134\u2013145. Springer, Heidelberg (2013)"},{"key":"35_CR7","doi-asserted-by":"crossref","unstructured":"de Jong, J., Uetz, M.: The sequential price of anarchy for atomic congestion games, TR-CTIT-14-09, CTIT, University of Twente (2014)","DOI":"10.1007\/978-3-319-13129-0_35"},{"key":"35_CR8","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/s00224-008-9152-8","volume":"47","author":"D. Fotakis","year":"2010","unstructured":"Fotakis, D.: Stackelberg Strategies for Atomic Congestion Games. Theory of Computing Systems\u00a047, 218\u2013249 (2010)","journal-title":"Theory of Computing Systems"},{"key":"35_CR9","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.: Worst-case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, pp. 404\u2013413. Springer, Heidelberg (1999)"},{"key":"35_CR10","doi-asserted-by":"crossref","unstructured":"Kuhn, H.W.: Extensive Games and the Problem of Information, Contribution to the Theory of Games. Annals of Math. Studies, vol.\u00a0II, 28, pp. 193\u2013216 (1953)","DOI":"10.1515\/9781400881970-012"},{"key":"35_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/978-3-540-24749-4_48","volume-title":"STACS 2004","author":"T. L\u00fccking","year":"2004","unstructured":"L\u00fccking, T., Mavronicolas, M., Monien, B., Rode, M.: A New Model for Selfish Routing. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol.\u00a02996, pp. 547\u2013558. Springer, Heidelberg (2004)"},{"key":"35_CR12","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/s001820050086","volume":"27","author":"I. Milchtaich","year":"1998","unstructured":"Milchtaich, I.: Crowding games are sequentially solvable. International Journal of Game Theory\u00a027, 501\u2013509 (1998)","journal-title":"International Journal of Game Theory"},{"key":"35_CR13","doi-asserted-by":"crossref","unstructured":"Paes Leme, R., Syrgkanis, V., Tardos, \u00c9.: The Curse of Simultaneity. In: Proceedings 3rd ITCS, pp. 60\u201367. ACM (2012)","DOI":"10.1145\/2090236.2090242"},{"key":"35_CR14","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"},{"key":"35_CR15","unstructured":"Roughgarden, T.: Selfish routing with atomic players. In: Proceedings 16th SODA, pp. 1184\u20131185 (2005)"},{"key":"35_CR16","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/BF01737566","volume":"2","author":"R. Selten","year":"1973","unstructured":"Selten, R.: A simple model of imperfect competition, where 4 are few and 6 are many. International Journal of Game Theory\u00a02, 141\u2013201 (1973)","journal-title":"International Journal of Game Theory"}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-13129-0_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T21:05:58Z","timestamp":1559077558000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-13129-0_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319131283","9783319131290"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-13129-0_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}