arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2307.02644cs.ITmath.IT
收藏

从策略性发送者处进行信息提取的可达速率

Achievable Rates for Information Extraction from a Strategic Sender

Anuj S. Vora, Ankur A. Kulkarni

AI总结:

针对策略性发送者与接收者的非合作通信,提出序贯博弈模型,证明在发送者效用条件下存在可靠恢复策略,并揭示最大速率低于信道容量,需故意对部分消息出错。

摘要:

我们考虑一种非合作通信设置,其中接收者想要恢复由策略性发送者观察到的随机生成的符号序列。发送者旨在最大化一个平均效用,该效用可能与接收者的恢复准则不一致,因此其发送的信号可能不真实。通信速率定义为在与发送者通信时正确恢复的序列所对应的重构数量。我们将此问题建模为发送者与接收者之间的序贯博弈,其中接收者为领导者,并确定接收者能够实现错误概率趋于零的策略,同时计算此类策略的速率。我们证明了在发送者效用的一个条件下此类策略的存在性。对于二元字母表的情况,该条件也是必要的;若缺乏该条件,则对于接收者的所有策略选择,错误概率都将趋于一。我们表明,为了可靠恢复,接收者选择仅正确解码从发送者接收到的消息的一个$\ extit{子集}$,并故意对该子集之外的消息产生错误。尽管信道干净,我们的设置仍表现出非平凡的$\ extit{最大}$通信速率,该速率通常严格小于信道容量。这意味着不可能存在以高于最大速率的速率正确解码序列同时实现可靠通信的策略。这是与通常的合作通信设置的关键区别点。

英文摘要:

We consider a setting of non-cooperative communication where a receiver wants to recover randomly generated sequences of symbols that are observed by a strategic sender. The sender aims to maximize an average utility that may not align with the recovery criterion of the receiver, whereby the signals it sends may not be truthful. The rate of communication is defined as the number of reconstructions corresponding to the sequences recovered correctly while communicating with the sender. We pose this problem as a sequential game between the sender and the receiver with the receiver as the leader and determine strategies for the receiver that attain vanishing probability of error and compute the rates of such strategies. We show the existence of such strategies under a condition on the utility of the sender. For the case of the binary alphabet, this condition is also necessary, in the absence of which, the probability of error goes to one for all choices of strategies of the receiver. We show that for reliable recovery, the receiver chooses to correctly decode only a $\textit{subset}$ of messages received from the sender and deliberately makes an error on messages outside this subset. Despite a clean channel, our setting exhibits a non-trivial $\textit{maximum}$ rate of communication, which is in general strictly less than the capacity of the channel. This implies the impossibility of strategies that correctly decode sequences of rate greater than the maximum rate while also achieving reliable communication. This is a key point of departure from the usual setting of cooperative communication.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑