基于级联多描述网络的战略沟通
Strategic Communication via Cascade Multiple Description Network
摘要：
在分散决策问题中，代理人根据本地可用的信息和其他代理人的决策规则或策略的知识来选择他们的行动。我们考虑一个三节点级联网络的编码器，一个中继和一个解码器，具有不同的目标捕获的成本函数。在这样的级联网络中，智能体依次选择各自的策略，作为对前一个智能体策略的响应，并以某种方式影响网络中后一个智能体的决策。我们假设编码器在通信发生之前提交一个策略。一旦编码策略被揭示，中继器就提交一个策略并揭示它。通信开始，源序列被提取并由编码器和中继器处理。然后，解码器观察符号序列，相应地更新其贝叶斯后验信念，并采取最佳行动。这是博弈论文献中贝叶斯说服问题的延伸。在这项工作中，我们提供了一个信息理论的方法来研究通过三节点级联网络的战略沟通的基本限制。我们的目标是描述编码器，中继器和解码器的最优策略，并研究编码器的最小长期成本函数的渐近行为。
英文摘要：
In decentralized decision-making problems, agents choose their actions based on locally available information and knowledge about decision rules or strategies of other agents. We consider a three-node cascade network with an encoder, a relay and a decoder, having distinct objectives captured by cost functions. In such a cascade network, agents choose their respective strategies sequentially, as a response to the former agent's strategy and in a way to influence the decision of the latter agent in the network. We assume the encoder commits to a strategy before the communication takes place. Upon revelation of the encoding strategy, the relay commits to a strategy and reveals it. The communication starts, the source sequence is drawn and processed by the encoder and relay. Then, the decoder observes a sequences of symbols, updates its Bayesian posterior beliefs accordingly, and takes the optimal action. This is an extension of the Bayesian persuasion problem in the Game Theory literature. In this work, we provide an information-theoretic approach to study the fundamental limit of the strategic communication via three-node cascade network. Our goal is to characterize the optimal strategies of the encoder, the relay and the decoder, and study the asymptotic behavior of the encoder's minimal long-run cost function.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
