将对话视为策略博弈，揭示图灵测试的深层博弈本质。
Conversation Games and a Strategic View of the Turing Test
- 构建以语言为核心的战略博弈模型，聚焦可判定对话过程。
- 模拟显示策略型代理胜过盲目代理，优势显著。
- 适用于分析审讯、审判与高级AI欺骗等真实场景。
尽管许多博弈论模型能模拟依赖自然语言的真实互动，但对语言作为战略核心的博弈研究仍较有限。本文提出‘对话博弈’，一种基于语言策略互动的多阶段扩展型博弈。重点关注其中的‘判决博弈’：两名玩家交替参与对话，每轮由非策略性裁判判定是否给出二元结论或继续对话。游戏在达到上限或产生判决时结束。我们证明，审讯、法庭程序等常见流程均属此类。同时指出图灵测试即为判决博弈的实例，并探讨在先进AI欺骗盛行时代，以博弈视角理解图灵测试的意义。通过模拟实验验证了该框架的实用性，结果显示策略型智能体远超朴素代理。
原文摘要 · Abstract (English)
Although many game-theoretic models replicate real interactions that often rely on natural language, explicit study of games where language is central to strategic interaction remains limited. This paper introduces the \emph{conversation game}, a multi-stage, extensive-form game based on linguistic strategic interaction. We focus on a subset of the games, called verdict games. In a verdict game, two players alternate to contribute to a conversation, which is evaluated at each stage by a non-strategic judge who may render a conclusive binary verdict, or a decision to continue the dialogue. The game ends once a limit is reached or a verdict is given. We show many familiar processes, such as interrogation or a court process fall under this category. We also, show that the Turing test is an instance of verdict game, and discuss the significance of a strategic view of the Turing test in the age of advanced AI deception. We show the practical relevance of the proposed concepts by simulation experiments, and show that a strategic agent outperforms a naive agent by a high margin.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。