<?xml version="1.0" encoding="UTF-8"?>

<modsCollection xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd">
<mods version="3.3">

<genre>conference paper</genre>

<titleInfo><title>An almost tight lower bound for plurality consensus with undecided state dynamics in the population protocol model</title></titleInfo>


<note type="publicationStatus">published</note>


<note type="qualityControlled">yes</note>

<name type="personal">
  <namePart type="given">Antoine</namePart>
  <namePart type="family">El-Hayek</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">888a098e-fcac-11ee-aff7-d347be57b725</identifier><description xsi:type="identifierDefinition" type="orcid">0000-0003-4268-7368</description></name>
<name type="personal">
  <namePart type="given">Robert</namePart>
  <namePart type="family">Elsässer</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">Stefan</namePart>
  <namePart type="family">Schmid</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>







<name type="corporate">
  <namePart></namePart>
  <identifier type="local">MoHe</identifier>
  <role>
    <roleTerm type="text">department</roleTerm>
  </role>
</name>



<name type="conference">
  <namePart>PODC: Symposium on Principles of Distributed Computing</namePart>
</name>



<name type="corporate">
  <namePart>The design and evaluation of modern fully dynamic data structures</namePart>
  <role><roleTerm type="text">project</roleTerm></role>
</name>
<name type="corporate">
  <namePart>Static and Dynamic Hierarchical Graph Decompositions</namePart>
  <role><roleTerm type="text">project</roleTerm></role>
</name>
<name type="corporate">
  <namePart>Fast Algorithms for a Reactive Network Layer</namePart>
  <role><roleTerm type="text">project</roleTerm></role>
</name>



<abstract lang="eng">We revisit the majority problem in the population protocol communication model, as first studied by Angluin et al. (Distributed Computing 2008). We consider a more general version of this problem known as plurality consensus, which has already been studied intensively in the literature. In this problem, each node in a system of n nodes, has initially one of k different opinions, and they need to agree on the (relative) majority opinion. In particular, we consider the important and intensively studied model of Undecided State Dynamics.
Our main contribution is an almost tight lower bound on the stabilization time: we prove that there exists an initial configuration, even with bias \Delta = \omega(\sqrt{n\log n}), where stabilization requires \Omega(kn\log \frac {\sqrt n} {k \log n}) interactions, or equivalently, \Omega(k\log \frac {\sqrt n} {k \log n}) parallel time for any k = o\left(\frac {\sqrt n}{\log n}\right). This bound is tight for any k \le n^{\frac 1 2 - \epsilon}, where \epsilon &gt;0 can be any small constant, as Amir et al.~(PODC&apos;23) gave a O(k\log n) parallel time upper bound for k = O\left(\frac {\sqrt n} {\log ^2 n}\right).</abstract>

<relatedItem type="constituent">
  <location>
    <url displayLabel="2025_PODC_ElHayek.pdf">https://research-explorer.ista.ac.at/download/20051/20115/2025_PODC_ElHayek.pdf</url>
  </location>
  <physicalDescription><internetMediaType>application/pdf</internetMediaType></physicalDescription><accessCondition type="restrictionOnAccess">no</accessCondition>
</relatedItem>
<originInfo><publisher>Association for Computing Machinery</publisher><dateIssued encoding="w3cdtf">2025</dateIssued><place><placeTerm type="text">Huatulco, Mexico</placeTerm></place>
</originInfo>
<language><languageTerm authority="iso639-2b" type="code">eng</languageTerm>
</language>



<relatedItem type="host"><titleInfo><title>Proceedings of the ACM Symposium on Principles of Distributed Computing</title></titleInfo>
  <identifier type="isbn"> 9798400718854</identifier>
  <identifier type="arXiv">2505.02765</identifier>
  <identifier type="ISI">001525534800066</identifier><identifier type="doi">10.1145/3732772.3733505</identifier>
<part>
</part>
</relatedItem>
<relatedItem type="Supplementary material">
  <location>     <url>https://research-explorer.ista.ac.at/record/22281</url>  </location>
</relatedItem>

<extension>
<bibliographicCitation>
<ista>El-Hayek A, Elsässer R, Schmid S. 2025. An almost tight lower bound for plurality consensus with undecided state dynamics in the population protocol model. Proceedings of the ACM Symposium on Principles of Distributed Computing. PODC: Symposium on Principles of Distributed Computing.</ista>
<ieee>A. El-Hayek, R. Elsässer, and S. Schmid, “An almost tight lower bound for plurality consensus with undecided state dynamics in the population protocol model,” in &lt;i&gt;Proceedings of the ACM Symposium on Principles of Distributed Computing&lt;/i&gt;, Huatulco, Mexico, 2025.</ieee>
<ama>El-Hayek A, Elsässer R, Schmid S. An almost tight lower bound for plurality consensus with undecided state dynamics in the population protocol model. In: &lt;i&gt;Proceedings of the ACM Symposium on Principles of Distributed Computing&lt;/i&gt;. Association for Computing Machinery; 2025. doi:&lt;a href=&quot;https://doi.org/10.1145/3732772.3733505&quot;&gt;10.1145/3732772.3733505&lt;/a&gt;</ama>
<chicago>El-Hayek, Antoine, Robert Elsässer, and Stefan Schmid. “An Almost Tight Lower Bound for Plurality Consensus with Undecided State Dynamics in the Population Protocol Model.” In &lt;i&gt;Proceedings of the ACM Symposium on Principles of Distributed Computing&lt;/i&gt;. Association for Computing Machinery, 2025. &lt;a href=&quot;https://doi.org/10.1145/3732772.3733505&quot;&gt;https://doi.org/10.1145/3732772.3733505&lt;/a&gt;.</chicago>
<apa>El-Hayek, A., Elsässer, R., &amp;#38; Schmid, S. (2025). An almost tight lower bound for plurality consensus with undecided state dynamics in the population protocol model. In &lt;i&gt;Proceedings of the ACM Symposium on Principles of Distributed Computing&lt;/i&gt;. Huatulco, Mexico: Association for Computing Machinery. &lt;a href=&quot;https://doi.org/10.1145/3732772.3733505&quot;&gt;https://doi.org/10.1145/3732772.3733505&lt;/a&gt;</apa>
<mla>El-Hayek, Antoine, et al. “An Almost Tight Lower Bound for Plurality Consensus with Undecided State Dynamics in the Population Protocol Model.” &lt;i&gt;Proceedings of the ACM Symposium on Principles of Distributed Computing&lt;/i&gt;, Association for Computing Machinery, 2025, doi:&lt;a href=&quot;https://doi.org/10.1145/3732772.3733505&quot;&gt;10.1145/3732772.3733505&lt;/a&gt;.</mla>
<short>A. El-Hayek, R. Elsässer, S. Schmid, in:, Proceedings of the ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2025.</short>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>20051</recordIdentifier><recordCreationDate encoding="w3cdtf">2025-07-21T08:16:15Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2026-07-24T12:48:28Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
