{"year":"2025","department":[{"_id":"MoHe"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"date_updated":"2025-08-05T07:34:27Z","page":"549-552","file_date_updated":"2025-08-05T07:32:01Z","date_created":"2025-07-21T08:17:04Z","corr_author":"1","doi":"10.1145/3732772.3733512","project":[{"_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","call_identifier":"H2020","grant_number":"101019564","name":"The design and evaluation of modern fully dynamic data structures"},{"_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103","grant_number":"I05982","name":"Static and Dynamic Hierarchical Graph Decompositions"},{"grant_number":"P33775","name":"Fast Algorithms for a Reactive Network Layer","_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe"}],"citation":{"mla":"Breitkopf, Tom-Lukas, et al. “Brief Announcement: Minimizing Energy Solves Relative Majority with a Cubic Number of States in Population Protocols.” <i>Proceedings of the ACM Symposium on Principles of Distributed Computing</i>, ACM, 2025, pp. 549–52, doi:<a href=\"https://doi.org/10.1145/3732772.3733512\">10.1145/3732772.3733512</a>.","ieee":"T.-L. Breitkopf, J. Dallot, A. El-Hayek, and S. Schmid, “Brief announcement: Minimizing energy solves relative majority with a cubic number of states in population protocols,” in <i>Proceedings of the ACM Symposium on Principles of Distributed Computing</i>, Huatulco, Mexico, 2025, pp. 549–552.","ama":"Breitkopf T-L, Dallot J, El-Hayek A, Schmid S. Brief announcement: Minimizing energy solves relative majority with a cubic number of states in population protocols. In: <i>Proceedings of the ACM Symposium on Principles of Distributed Computing</i>. ACM; 2025:549-552. doi:<a href=\"https://doi.org/10.1145/3732772.3733512\">10.1145/3732772.3733512</a>","apa":"Breitkopf, T.-L., Dallot, J., El-Hayek, A., &#38; Schmid, S. (2025). Brief announcement: Minimizing energy solves relative majority with a cubic number of states in population protocols. In <i>Proceedings of the ACM Symposium on Principles of Distributed Computing</i> (pp. 549–552). Huatulco, Mexico: ACM. <a href=\"https://doi.org/10.1145/3732772.3733512\">https://doi.org/10.1145/3732772.3733512</a>","short":"T.-L. Breitkopf, J. Dallot, A. El-Hayek, S. Schmid, in:, Proceedings of the ACM Symposium on Principles of Distributed Computing, ACM, 2025, pp. 549–552.","chicago":"Breitkopf, Tom-Lukas, Julien Dallot, Antoine El-Hayek, and Stefan Schmid. “Brief Announcement: Minimizing Energy Solves Relative Majority with a Cubic Number of States in Population Protocols.” In <i>Proceedings of the ACM Symposium on Principles of Distributed Computing</i>, 549–52. ACM, 2025. <a href=\"https://doi.org/10.1145/3732772.3733512\">https://doi.org/10.1145/3732772.3733512</a>.","ista":"Breitkopf T-L, Dallot J, El-Hayek A, Schmid S. 2025. Brief announcement: Minimizing energy solves relative majority with a cubic number of states in population protocols. Proceedings of the ACM Symposium on Principles of Distributed Computing. PODC: Symposium on Principles of Distributed Computing, 549–552."},"type":"conference","date_published":"2025-06-13T00:00:00Z","publication_identifier":{"isbn":["9798400718854"]},"language":[{"iso":"eng"}],"OA_type":"hybrid","OA_place":"publisher","_id":"20052","oa_version":"Published Version","file":[{"creator":"dernst","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_name":"2025_PODC_Breitkopf.pdf","success":1,"date_updated":"2025-08-05T07:32:01Z","file_id":"20123","checksum":"e99679ffb28877b7cea4d54860302790","file_size":549706,"date_created":"2025-08-05T07:32:01Z"}],"title":"Brief announcement: Minimizing energy solves relative majority with a cubic number of states in population protocols","quality_controlled":"1","day":"13","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"end_date":"2025-06-20","start_date":"2025-06-16","name":"PODC: Symposium on Principles of Distributed Computing","location":"Huatulco, Mexico"},"oa":1,"author":[{"first_name":"Tom-Lukas","full_name":"Breitkopf, Tom-Lukas","last_name":"Breitkopf"},{"last_name":"Dallot","full_name":"Dallot, Julien","first_name":"Julien"},{"orcid":"0000-0003-4268-7368","last_name":"El-Hayek","full_name":"El-Hayek, Antoine","id":"888a098e-fcac-11ee-aff7-d347be57b725","first_name":"Antoine"},{"full_name":"Schmid, Stefan","first_name":"Stefan","last_name":"Schmid"}],"publication_status":"published","has_accepted_license":"1","article_processing_charge":"No","abstract":[{"lang":"eng","text":"This paper revisits a fundamental distributed computing problem in the population protocol model. Provided n agents each starting with an input color in [k], the relative majority problem asks to find the predominant color. In the population protocol model, at each time step, a scheduler selects two agents that first learn each other's states and then update their states based on what they learned.\r\nWe present the Circles protocol that solves the relative majority problem with k3 states. It is always-correct under weakly fair scheduling. Not only does it improve upon the best known upper bound of O(k7), but it also shows a strikingly simpler design inspired by energy minimization in chemical settings."}],"month":"06","acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (MoDynStruct, No. 101019564) and the Austrian Science Fund (FWF) grant DOI 10.55776/I5982, and grant DOI 10.55776/P33775 with additional funding from the netidee SCIENCE Stiftung, 2020–2024 and the German Research Foundation (DFG), grant 470029389 (FlexNets). ","publication":"Proceedings of the ACM Symposium on Principles of Distributed Computing","ec_funded":1,"ddc":["000"],"publisher":"ACM"}