<?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>Undecided state dynamics with many opinions</title></titleInfo>


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


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

<name type="personal">
  <namePart type="given">Colin</namePart>
  <namePart type="family">Cooper</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">Frederik</namePart>
  <namePart type="family">Mallmann-Trenn</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">68748c44-84d5-11f1-b4f6-ca083374e553</identifier></name>
<name type="personal">
  <namePart type="given">Tomasz</namePart>
  <namePart type="family">Radzik</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">Nobutaka</namePart>
  <namePart type="family">Shimizu</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">Takeharu</namePart>
  <namePart type="family">Shiraga</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>






<abstract lang="eng">We study the Undecided-State Dynamics (USD), a fundamental consensus process in which each vertex holds one of k decided opinions or the undecided state. We consider both the gossip model and the population protocol model. Prior work established tight bounds on the consensus time of this process only for the regime 
k
=
O
(
n
/
(
log
⁡
n
)
2
)
 (for the population protocol model) and k = O((n/log n)1/3) (for the gossip model), often under restrictive assumptions on the initial configuration.
In this paper, we obtain the first consensus-time guarantees for USD that hold for arbitrary 2 ≤ k ≤ n and for arbitrary initial configurations in both the gossip model and the population protocol model. In the gossip model, USD reaches consensus within 
O
~
(
min
{
k
,
n
}
)
 synchronous rounds with probability 1 - p⊥ - n-c, where p⊥ is the gossip-specific probability of collapsing to the all-undecided state in the first round. In the population protocol model, USD reaches consensus within 
O
~
(
min
{
k
n
,
n
3
/
2
}
)
 asynchronous interactions with high probability. We also present lower bounds that match the upper bounds up to polylogarithmic factors for a specific initial configuration and show that our upper bounds are essentially optimal.</abstract>

<relatedItem type="constituent">
  <location>
    <url displayLabel="2026_ACMPODC_Cooper.pdf">https://research-explorer.ista.ac.at/download/22367/22380/2026_ACMPODC_Cooper.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">2026</dateIssued><place><placeTerm type="text">Egham, United Kingdom</placeTerm></place>
</originInfo>
<language><languageTerm authority="iso639-2b" type="code">eng</languageTerm>
</language>

<subject><topic>consensus dynamics</topic><topic>undecided state dynamics</topic><topic>gossip model</topic><topic>population protocol model</topic>
</subject>


<relatedItem type="host"><titleInfo><title>Proceedings of the Annual ACM Symposium on Principles of Distributed Computing</title></titleInfo>
  <identifier type="isbn">9798400725128</identifier>
  <identifier type="arXiv">2603.02636</identifier><identifier type="doi">10.1145/3796701.3815920</identifier>
<part><extent unit="pages">77-87</extent>
</part>
</relatedItem>


<extension>
<bibliographicCitation>
<mla>Cooper, Colin, et al. “Undecided State Dynamics with Many Opinions.” &lt;i&gt;Proceedings of the Annual ACM Symposium on Principles of Distributed Computing&lt;/i&gt;, Association for Computing Machinery, 2026, pp. 77–87, doi:&lt;a href=&quot;https://doi.org/10.1145/3796701.3815920&quot;&gt;10.1145/3796701.3815920&lt;/a&gt;.</mla>
<apa>Cooper, C., Mallmann-Trenn, F., Radzik, T., Shimizu, N., &amp;#38; Shiraga, T. (2026). Undecided state dynamics with many opinions. In &lt;i&gt;Proceedings of the Annual ACM Symposium on Principles of Distributed Computing&lt;/i&gt; (pp. 77–87). Egham, United Kingdom: Association for Computing Machinery. &lt;a href=&quot;https://doi.org/10.1145/3796701.3815920&quot;&gt;https://doi.org/10.1145/3796701.3815920&lt;/a&gt;</apa>
<ista>Cooper C, Mallmann-Trenn F, Radzik T, Shimizu N, Shiraga T. 2026. Undecided state dynamics with many opinions. Proceedings of the Annual ACM Symposium on Principles of Distributed Computing. PODC: Symposium on Principles of Distributed Computing, 77–87.</ista>
<short>C. Cooper, F. Mallmann-Trenn, T. Radzik, N. Shimizu, T. Shiraga, in:, Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2026, pp. 77–87.</short>
<ama>Cooper C, Mallmann-Trenn F, Radzik T, Shimizu N, Shiraga T. Undecided state dynamics with many opinions. In: &lt;i&gt;Proceedings of the Annual ACM Symposium on Principles of Distributed Computing&lt;/i&gt;. Association for Computing Machinery; 2026:77-87. doi:&lt;a href=&quot;https://doi.org/10.1145/3796701.3815920&quot;&gt;10.1145/3796701.3815920&lt;/a&gt;</ama>
<ieee>C. Cooper, F. Mallmann-Trenn, T. Radzik, N. Shimizu, and T. Shiraga, “Undecided state dynamics with many opinions,” in &lt;i&gt;Proceedings of the Annual ACM Symposium on Principles of Distributed Computing&lt;/i&gt;, Egham, United Kingdom, 2026, pp. 77–87.</ieee>
<chicago>Cooper, Colin, Frederik Mallmann-Trenn, Tomasz Radzik, Nobutaka Shimizu, and Takeharu Shiraga. “Undecided State Dynamics with Many Opinions.” In &lt;i&gt;Proceedings of the Annual ACM Symposium on Principles of Distributed Computing&lt;/i&gt;, 77–87. Association for Computing Machinery, 2026. &lt;a href=&quot;https://doi.org/10.1145/3796701.3815920&quot;&gt;https://doi.org/10.1145/3796701.3815920&lt;/a&gt;.</chicago>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>22367</recordIdentifier><recordCreationDate encoding="w3cdtf">2026-07-19T22:01:47Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2026-07-21T07:54:01Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
