{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:28:09Z","timestamp":1742916489622,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030174019"},{"type":"electronic","value":"9783030174026"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-17402-6_29","type":"book-chapter","created":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T13:37:00Z","timestamp":1558359420000},"page":"352-364","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Independent Lazy Better-Response Dynamics on Network Games"],"prefix":"10.1007","author":[{"given":"Paolo","family":"Penna","sequence":"first","affiliation":[]},{"given":"Laurent","family":"Viennot","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,6]]},"reference":[{"issue":"2","key":"29_CR1","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1016\/j.geb.2009.08.004","volume":"68","author":"C Al\u00f3s-Ferrer","year":"2010","unstructured":"Al\u00f3s-Ferrer, C., Netzer, N.: The logit-response dynamics. Games Econ. Behav. 68(2), 413\u2013427 (2010)","journal-title":"Games Econ. Behav."},{"issue":"1","key":"29_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s40505-016-0104-1","volume":"5","author":"C Al\u00f3s-Ferrer","year":"2017","unstructured":"Al\u00f3s-Ferrer, C., Netzer, N.: On the convergence of logit-response to (strict) nash equilibria. Econ. Theory Bull. 5(1), 1\u20138 (2017)","journal-title":"Econ. Theory Bull."},{"issue":"3","key":"29_CR3","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/s00453-014-9959-4","volume":"73","author":"V Auletta","year":"2015","unstructured":"Auletta, V., Ferraioli, D., Pasquale, F., Penna, P., Persiano, G.: Logit dynamics with concurrent updates for local interaction potential games. Algorithmica 73(3), 511\u2013546 (2015)","journal-title":"Algorithmica"},{"key":"29_CR4","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/j.jet.2016.03.010","volume":"163","author":"Y Babichenko","year":"2016","unstructured":"Babichenko, Y., Tamuz, O.: Graphical potential games. J. Econ. Theory 163, 889\u2013899 (2016)","journal-title":"J. Econ. Theory"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Bailey, J.P., Piliouras, G.: Multiplicative weights update in zero-sum games. In: ACM Conference on Economics and Computation (EC), pp. 321\u2013338 (2018)","DOI":"10.1145\/3219166.3219235"},{"issue":"3","key":"29_CR6","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1006\/game.1993.1023","volume":"5","author":"LE Blume","year":"1993","unstructured":"Blume, L.E.: The statistical mechanics of strategic interaction. Games Econ. Behav. 5(3), 387\u2013424 (1993)","journal-title":"Games Econ. Behav."},{"key":"29_CR7","volume-title":"Population Games","author":"LE Blume","year":"1998","unstructured":"Blume, L.E.: Population Games. Addison-Wesley, Boston (1998)"},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"Cai, Y., Daskalakis, C.: On minmax theorems for multiplayer games. In: Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 217\u2013234 (2011)","DOI":"10.1137\/1.9781611973082.20"},{"issue":"2","key":"29_CR9","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.geb.2009.05.004","volume":"71","author":"S Chien","year":"2011","unstructured":"Chien, S., Sinclair, A.: Convergence to approximate nash equilibria in congestion games. Games Econ. Behav. 71(2), 315\u2013327 (2011)","journal-title":"Games Econ. Behav."},{"key":"29_CR10","unstructured":"Coucheney, P., Durand, S., Gaujal, B., Touati, C.: General revision protocols in best response algorithms for potential games. In: Netwok Games, Control and OPtimization (NetGCoop) (2014)"},{"key":"29_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/978-3-642-02930-1_35","volume-title":"Automata, Languages and Programming","author":"C Daskalakis","year":"2009","unstructured":"Daskalakis, C., Papadimitriou, C.H.: On a network generalization of the minmax theorem. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5556, pp. 423\u2013434. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02930-1_35"},{"key":"29_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-642-22006-7_14","volume-title":"Automata, Languages and Programming","author":"M Dyer","year":"2011","unstructured":"Dyer, M., Mohanaraj, V.: Pairwise-interaction games. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011. LNCS, vol. 6755, pp. 159\u2013170. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22006-7_14"},{"key":"29_CR13","volume-title":"Networks, Crowds, and Markets","author":"D Easley","year":"2012","unstructured":"Easley, D., Kleinberg, J.: Networks, Crowds, and Markets. Cambridge University Press, Cambridge (2012)"},{"issue":"5","key":"29_CR14","doi-asserted-by":"publisher","first-page":"1047","DOI":"10.2307\/2951493","volume":"61","author":"G Ellison","year":"1993","unstructured":"Ellison, G.: Learning, local interaction, and coordination. Econometrica 61(5), 1047\u20131071 (1993)","journal-title":"Econometrica"},{"key":"29_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/978-3-642-32589-2_33","volume-title":"Mathematical Foundations of Computer Science 2012","author":"A Fanelli","year":"2012","unstructured":"Fanelli, A., Moscardelli, L., Skopalik, A.: On the impact of fair best response dynamics. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol. 7464, pp. 360\u2013371. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32589-2_33"},{"key":"29_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/11682462_43","volume-title":"LATIN 2006: Theoretical Informatics","author":"N Fat\u00e8s","year":"2006","unstructured":"Fat\u00e8s, N., Regnault, D., Schabanel, N., Thierry, \u00c9.: Asynchronous behavior of double-quiescent elementary cellular automata. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol. 3887, pp. 455\u2013466. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11682462_43"},{"key":"29_CR17","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.tcs.2016.08.011","volume":"648","author":"D Ferraioli","year":"2016","unstructured":"Ferraioli, D., Goldberg, P.W., Ventre, C.: Decentralized dynamics for finite opinion games. Theor. Comput. Sci. 648, 96\u2013115 (2016)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"29_CR18","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/s00224-014-9597-x","volume":"57","author":"D Ferraioli","year":"2015","unstructured":"Ferraioli, D., Penna, P.: Imperfect best-response mechanisms. Theory Comput. Syst. 57(3), 681\u2013710 (2015)","journal-title":"Theory Comput. Syst."},{"issue":"1","key":"29_CR19","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/s00224-009-9198-2","volume":"47","author":"D Fotakis","year":"2010","unstructured":"Fotakis, D., Kaporis, A.C., Spirakis, P.G.: Atomic congestion games: fast, myopic and concurrent. Theory Comput. Syst. 47(1), 38\u201359 (2010)","journal-title":"Theory Comput. Syst."},{"key":"29_CR20","unstructured":"Kearns, M., Littman, M.L., Singh, S.: Graphical models for game theory. In: Conference on Uncertainty in Artificial Intelligence (UAI), pp. 253\u2013260 (2001)"},{"issue":"Suppl. 3","key":"29_CR21","doi-asserted-by":"publisher","first-page":"10881","DOI":"10.1073\/pnas.1400842111","volume":"111","author":"GE Kreindler","year":"2014","unstructured":"Kreindler, G.E., Young, H.P.: Rapid innovation diffusion in social networks. Proc. Natl. Acad. Sci. 111(Suppl. 3), 10881\u201310888 (2014)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"29_CR22","volume-title":"Markov Chains and Mixing Times","author":"DA Levin","year":"2009","unstructured":"Levin, D.A., Peres, Y., Wilmer, E.L.: Markov Chains and Mixing Times. American Mathematical Society, Providence (2009)"},{"key":"29_CR23","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-540-48115-7_2","volume-title":"Lectures on Probability Theory and Statistics","author":"F Martinelli","year":"1999","unstructured":"Martinelli, F.: Lectures on Glauber dynamics for discrete spin models. In: Bernard, P. (ed.) Lectures on Probability Theory and Statistics. LNM, vol. 1717, pp. 93\u2013191. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-540-48115-7_2"},{"issue":"1","key":"29_CR24","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.or 14(1), 124\u2013143 (1996)","journal-title":"Games Econ. Behav.or"},{"issue":"47","key":"29_CR25","doi-asserted-by":"publisher","first-page":"20196","DOI":"10.1073\/pnas.1004098107","volume":"107","author":"A Montanari","year":"2010","unstructured":"Montanari, A., Saberi, A.: The spread of innovations in social networks. Proc. Natl. Acad. Sci. 107(47), 20196\u201320201 (2010)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"3","key":"29_CR26","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1007\/s00182-017-0601-y","volume":"47","author":"P Penna","year":"2018","unstructured":"Penna, P.: The price of anarchy and stability in general noisy best-response dynamics. Int. J. Game Theory 47(3), 839\u2013855 (2018)","journal-title":"Int. J. Game Theory"},{"key":"29_CR27","unstructured":"Penna, P., Viennot, L.: Independent lazy better-response dynamics on network games. CoRR, abs\/1609.08953 (2016)"},{"key":"29_CR28","doi-asserted-by":"crossref","unstructured":"Piliouras, G., Shamma, J.S.: Optimization despite chaos: convex relaxations to complex limit sets via poincar\u00e9 recurrence. In: Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 861\u2013873 (2014)","DOI":"10.1137\/1.9781611973402.64"},{"issue":"30","key":"29_CR29","doi-asserted-by":"publisher","first-page":"3947","DOI":"10.1016\/j.tcs.2011.02.028","volume":"412","author":"J Rouquier","year":"2011","unstructured":"Rouquier, J., Regnault, D., Thierry, E.: Stochastic minority on graphs. Theor. Comput. Sci. 412(30), 3947\u20133963 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"29_CR30","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1137\/0220004","volume":"20","author":"AA Sch\u00e4ffer","year":"1991","unstructured":"Sch\u00e4ffer, A.A., Yannakakis, M.: Simple local search problems that are hard to solve. SIAM J. Comput. 20(1), 56\u201387 (1991)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-17402-6_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T12:57:36Z","timestamp":1710334656000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-17402-6_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030174019","9783030174026"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-17402-6_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"6 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/easyconferences.eu\/ciac2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"95","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"14","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}