零误差协调
Zero Error Coordination
摘要:
在本文中,我们考虑一个零误差协调问题,其中网络的节点交换消息,能够完美地协调他们的行动与彼此的个人观察。虽然以前的协调工作通常假设一个渐近消失的错误,我们假设准确,零误差协调。此外,与以往的作品,采用经验或强协调的概念,我们定义和使用的概念集协调。这种协调的概念与协调的经验概念有相似之处。我们观察到,设置协调,在其特殊情况下的两个节点的单向通信链路是等效的“隐藏和寻找”信源编码问题的McEliece和波斯纳。Hide and Seek问题与图熵、率失真理论、Renyi互信息甚至误差指数都有着密切的联系。集合协调问题的其他特殊情况涉及Witsenhausen的零出错率和分布式计算问题。这些联系促使人们更好地理解集合协调,它与经验协调的联系,以及它在更一般的设置中的研究。本文在这个方向上迈出了第一步,证明了新的结果,两个节点的网络。
英文摘要:
In this paper, we consider a zero error coordination problem wherein the nodes of a network exchange messages to be able to perfectly coordinate their actions with the individual observations of each other. While previous works on coordination commonly assume an asymptotically vanishing error, we assume exact, zero error coordination. Furthermore, unlike previous works that employ the empirical or strong notions of coordination, we define and use a notion of set coordination. This notion of coordination bears similarities with the empirical notion of coordination. We observe that set coordination, in its special case of two nodes with a one-way communication link is equivalent with the "Hide and Seek" source coding problem of McEliece and Posner. The Hide and Seek problem has known intimate connections with graph entropy, rate distortion theory, Renyi mutual information and even error exponents. Other special cases of the set coordination problem relate to Witsenhausen's zero error rate and the distributed computation problem. These connections motivate a better understanding of set coordination, its connections with empirical coordination, and its study in more general setups. This paper takes a first step in this direction by proving new results for two node networks.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。