{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T06:51:10Z","timestamp":1759042270207,"version":"3.37.3"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,11,22]],"date-time":"2016-11-22T00:00:00Z","timestamp":1479772800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"MIUR COFIN \u201cARS TECHNOMEDIA\u201d","award":["2010N5K7EB"],"award-info":[{"award-number":["2010N5K7EB"]}]},{"name":"EU FET \u201cMULTIPLEX\u201d","award":["317532"],"award-info":[{"award-number":["317532"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2017,8]]},"DOI":"10.1007\/s00446-016-0289-4","type":"journal-article","created":{"date-parts":[[2016,11,22]],"date-time":"2016-11-22T04:55:45Z","timestamp":1479790545000},"page":"293-306","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Simple dynamics for plurality consensus"],"prefix":"10.1007","volume":"30","author":[{"given":"Luca","family":"Becchetti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9521-2457","authenticated-orcid":false,"given":"Andrea","family":"Clementi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emanuele","family":"Natale","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Pasquale","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Riccardo","family":"Silvestri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luca","family":"Trevisan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,11,22]]},"reference":[{"key":"289_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.dam.2014.07.026","volume":"180","author":"MA Abdullah","year":"2015","unstructured":"Abdullah, M.A., Draief, M.: Global majority consensus by local majority polling on graphs of a given degree sequence. Discrete Appl. Math. 180, 1\u201310 (2015)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"289_CR2","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/s00446-008-0059-z","volume":"21","author":"D Angluin","year":"2008","unstructured":"Angluin, D., Aspnes, J., Eisenstat, D.: A simple population protocol for fast robust approximate majority. Distrib. Comput. 21(2), 87\u2013102 (2008). (Preliminary version in DISC\u201907)","journal-title":"Distrib. Comput."},{"doi-asserted-by":"crossref","unstructured":"Babaee, A., Draief, M.: Distributed multivalued consensus. In: Proceedings of Computer and Information Sciences III, pp. 271\u2013279. Springer (2013)","key":"289_CR3","DOI":"10.1007\/978-1-4471-4594-3_28"},{"doi-asserted-by":"crossref","unstructured":"Becchetti, L., Clementi, A., Natale, E., Pasquale, F., Silvestri, R.: Plurality consensus in the gossip model. In: Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201915), pp. 371\u2013390. SIAM (2015)","key":"289_CR4","DOI":"10.1137\/1.9781611973730.27"},{"doi-asserted-by":"crossref","unstructured":"B\u00e9n\u00e9zit, F., Thiran, P., Vetterli, M.: Interval consensus: from quantized gossip to voting. In: Proceedings of IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP\u201909), pp. 3661\u20133664. IEEE (2009)","key":"289_CR5","DOI":"10.1109\/ICASSP.2009.4960420"},{"key":"289_CR6","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.tcs.2014.11.026","volume":"584","author":"A Clementi","year":"2015","unstructured":"Clementi, A., Di Ianni, M., Gambosi, G., Natale, E., Silvestri, R.: Distributed community detection in dynamic graphs. Theor. Comput. Sci. 584, 19\u201341 (2015)","journal-title":"Theor. Comput. Sci."},{"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 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA\u201911), pp. 149\u2013158. ACM (2011)","key":"289_CR7","DOI":"10.1145\/1989493.1989516"},{"issue":"3","key":"289_CR8","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1137\/110823018","volume":"50","author":"M Draief","year":"2012","unstructured":"Draief, M., Vojnovic, M.: Convergence speed of binary interval consensus. SIAM J. Control Optim. 50(3), 1087\u20131109 (2012)","journal-title":"SIAM J. Control Optim."},{"issue":"2","key":"289_CR9","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1002\/(SICI)1098-2418(199809)13:2<99::AID-RSA1>3.0.CO;2-M","volume":"13","author":"D Dubhashi","year":"1998","unstructured":"Dubhashi, D., Ranjan, D.: Balls and bins: a study in negative dependence. Random Struct. Algorithms 13(2), 99\u2013124 (1998)","journal-title":"Random Struct. Algorithms"},{"key":"289_CR10","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511761942","volume-title":"Networks, Crowds, and Markets","author":"D Easley","year":"2010","unstructured":"Easley, D., Kleinberg, J.: Networks, Crowds, and Markets. Cambridge University Press, Cambridge (2010)"},{"key":"289_CR11","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/j.spl.2013.12.009","volume":"86","author":"S Greenberg","year":"2014","unstructured":"Greenberg, S., Mohri, M.: Tight lower bound on the probability of a binomial exceeding its expectation. Stat. Probab. Lett. 86, 91\u201398 (2014)","journal-title":"Stat. Probab. Lett."},{"key":"289_CR12","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1006\/inco.2001.3088","volume":"171","author":"Y Hassin","year":"2001","unstructured":"Hassin, Y., Peleg, D.: Distributed probabilistic polling and applications to proportionate agreement. Inf. Comput. 171, 248\u2013268 (2001)","journal-title":"Inf. Comput."},{"doi-asserted-by":"crossref","unstructured":"Kearns, M., Tan, J.: Biased voting and the democratic primary problem. In: Proceedings of the 4th Workshop on Internet and Network Economics (WINE), pp. 639\u2013652 (2008)","key":"289_CR13","DOI":"10.1007\/978-3-540-92185-1_70"},{"issue":"25","key":"289_CR14","doi-asserted-by":"crossref","first-page":"5148","DOI":"10.1103\/PhysRevLett.74.5148","volume":"74","author":"MWS Land","year":"1995","unstructured":"Land, M.W.S., Belew, R.K.: No two-state ca for density classification exists. Phys. Rev. Lett. 74(25), 5148\u20135150 (1995)","journal-title":"Phys. Rev. Lett."},{"key":"289_CR15","doi-asserted-by":"crossref","DOI":"10.1090\/mbk\/058","volume-title":"Markov Chains and Mixing Times","author":"D Levin","year":"2008","unstructured":"Levin, D., Peres, Y., Wilmer, E.L.: Markov Chains and Mixing Times. AMS, Norwalk (2008)"},{"doi-asserted-by":"crossref","unstructured":"Mertzios, G.B., Nikoletseas, S.E., Raptopoulos, C.L., Spirakis, P.G.: Determining majority in networks with local interactions and very small local memory. In: Internship Colloquium on Automata, Languages, and Programming (ICALP\u201914), pp. 871\u2013882 (2014)","key":"289_CR16","DOI":"10.1007\/978-3-662-43948-7_72"},{"issue":"3","key":"289_CR17","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1007\/s10458-013-9230-4","volume":"28","author":"E Mossel","year":"2014","unstructured":"Mossel, E., Neeman, J., Tamuz, O.: Majority dynamics and aggregation of information in social networks. Auton. Agent. Multi Agent Syst. 28(3), 408\u2013429 (2014)","journal-title":"Auton. Agent. Multi Agent Syst."},{"unstructured":"Mossel, E., Schoenebeck, G.: Reaching consensus on social networks. In: Proceedings of the 2nd Innovations in Computer Science (ICS\u201910), pp. 214\u2013229 (2010)","key":"289_CR18"},{"unstructured":"Mousavi, N.: How tight is chernoff bound? https:\/\/ece.uwaterloo.ca\/~nmousavi\/Papers\/Chernoff-Tightness.pdf","key":"289_CR19"},{"issue":"2","key":"289_CR20","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/S0304-3975(01)00055-X","volume":"282","author":"D Peleg","year":"2002","unstructured":"Peleg, D.: Local majorities, coalitions and monopolies in graphs: a review. Theor. Comput. Sci. 282(2), 231\u2013257 (2002)","journal-title":"Theor. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Perron, E., Vasudevan, D., Vojnovic, M.: Using three states for binary consensus on complete graphs. In: Proceedings of the 28th IEEE INFOCOM, pp. 2527\u20132535 (2009)","key":"289_CR21","DOI":"10.1109\/INFCOM.2009.5062181"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-016-0289-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-016-0289-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-016-0289-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,15]],"date-time":"2019-09-15T17:05:25Z","timestamp":1568567125000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-016-0289-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,22]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,8]]}},"alternative-id":["289"],"URL":"https:\/\/doi.org\/10.1007\/s00446-016-0289-4","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"type":"print","value":"0178-2770"},{"type":"electronic","value":"1432-0452"}],"subject":[],"published":{"date-parts":[[2016,11,22]]}}}