博弈论中Sergeyev无穷计算的数值渐近结果
Numerical Asymptotic Results in Game Theory Using Sergeyev's Infinity Computing
摘要:
囚徒困境是博弈论中一个被广泛研究的博弈,在博弈论中占有重要地位。本文的目的是扩展PD Toursweek的情况下,无限,有限或无穷小的支付使用谢尔盖耶夫的无限计算(IC)。通过利用IC,我们能够展示经典理论的经典方法的局限性,扩展了可行的和数值可计算的竞赛集。特别是,我们提供了一个简单的PD锦标赛的确切结果的数值计算,其中一个球员满足每一个其他无限的次数,其确定性和随机配方。
英文摘要:
Prisoner's Dilemma (PD) is a widely studied game that plays an important role in Game Theory. This paper aims at extending PD Tournaments to the case of infinite, finite or infinitesimal payoffs using Sergeyev's Infinity Computing (IC). By exploiting IC, we are able to show the limits of the classical approach to PD Tournaments analysis of the classical theory, extending both the sets of the feasible and numerically computable tournaments. In particular we provide a numerical computation of the exact outcome of a simple PD Tournament where one player meets every other an infinite number of times, for both its deterministic and stochastic formulations.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。