Epistemic protocols for dynamic gossip
Epistemic protocols for dynamic gossip
复制标题
动态八卦的认知协议
DOI：
10.1016/j.jal.2016.12.001
复制
发表时间：
2017
期刊：
影响因子：
--
通讯作者：
François Schwarzentruber
中科院分区：
文献类型：
--
作者：
H. V. Ditmarsch;J. Eijck;Pere Pardo;Rahim Ramezanian;François Schwarzentruber
八卦协议是使用连接图在一组代理之间传播秘密的过程。在两个相互关联的特工之间的每一次通话中，这两个特工都会分享他们了解到的所有秘密。在动态八卦问题中，动态连接图是通过允许代理传播他们知道的其他代理的电话号码来实现的。本文利用(最大)图类刻画了不同的分布式认知协议，其中每个协议都是成功的，即协议必须以所有代理都知道所有秘密而结束。
A gossip protocol is a procedure for spreading secrets among a group of agents, using a connection graph. In each call between a pair of connected agents, the two agents share all the secrets they have learnt. In dynamic gossip problems, dynamic connection graphs are enabled by permitting agents to spread as well the telephone numbers of other agents they know. This paper characterizes different distributed epistemic protocols in terms of the (largest) class of graphs where each protocol is successful, i.e. where the protocol necessarily ends up with all agents knowing all secrets.