多数问题种群协议的时空权衡
Time-space Trade-offs in Population Protocols for the Majority Problem
摘要：
人口协议是一个分布式计算的模型，其重点是简单性和鲁棒性。$n$相同的代理（有限状态机）系统执行全局任务，如选举一个唯一的领导者或确定多数意见时，每个代理有两个意见之一。智能体与随机分配的通信伙伴进行成对交互。质量通过两种方式来衡量：完成任务的交互数量和每个代理的状态数量。我们提出了协议的多数问题，允许这两个措施之间的权衡。与唯一的其他权衡结果[Alistarh，Gelashvili，Vojnovic; PODC'15]相比，我们几乎以线性因子提高了相互作用的数量。此外，我们的协议可以统一（正确的工作，没有任何信息的人口规模$n$），产生第一个均匀的多数协议，稳定在一个次二次方的相互作用。
英文摘要：
Population protocols are a model for distributed computing that is focused on simplicity and robustness. A system of $n$ identical agents (finite state machines) performs a global task like electing a unique leader or determining the majority opinion when each agent has one of two opinions. Agents communicate in pairwise interactions with randomly assigned communication partners. Quality is measured in two ways: the number of interactions to complete the task and the number of states per agent. We present protocols for the majority problem that allow for a trade-off between these two measures. Compared to the only other trade-off result [Alistarh, Gelashvili, Vojnovic; PODC'15], we improve the number of interactions by almost a linear factor. Furthermore, our protocols can be made uniform (working correctly without any information on the population size $n$), yielding the first uniform majority protocols that stabilize in a subquadratic number of interactions.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
