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 received signals may not be truthful. We pose this problem as a sequential game between the sender and the receiver with the receiver as the leader and determine `achievable strategies' for the receiver that attain arbitrarily small probability of error for large blocklengths. We show the existence of such achievable strategies under a sufficient 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 subset of messages received from the sender and deliberately makes an error on messages outside this subset. Due to this decoding strategy, despite a clean channel, our setting exhibits a notion of maximum rate of communication above which the probability of error may not vanish asymptotically and in certain cases, may even tend to one. For the case of the binary alphabet, the maximum rate may be strictly less than unity for certain classes of utilities.

翻译：我们考虑非合作通信场景，其中接收方希望恢复由战略发送者观测到的随机生成符号序列。发送者旨在最大化可能不与接收方恢复准则一致的期望效用，因此接收信号可能不真实。我们将此问题建模为以接收者为领导者的发送者-接收者序贯博弈，并确定接收者在大块长度下可实现任意小错误概率的"可实现策略"。我们证明了在发送者效用的充分条件下存在此类可达策略。对于二元字母表情形，该条件也是必要的，若条件不满足，则无论接收者选择何种策略，错误概率都将趋近于1。研究表明，为实现可靠恢复，接收者仅正确解码来自发送者的消息子集，并故意对该子集外的消息进行误判。由于这种解码策略，尽管信道纯净，我们的设置呈现出一种最大通信速率概念：当超过该速率时，错误概率可能不会渐近消失，在某些情况下甚至可能趋近于1。对于二元字母表情形，当效用函数属于特定类别时，该最大速率可能严格小于1。