{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T14:44:59Z","timestamp":1749825899867,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"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_27","type":"book-chapter","created":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T13:37:00Z","timestamp":1558359420000},"page":"323-338","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On the Necessary Memory to Compute the Plurality in Multi-agent Systems"],"prefix":"10.1007","author":[{"given":"Emanuele","family":"Natale","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Iliad","family":"Ramezani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,6]]},"reference":[{"issue":"4","key":"27_CR1","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s00446-005-0138-3","volume":"18","author":"D Angluin","year":"2006","unstructured":"Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. Distrib. Comput. 18(4), 235\u2013253 (2006)","journal-title":"Distrib. Comput."},{"issue":"4","key":"27_CR2","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s00446-007-0040-2","volume":"20","author":"D Angluin","year":"2007","unstructured":"Angluin, D., Aspnes, J., Eisenstat, D., Ruppert, E.: The computational power of population protocols. Distrib. Comput. 20(4), 279\u2013304 (2007)","journal-title":"Distrib. Comput."},{"key":"27_CR3","unstructured":"Aspnes, J., Beauquier, J., Burman, J., Sohier, D.: Time and Space optimal counting in population protocols. In: 20th International Conference on Principles of Distributed Systems (OPODIS 2016), Leibniz International Proceedings in Informatics (LIPIcs), vol. 70, pp. 13:1\u201313:17. Dagstuhl, Germany (2017)"},{"key":"27_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1007\/978-3-662-48653-5_42","volume-title":"Distributed Computing","author":"J Beauquier","year":"2015","unstructured":"Beauquier, J., Burman, J., Clavi\u00e8re, S., Sohier, D.: Space-optimal counting in population protocols. In: Moses, Y. (ed.) DISC 2015. LNCS, vol. 9363, pp. 631\u2013646. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48653-5_42"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Becchetti, L., Clementi, A.E.F., 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 2015, pp. 371\u2013390 (2015)","DOI":"10.1137\/1.9781611973730.27"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"Becchetti, L., Clementi, A.E.F., Natale, E., Pasquale, F., Trevisan, L.: Stabilizing consensus with many opinions. In: Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, pp. 620\u2013635 (2016)","DOI":"10.1137\/1.9781611974331.ch46"},{"key":"27_CR7","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1016\/j.adhoc.2012.05.001","volume":"12","author":"O Ben-Shahar","year":"2014","unstructured":"Ben-Shahar, O., Dolev, S., Dolgin, A., Segal, M.: Direction election in flocking swarms. Ad Hoc Netw. 12, 250\u2013258 (2014)","journal-title":"Ad Hoc Netw."},{"issue":"4","key":"27_CR8","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1109\/JSTSP.2011.2114326","volume":"5","author":"F Benezit","year":"2011","unstructured":"Benezit, F., Thiran, P., Vetterli, M.: The distributed multiple voting problem. IEEE J. Sel. Top. Signal Process. 5(4), 791\u2013804 (2011)","journal-title":"IEEE J. Sel. Top. Signal Process."},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"B\u00e9n\u00e9zit, F., Thiran, P., Vetterli, M.: Interval consensus: from quantized gossip to voting. In: Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2009, pp. 3661\u20133664 (2009)","DOI":"10.1109\/ICASSP.2009.4960420"},{"issue":"SI","key":"27_CR10","first-page":"2508","volume":"14","author":"S Boyd","year":"2006","unstructured":"Boyd, S., Ghosh, A., Prabhakar, B., Shah, D.: Randomized gossip algorithms. IEEE\/ACM Trans. Netw. 14(SI), 2508\u20132530 (2006)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"7025","key":"27_CR11","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1038\/nature03236","volume":"433","author":"ID Couzin","year":"2005","unstructured":"Couzin, I.D., Krause, J., Franks, N.R., Levin, S.A.: Effective leadership and decision-making in animal groups on the move. Nature 433(7025), 513\u2013516 (2005)","journal-title":"Nature"},{"key":"27_CR12","doi-asserted-by":"publisher","DOI":"10.1090\/mbk\/058","volume-title":"Markov Chains and Mixing Times","author":"DA Levin","year":"2008","unstructured":"Levin, D.A., Peres, Y.: Markov Chains and Mixing Times, 1st edn. American Mathematical Society, Providence (2008)","edition":"1"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"Doty, D.: Timing in chemical reaction networks. In: Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, pp. 772\u2013784 (2014)","DOI":"10.1137\/1.9781611973402.57"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Els\u00e4sser, R., Friedetzky, T., Kaaser, D., Mallmann-Trenn, F., Trinker, H.: Brief announcement: rapid asynchronous plurality consensus. In: Proceedings of the ACM Symposium on Principles of Distributed Computing, PODC 2017, pp. 363\u2013365. ACM, New York (2017)","DOI":"10.1145\/3087801.3087860"},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"Ghaffari, M., Lengler, J.: Tight analysis for the 3-majority consensus dynamics. CoRR, abs\/1705.05583 (2017)","DOI":"10.1145\/3212734.3212738"},{"key":"27_CR16","doi-asserted-by":"crossref","unstructured":"Ghaffari, M., Parter, M.: A polylogarithmic gossip algorithm for plurality consensus. In: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, PODC 2016, pp. 117\u2013126 (2016)","DOI":"10.1145\/2933057.2933097"},{"key":"27_CR17","unstructured":"G\u0105sieniec, L., Hamilton, D., Martin, R., Spirakis, P.G., Stachowiak, G.: Deterministic population protocols for exact majority and plurality. In: LIPIcs-Leibniz International Proceedings in Informatics, vol. 70 (2016)"},{"key":"27_CR18","unstructured":"Gmyr, R., Hinnenthal, K., Kostitsyna, I., Kuhn, F., Rudolph, D., Scheideler, C.: Shape recognition by a finite automaton robot. In: 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018), Leibniz International Proceedings in Informatics (LIPIcs), vol. 117, pp. 52:1\u201352:15, Dagstuhl, Germany (2018)"},{"issue":"3","key":"27_CR19","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1016\/j.ic.2010.11.013","volume":"209","author":"M Holzer","year":"2011","unstructured":"Holzer, M., Kutrib, M.: Descriptional and computational complexity of finite automata-a survey. Inf. Comput. 209(3), 456\u2013470 (2011)","journal-title":"Inf. Comput."},{"issue":"80","key":"27_CR20","doi-asserted-by":"publisher","first-page":"20120864","DOI":"10.1098\/rsif.2012.0864","volume":"10","author":"Q Ma","year":"2012","unstructured":"Ma, Q., Johansson, A., Tero, A., Nakagaki, T., Sumpter, D.J.T.: Current-reinforced random walks for constructing transport networks. J. R. Soc. Interface 10(80), 20120864 (2012)","journal-title":"J. R. Soc. Interface"},{"issue":"1","key":"27_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00446-016-0277-8","volume":"30","author":"GB Mertzios","year":"2017","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. Distrib. Comput. 30(1), 1\u201316 (2017)","journal-title":"Distrib. Comput."},{"key":"27_CR22","doi-asserted-by":"crossref","unstructured":"Pitoni, V.: Memory management with explicit time in resource-bounded agents. In: Proceedings of the 32nd AAAI Conference on Artificial Intelligence, New Orleans, Louisiana, USA, 2\u20137 February 2018","DOI":"10.1609\/aaai.v32i1.12136"},{"key":"27_CR23","doi-asserted-by":"crossref","unstructured":"Ranjbar-Sahraei, B., Ammar, H.B., Bloembergen, D., Tuyls, K., Weiss, G.: Theory of cooperation in complex social networks. In: Proceedings of the 28th AAAI Conference on Artificial Intelligence, AAAI 2014, pp. 1471\u20131477. AAAI Press, Qu\u00e9bec City (2014)","DOI":"10.1609\/aaai.v28i1.8890"},{"issue":"4","key":"27_CR24","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1109\/TSIPN.2015.2477777","volume":"1","author":"S Salehkaleybar","year":"2015","unstructured":"Salehkaleybar, S., Sharif-Nassab, A., Golestani, S.J.: Distributed voting\/ranking with optimal number of states per node. IEEE Trans. Signal Inf. Process. Netw. 1(4), 259\u2013267 (2015)","journal-title":"IEEE Trans. Signal Inf. Process. Netw."},{"key":"27_CR25","doi-asserted-by":"publisher","DOI":"10.1002\/0470072644","volume-title":"Design and Analysis of Distributed Algorithms","author":"N Santoro","year":"2006","unstructured":"Santoro, N.: Design and Analysis of Distributed Algorithms, 1st edn. Wiley, Hoboken (2006)","edition":"1"},{"issue":"22","key":"27_CR26","doi-asserted-by":"publisher","first-page":"1773","DOI":"10.1016\/j.cub.2008.09.064","volume":"18","author":"DJT Sumpter","year":"2008","unstructured":"Sumpter, D.J.T., Krause, J., James, R., Couzin, I.D., Ward, A.J.W.: Consensus decision making by fish. Curr. Biol. 18(22), 1773\u20131777 (2008)","journal-title":"Curr. Biol."},{"key":"27_CR27","volume-title":"Chemical Reaction Networks: A Graph-Theoretical Approach","author":"ON Temkin","year":"1996","unstructured":"Temkin, O.N., Zeigarnik, A.V., Bonchev, D.G.: Chemical Reaction Networks: A Graph-Theoretical Approach, 1st edn. CRC Press, Boca Raton (1996)","edition":"1"}],"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_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T12:57:31Z","timestamp":1710334651000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-17402-6_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030174019","9783030174026"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-17402-6_27","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)"}}]}}