{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,22]],"date-time":"2026-06-22T14:00:45Z","timestamp":1782136845637,"version":"3.54.5"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,4,12]],"date-time":"2021-04-12T00:00:00Z","timestamp":1618185600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,4,12]],"date-time":"2021-04-12T00:00:00Z","timestamp":1618185600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2021,6]]},"DOI":"10.1007\/s00446-021-00392-9","type":"journal-article","created":{"date-parts":[[2021,4,12]],"date-time":"2021-04-12T08:03:51Z","timestamp":1618214631000},"page":"195-206","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["MinMax algorithms for stabilizing consensus"],"prefix":"10.1007","volume":"34","author":[{"given":"Bernadette","family":"Charron-Bost","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3222-3308","authenticated-orcid":false,"given":"Shlomo","family":"Moran","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,4,12]]},"reference":[{"key":"392_CR1","doi-asserted-by":"crossref","unstructured":"Afek, Y., Gafni, E.: Asynchrony from synchrony. In: International Conference on Distributed Computing and Networking, pp. 225\u2013239. Springer, Berlin (2013)","DOI":"10.1007\/978-3-642-35668-1_16"},{"issue":"4","key":"392_CR2","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0020-0190(85)90056-0","volume":"21","author":"B Alpern","year":"1985","unstructured":"Alpern, B., Schneider, F.B.: Defining liveness. Inf. Process. Lett. 21(4), 181\u2013185 (1985)","journal-title":"Inf. Process. Lett."},{"key":"392_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/11776178_3","volume-title":"Distributed Computing in Sensor Systems","author":"D Angluin","year":"2006","unstructured":"Angluin, D., Fischer, M.J., Jiang, H.: Stabilizing consensus in mobile networks. In: Gibbons, P.B., Abdelzaher, T., Aspnes, J., Rao, R. (eds.) Distributed Computing in Sensor Systems. Lecture Notes in Computer Science, vol. 4026, pp. 37\u201350. Springer, Berlin (2006)"},{"key":"392_CR4","doi-asserted-by":"crossref","unstructured":"Becchetti, L., Clementi, A., Natale, E., Pasquale, F., Trevisan, L.: Stabilizing consensus with many opinions. In: Proceedings of the Twenty-seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA \u201916, pp. 620\u2013635, Philadelphia, PA, USA. Society for Industrial and Applied Mathematics (2016)","DOI":"10.1137\/1.9781611974331.ch46"},{"key":"392_CR5","volume-title":"Parallel and Distributed Computation: Numerical Methods","author":"DP Bertsekas","year":"1989","unstructured":"Bertsekas, D.P., Tsitsiklis, J.N.: Parallel and Distributed Computation: Numerical Methods. Athena Scientific, Belmont (1989)"},{"key":"392_CR6","unstructured":"Blondel, V.D., Hendrickx, J.M., Olshevsky, A., Tsitsiklis, J.N.: Convergence in multiagent coordination, consensus, and flocking. In: Proceedings of the 44th IEEE Conference on Decision and Control, and the European Control Conference (CDC-ECC), pp. 2996\u20133000. IEEE, New York, NY (2005)"},{"issue":"2","key":"392_CR7","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1137\/060657005","volume":"47","author":"M Cao","year":"2008","unstructured":"Cao, M., Stephen, M.A., Anderson, B.D.O.: Reaching a consensus in a dynamically changing environment: a graphical approach. SIAM J. Control Optim. 47(2), 575\u2013600 (2008)","journal-title":"SIAM J. Control Optim."},{"issue":"5","key":"392_CR8","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1080\/17445760.2012.668546","volume":"27","author":"A Casteigts","year":"2012","unstructured":"Casteigts, A., Flocchini, P., Quattrociocchi, W., Santoro, N.: Time-varying graphs and dynamic networks. Int. J. Parallel Emerg. Distrib. Syst. 27(5), 387\u2013408 (2012)","journal-title":"Int. J. Parallel Emerg. Distrib. Syst."},{"key":"392_CR9","doi-asserted-by":"crossref","unstructured":"Charron-Bost, B., F\u00fcgger, M., Nowak, T.: Approximate consensus in highly dynamic networks: the role of averaging algorithms. In: Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming, ICALP15, pp. 528\u2013539 (2015)","DOI":"10.1007\/978-3-662-47666-6_42"},{"key":"392_CR10","unstructured":"Charron-Bost, B., Moran, S.: The firing squad problem revisited. In: Rolf, N., Brigitte, V. (eds), 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018), Volume 96 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 20:1\u201320:14 (2018)"},{"issue":"1","key":"392_CR11","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s00446-009-0084-6","volume":"22","author":"B Charron-Bost","year":"2009","unstructured":"Charron-Bost, B., Schiper, A.: The Head-Of model: computing in distributed systems with benign faults. Distrib. Comput. 22(1), 49\u201371 (2009)","journal-title":"Distrib. Comput."},{"key":"392_CR12","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.tcs.2015.01.024","volume":"584","author":"\u00c9 Coulouma","year":"2015","unstructured":"Coulouma, \u00c9., Godard, E., Peters, J.: A characterization of oblivious message adversaries for which consensus is solvable. Theor. Comput. Sci. 584, 80\u201390 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"392_CR13","doi-asserted-by":"crossref","unstructured":"Doerr, B., Goldberg, L.A., Minder, L., Sauerwald, T., Scheideler, C.: Stabilizing consensus with the power of two choices. In: Proceedings of the Twenty-third Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA \u201911, pp. 149\u2013158, New York, NY, USA (2011)","DOI":"10.1145\/1989493.1989516"},{"issue":"6","key":"392_CR14","doi-asserted-by":"publisher","first-page":"988","DOI":"10.1109\/TAC.2003.812781","volume":"48","author":"A Jadbabaie","year":"2003","unstructured":"Jadbabaie, A., Lin, J., Stephen, M.A.: Coordination of groups of mobile autonomous stability agents using nearest neighbor rules. IEEE Trans. Autom. Control 48(6), 988\u20131001 (2003)","journal-title":"IEEE Trans. Autom. Control"},{"key":"392_CR15","doi-asserted-by":"crossref","unstructured":"Lorenz, D.A., Lorenz, J.: Convergence to consensus by general averaging. In: Bru, R., Romero-Viv\u00f3, S. (eds.) Positive Systems, Volume 389 of Lecture Notes in Control and Information Sciences, pp. 91\u201399. Springer, Berlin (2009)","DOI":"10.1007\/978-3-642-02894-6_9"},{"issue":"4","key":"392_CR16","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/BF02242738","volume":"8","author":"R Lubitch","year":"1995","unstructured":"Lubitch, R., Moran, S.: Closed schedulers: a novel technique for analyzing asynchronous protocols. Distrib. Comput. 8(4), 203\u2013210 (1995)","journal-title":"Distrib. Comput."},{"key":"392_CR17","volume-title":"Distributed Algorithms","author":"NA Lynch","year":"1996","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann, San Francisco (1996)"},{"key":"392_CR18","unstructured":"Moran, S.: Averaging and rounding cannot achieve stabilizing consensus in rooted dynamic graphs. Unpublished note (2020). Available at https:\/\/www.dropbox.com\/s\/h08myw1hupruxwg\/AC-not-SC2002.pdf?dl=0"},{"issue":"2","key":"392_CR19","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1109\/TAC.2004.841888","volume":"50","author":"L Moreau","year":"2005","unstructured":"Moreau, L.: Stability of multiagent systems with time-dependent communication links. IEEE Trans. Autom. Control 50(2), 169\u2013182 (2005)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"1","key":"392_CR20","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1109\/JPROC.2006.887293","volume":"95","author":"R Olfati-Saber","year":"2007","unstructured":"Olfati-Saber, R., Fax, J.A., Murray, R.M.: Consensus and cooperation in networked multi-agent systems. Proc. IEEE 95(1), 215\u2013233 (2007)","journal-title":"Proc. IEEE"},{"issue":"4","key":"392_CR21","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1137\/110837462","volume":"53","author":"A Olshevsky","year":"2011","unstructured":"Olshevsky, A., Tsitsiklis, J.N.: Convergence speed in distributed consensus and averaging. SIAM Rev. 53(4), 747\u2013772 (2011)","journal-title":"SIAM Rev."},{"key":"392_CR22","doi-asserted-by":"crossref","unstructured":"Santoro, N., Widmayer, P.: Time is not a healer. In: Proceedings of the 6th Symposium on Theoretical Aspects of Computer Science, pp. 304\u2013313, Paderborn, Germany (1989)","DOI":"10.1007\/BFb0028994"},{"issue":"6","key":"392_CR23","doi-asserted-by":"publisher","first-page":"1226","DOI":"10.1103\/PhysRevLett.75.1226","volume":"75","author":"T Vicsek","year":"1995","unstructured":"Vicsek, T., Czir\u00f3k, A., Ben-Jacob, E., Cohen, I., Shochet, O.: Novel type of phase transition in a system of self-driven particles. Phys. Rev. Lett. 75(6), 1226\u20131229 (1995)","journal-title":"Phys. Rev. Lett."},{"key":"392_CR24","unstructured":"Winkler, K., Schmid, U., Moses, Y.: A characterization of consensus solvability for closed message adversaries. In: 23rd International Conference on Principles of Distributed Systems (OPODIS 2019). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2020)"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-021-00392-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00446-021-00392-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-021-00392-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,19]],"date-time":"2021-06-19T04:21:22Z","timestamp":1624076482000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00446-021-00392-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,12]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["392"],"URL":"https:\/\/doi.org\/10.1007\/s00446-021-00392-9","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4,12]]},"assertion":[{"value":"11 March 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 March 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 April 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaration"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}