@inproceedings{22367,
  abstract     = {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.},
  author       = {Cooper, Colin and Mallmann-Trenn, Frederik and Radzik, Tomasz and Shimizu, Nobutaka and Shiraga, Takeharu},
  booktitle    = {Proceedings of the Annual ACM Symposium on Principles of Distributed Computing},
  isbn         = {9798400725128},
  keywords     = {consensus dynamics, undecided state dynamics, gossip model, population protocol model},
  location     = {Egham, United Kingdom},
  pages        = {77--87},
  publisher    = {Association for Computing Machinery},
  title        = {{Undecided state dynamics with many opinions}},
  doi          = {10.1145/3796701.3815920},
  year         = {2026},
}