arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1602.04184cs.GTcs.LO
收藏

参数有界Löb定理与有界Agent的鲁棒合作

Parametric Bounded Löb's Theorem and Robust Cooperation of Bounded Agents

Andrew Critch

摘要:

Löb定理和哥德尔定理预测了能够自引用的系统的行为,这些系统具有无限的计算资源来编写和评估证明。然而,在现实世界中,能够自引用的系统将具有有限的内存和处理速度,因此在本文中,我们引入了一个有效版本的Löb定理,该定理适用于给定的有限资源。这些结果具有强大的影响博弈论的有界代理人谁能够写证明自己和对方,包括能力超越经典纳什均衡和相关的均衡,实现相互合作的计划平衡的囚徒困境。Tennenholtz(2004)和Fortnow(2009)研究的合作计划均衡依赖于对计划平等的测试,这是一个脆弱的条件,而“Löbian”合作更强大,对对手的实施更不可知。

英文摘要:

Löb's theorem and Gödel's theorems make predictions about the behavior of systems capable of self-reference with unbounded computational resources with which to write and evaluate proofs. However, in the real world, systems capable of self-reference will have limited memory and processing speed, so in this paper we introduce an effective version of Löb's theorem which is applicable given such bounded resources. These results have powerful implications for the game theory of bounded agents who are able to write proofs about themselves and one another, including the capacity to out-perform classical Nash equilibria and correlated equilibria, attaining mutually cooperative program equilibrium in the Prisoner's Dilemma. Previous cooperative program equilibria studied by Tennenholtz (2004) and Fortnow (2009) have depended on tests for program equality, a fragile condition, whereas "Löbian" cooperation is much more robust and agnostic of the opponent's implementation.

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

↑