种群协议中的精确多数共识——如何利用微小的失败概率消除无关紧要的意见
Population Protocols for Exact Plurality Consensus -- How a small chance of failure helps to eliminate insignificant opinions
AI总结：
针对种群协议中的精确多数共识问题，我们设计了允许微小失败概率的协议，以超越二次状态下界，通过锦标赛和意见修剪，在时间与状态复杂度上实现高效多数识别。
摘要：
我们考虑种群协议中的精确多数共识问题。在此问题中，n 个匿名代理各自以 k 种意见之一开始。他们的目标是通过随机、成对的交互，就初始最频繁的意见（即多数意见）达成一致。k = 2 种意见的情况被称为多数问题。最近的突破导致了始终正确、精确的多数种群协议，该协议在时间和空间上均最优，每个代理需要 O(log n) 个状态，并且以高概率在 O(log n) 时间内完成 [Doty, Eftekhari, Gasieniec, Severson, Stachowiak, and Uznanski; 2021]。我们知道，任何始终正确的协议需要 Ω(k^2) 个状态，而目前最好的协议需要 O(k^11) 个状态 [Natale and Ramezani; 2019]。对于有序意见，这可以改进到 O(k^6) [Gasieniec, Hamilton, Martin, Spirakis, and Stachowiak; 2016]。我们设计了多数共识协议，通过允许可忽略的失败概率来超越二次下界。虽然我们的协议可能失败，但即使偏差为 1，它们也能以高概率识别出多数意见。我们的第一个协议通过 k-1 次锦标赛在 O(k · log n) 时间内使用 O(k + log n) 个状态实现这一点。虽然它假设意见有序，但我们在第二个协议中移除了这一限制，代价是时间略微增加至 O(k · log n + log^2 n)。通过高效地修剪无关紧要的意见，我们的最终协议减少了锦标赛的数量，代价是状态复杂度略微增加至 O(k · log log n + log n)。这将时间改进为 O(n / x_max · log n + log^2 n)，其中 x_max 是多数意见的初始规模。注意，n/x_max 最多为 k，并且可以小得多（例如，在偏差较大或存在许多小意见的情况下）。
英文摘要：
We consider the \emph{exact plurality consensus} problem for \emph{population protocols}. Here, $n$ anonymous agents start each with one of $k$ opinions. Their goal is to agree on the initially most frequent opinion (the \emph{plurality opinion}) via random, pairwise interactions. The case of $k = 2$ opinions is known as the \emph{majority problem}. Recent breakthroughs led to an always correct, exact majority population protocol that is both time- and space-optimal, needing $O(\log n)$ states per agent and, with high probability, $O(\log n)$ time~[Doty, Eftekhari, Gasieniec, Severson, Stachowiak, and Uznanski; 2021]. We know that any always correct protocol requires $Ω(k^2)$ states, while the currently best protocol needs $O(k^{11})$ states~[Natale and Ramezani; 2019]. For ordered opinions, this can be improved to $O(k^6)$~[Gasieniec, Hamilton, Martin, Spirakis, and Stachowiak; 2016]. We design protocols for plurality consensus that beat the quadratic lower bound by allowing a negligible failure probability. While our protocols might fail, they identify the plurality opinion with high probability even if the bias is $1$. Our first protocol achieves this via $k-1$ tournaments in time $O(k \cdot \log n)$ using $O(k + \log n)$ states. While it assumes an ordering on the opinions, we remove this restriction in our second protocol, at the cost of a slightly increased time $O(k \cdot \log n + \log^2 n)$. By efficiently pruning insignificant opinions, our final protocol reduces the number of tournaments at the cost of a slightly increased state complexity $O(k \cdot \log\log n + \log n)$. This improves the time to $O(n / x_{\max} \cdot \log n + \log^2 n)$, where $x_{\max}$ is the initial size of the plurality. Note that $n/x_{\max}$ is at most $k$ and can be much smaller (e.g., in case of a large bias or if there are many small opinions).
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
