{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:15:17Z","timestamp":1759637717545,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642450457"},{"type":"electronic","value":"9783642450464"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-45046-4_6","type":"book-chapter","created":{"date-parts":[[2013,12,9]],"date-time":"2013-12-09T12:53:01Z","timestamp":1386593581000},"page":"54-67","source":"Crossref","is-referenced-by-count":2,"title":["On Lookahead Equilibria in Congestion Games"],"prefix":"10.1007","author":[{"given":"Vittorio","family":"Bil\u00f2","sequence":"first","affiliation":[]},{"given":"Angelo","family":"Fanelli","sequence":"additional","affiliation":[]},{"given":"Luca","family":"Moscardelli","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/11672142_17","volume-title":"STACS 2006","author":"S. Aland","year":"2006","unstructured":"Aland, S., Dumrauf, D., Gairing, M., Monien, B., Schoppmann, F.: Exact Price of Anarchy for Polynomial Congestion Games. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol.\u00a03884, pp. 218\u2013229. Springer, Heidelberg (2006)"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Epstein, A., Mirrokni, V.S., Skopalik, A.: Fast convergence to nearly optimal solutions in potential games. In: EC, pp. 264\u2013273 (2008)","DOI":"10.1145\/1386790.1386832"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-642-15781-3_2","volume-title":"Algorithms \u2013 ESA 2010","author":"K. Bhawalkar","year":"2010","unstructured":"Bhawalkar, K., Gairing, M., Roughgarden, T.: Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness. In: de Berg, M., Meyer, U. (eds.) ESA 2010, Part II. LNCS, vol.\u00a06347, pp. 17\u201328. Springer, Heidelberg (2010)"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-642-38016-7_18","volume-title":"Approximation and Online Algorithms","author":"V. Bil\u00f2","year":"2013","unstructured":"Bil\u00f2, V.: A Unifying Tool for Bounding the Quality of Non-cooperative Solutions in Weighted Congestion Games. In: Erlebach, T., Persiano, G. (eds.) WAOA 2012. LNCS, vol.\u00a07846, pp. 215\u2013228. Springer, Heidelberg (2013)"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Fanelli, A., Gravin, N., Skopalik, A.: Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games. In: FOCS, pp. 532\u2013541 (2011)","DOI":"10.1109\/FOCS.2011.50"},{"key":"6_CR6","unstructured":"Chien, S., Sinclair, A.: Convergence to approximate Nash equilibria in congestion games. In: SODA, pp. 169\u2013178 (2007)"},{"key":"6_CR7","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":"3","key":"6_CR8","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1145\/2229163.2229169","volume":"8","author":"A. Fanelli","year":"2012","unstructured":"Fanelli, A., Flammini, M., Moscardelli, L.: The speed of convergence in congestion games under best-response dynamics. ACM Transactions on Algorithms\u00a08(3), 25 (2012)","journal-title":"ACM Transactions on Algorithms"},{"issue":"5","key":"6_CR9","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s00446-011-0145-5","volume":"24","author":"A. Fanelli","year":"2011","unstructured":"Fanelli, A., Moscardelli, L.: On best response dynamics in weighted congestion games with polynomial delays. Distributed Computing\u00a024(5), 245\u2013254 (2011)","journal-title":"Distributed Computing"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-642-33996-7_22","volume-title":"Algorithmic Game Theory","author":"V. Mirrokni","year":"2012","unstructured":"Mirrokni, V., Thain, N., Vetta, A.: A Theoretical Examination of Practical Game Playing: Lookahead Search. In: Serna, M. (ed.) SAGT 2012. LNCS, vol.\u00a07615, pp. 251\u2013262. Springer, Heidelberg (2012)"},{"issue":"1","key":"6_CR11","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(1), 124\u2013143 (1996)","journal-title":"Games and Economic Behavior"},{"key":"6_CR12","unstructured":"Pearl, J.: Heuristics: Intelligent search strategies for computer problem solving. Addison-Wesley (1984)"},{"key":"6_CR13","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":"314","key":"6_CR14","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1080\/14786445008521796","volume":"41","author":"C. Shannon","year":"1950","unstructured":"Shannon, C.: Programming a computer for playing chess. Philosophical Magazine, 7th Series\u00a041(314), 256\u2013275 (1950)","journal-title":"Philosophical Magazine, 7th Series"}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45046-4_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T06:10:10Z","timestamp":1675231810000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-45046-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642450457","9783642450464"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45046-4_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}