【24h】

The St. Petersburg Paradox: A Fresh Algorithmic Perspective

机译:圣彼得堡悖论:一种新的算法视角

获取原文

摘要

The St. Petersburg paradox is a centuries-old puzzle concerning a lottery with infinite expected payoff on which people are only willing to pay a small amount to play. Despite many attempts and several proposals, no generally-accepted resolution is yet at hand. In a recent paper, we show that this paradox can be understood in terms of the mind optimally using its limited computational resources (Nobandegani et al. 2019). Specifically, we show that the St. Petersburg paradox can be accounted for by a variant of normative expected-utility valuation which acknowledges cognitive limitations: sample-based expected utility (Nobandegani et al. 2018). SbEU provides a unified, algorithmic explanation of major experimental findings on this paradox. We conclude by discussing the implications of our work for algorithmically understanding human cognition and for developing humanlike artificial intelligence.
机译:圣彼得堡悖论是一位百年历史的拼图,了解有无限预期的收益,人们只愿意支付少量的戏。 尽管有许多尝试和若干提案,但尚未常见的决议尚未。 在最近的一篇论文中,我们表明,这种悖论可以在最佳的计算资源上最佳地理解(Nobandegani等,2019)。 具体而言,我们表明,圣彼得堡悖论可以通过规范预期实用估值的变体来占认识到认知限制:基于样品的预期效用(Nobandegani等,2018)。 SBEU在该悖论上提供了对主要实验结果的统一,算法解释。 我们通过讨论我们的工作对算法理解人类认知和发展人类人工智能的影响来结束。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号