【24h】

LIAR!

机译:荒野!

获取原文

摘要

Paul is trying to ascertain an unknown x, out of n possibilities, from an adversary Carole by asking a series of q queries. in the standard "Twenty Questions" Paul wins if and only if n ≤ 2~q. In Liar Games, Carole is allowed, under certain restrictions, to give an incorrect response. Throughout this study Carole will be restricted to give at most k incorrect responses, or lies. Asymptotic analysis here will be for k arbitrary but fixed, k = 1 being a natural and interesting case. The game with ten queries, one hundred possibilities, and (at most) one lie is amusing to play.
机译:保罗正试图通过询问一系列Q查询,从对抗尸体来确定一个未知的x。在标准的“20个问题”中,如果n≤2〜q才能赢得胜利。在骗子游戏中,在某些限制下,允许卡罗尔响应不正确。在整个研究中,Carole将被限制为给予大多数K不正确的响应或谎言。这里的渐近分析将是k任意但固定的,k = 1是自然和有趣的情况。游戏有十个查询,一百个可能性,(最多)一个谎言正在有趣地玩。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号