{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,26]],"date-time":"2026-07-26T04:09:18Z","timestamp":1785038958784,"version":"3.55.0"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319666990","type":"print"},{"value":"9783319667003","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-66700-3_15","type":"book-chapter","created":{"date-parts":[[2017,8,18]],"date-time":"2017-08-18T12:38:47Z","timestamp":1503059927000},"page":"186-198","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["The Efficiency of Best-Response Dynamics"],"prefix":"10.1007","author":[{"given":"Michal","family":"Feldman","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuval","family":"Snappir","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tami","family":"Tamir","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,8,19]]},"reference":[{"issue":"17","key":"15_CR1","doi-asserted-by":"publisher","first-page":"1552","DOI":"10.1016\/j.tcs.2008.12.035","volume":"410","author":"H Ackermann","year":"2009","unstructured":"Ackermann, H., R\u00f6glin, H., V\u00f6cking, B.: Pure Nash equilibria in player-specific and weighted congestion games. Theor. Comput. Sci. 410(17), 1552\u20131563 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Alon, N., Demaine, E.D., Hajiaghayi, M., Leighton, T.: Basic network creation games. In: Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures, pp. 106\u2013113 (2010)","DOI":"10.1145\/1810479.1810502"},{"issue":"4","key":"15_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. 38(4), 1602\u20131623 (2008)","journal-title":"SIAM J. Comput."},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.ic.2016.08.004","volume":"251","author":"G Avni","year":"2016","unstructured":"Avni, G., Kupferman, O., Tamir, T.: Network-formation games with regular objectives. J. Inf. Comput. 251, 165\u2013178 (2016)","journal-title":"J. Inf. Comput."},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.tcs.2016.07.012","volume":"646","author":"G Avni","year":"2016","unstructured":"Avni, G., Tamir, T.: Cost-sharing scheduling games on restricted unrelated machines. Theor. Comput. Sci. 646, 26\u201339 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-642-24829-0_7","volume-title":"Algorithmic Game Theory","author":"N Berger","year":"2011","unstructured":"Berger, N., Feldman, M., Neiman, O., Rosenthal, M.: Dynamic inefficiency: anarchy without stability. In: Persiano, G. (ed.) SAGT 2011. LNCS, vol. 6982, pp. 57\u201368. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-24829-0_7"},{"issue":"2","key":"15_CR7","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s10951-011-0247-8","volume":"15","author":"B Chen","year":"2011","unstructured":"Chen, B., G\u00fcrel, S.: Efficiency analysis of load balancing games with and without activation costs. J. Sched. 15(2), 157\u2013164 (2011)","journal-title":"J. Sched."},{"issue":"2","key":"15_CR8","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/s00224-008-9128-8","volume":"45","author":"H Chen","year":"2009","unstructured":"Chen, H., Roughgarden, T.: Network design with weighted players. Theory Comput. Syst. 45(2), 302\u2013324 (2009)","journal-title":"Theory Comput. Syst."},{"key":"15_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-662-53354-3_4","volume-title":"Algorithmic Game Theory","author":"S Durand","year":"2016","unstructured":"Durand, S., Gaujal, B.: Complexity and optimality of the best response algorithm in random potential games. In: Gairing, M., Savani, R. (eds.) SAGT 2016. LNCS, vol. 9928, pp. 40\u201351. Springer, Heidelberg (2016). doi:10.1007\/978-3-662-53354-3_4"},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/3-540-45061-0_41","volume-title":"Automata, Languages and Programming","author":"E Even-Dar","year":"2003","unstructured":"Even-Dar, E., Kesselman, A., Mansour, Y.: Convergence time to Nash equilibria. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 502\u2013513. Springer, Heidelberg (2003). doi:10.1007\/3-540-45061-0_41"},{"key":"15_CR11","unstructured":"Even-Dar, E., Mansour, Y.: Fast convergence of selfish rerouting. In: Proceedings of SODA, pp. 772\u2013781 (2005)"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Luthra, A., Maneva, E., Papadimitriou, C., Shenker, S.: On a network creation game. In: Proceedings of PODC, pp. 347\u2013351 (2003)","DOI":"10.1145\/872035.872088"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Papadimitriou, C., Talwar, K.: The complexity of pure Nash equilibria. In: Proceedings of STOC, pp. 604\u2013612 (2004)","DOI":"10.1145\/1007352.1007445"},{"issue":"3","key":"15_CR14","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1287\/opre.1120.1051","volume":"60","author":"M Feldman","year":"2012","unstructured":"Feldman, M., Tamir, T.: Conflicting congestion effects in resource allocation games. J. Oper. Res. 60(3), 529\u2013540 (2012)","journal-title":"J. Oper. Res."},{"issue":"2","key":"15_CR15","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1016\/j.ipl.2014.07.012","volume":"115","author":"M Feldman","year":"2015","unstructured":"Feldman, M., Tamir, T.: Convergence of best-response dynamics in games with conflicting congestion effects. Inf. Process. Lett. 115(2), 112\u2013118 (2015)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"15_CR16","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s00224-009-9205-7","volume":"47","author":"D Fotakis","year":"2010","unstructured":"Fotakis, D.: Congestion games with linearly independent paths: convergence time and price of anarchy. Theory Comput. Syst. 47(1), 113\u2013136 (2010)","journal-title":"Theory Comput. Syst."},{"issue":"3","key":"15_CR17","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1287\/moor.1120.0543","volume":"37","author":"T Harks","year":"2012","unstructured":"Harks, T., Klimm, M.: On the existence of pure Nash equilibria in weighted congestion games. Math. Oper. Res. 37(3), 419\u2013436 (2012)","journal-title":"Math. Oper. Res."},{"key":"15_CR18","unstructured":"Ieong, S., Mcgrew, R., Nudelman, E., Shoham, Y., Sun, Q., Fast, C.: A simple class of congestion games. In: Proceedinhgs of AAAI, pp. 489\u2013494 (2005)"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"Kawald, B., Lenzner, P.: On dynamics in selfish network creation. In: Proceedings of SPAA, pp. 83\u201392 (2013)","DOI":"10.1145\/2486159.2486185"},{"issue":"2","key":"15_CR20","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.cosrev.2009.04.003","volume":"3","author":"E Koutsoupias","year":"1999","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. Comput. Sci. Rev. 3(2), 65\u201369 (1999)","journal-title":"Comput. Sci. Rev."},{"key":"15_CR21","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 Econ. Behav. 13, 111\u2013124 (1996)","journal-title":"Games Econ. Behav."},{"key":"15_CR22","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 Econ. Behav. 14, 124\u2013143 (1996)","journal-title":"Games Econ. Behav."},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H.: Algorithms, games, and the internet. In: Proceedings of 33rd STOC, pp. 749\u2013753 (2001)","DOI":"10.1145\/380752.380883"},{"key":"15_CR24","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"RW Rosenthal","year":"1973","unstructured":"Rosenthal, R.W.: A class of games possessing pure-strategy Nash equilibria. Int. J. Game Theory 2, 65\u201367 (1973)","journal-title":"Int. J. Game Theory"},{"key":"15_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/978-3-642-17572-5_30","volume-title":"Internet and Network Economics","author":"V Syrgkanis","year":"2010","unstructured":"Syrgkanis, V.: The complexity of equilibria in cost sharing games. In: Saberi, A. (ed.) WINE 2010. LNCS, vol. 6484, pp. 366\u2013377. Springer, Heidelberg (2010). doi:10.1007\/978-3-642-17572-5_30"},{"key":"15_CR26","doi-asserted-by":"crossref","unstructured":"V\u00f6cking, B.: Selfish load balancing (Chap. 20). In: Algorithmic Game Theory. Cambridge University Press, Cambridge (2007)","DOI":"10.1017\/CBO9780511800481.022"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-66700-3_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T16:26:49Z","timestamp":1709828809000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-66700-3_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319666990","9783319667003"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-66700-3_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"19 August 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Game Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"L'Aquila","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 September 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cs.gssi.infn.it\/sagt2017","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}