首页> 外文期刊>Communications of the ACM >Technical Perspective The Complexity Of Computing Nash Equilibrium
【24h】

Technical Perspective The Complexity Of Computing Nash Equilibrium

机译:技术观点计算纳什均衡的复杂性

获取原文
获取原文并翻译 | 示例
           

摘要

Computer science and game theory go back to the same individual, John von Neumann, and both subjects deal with the mathematization of rational decision making. Yet, for many years they continued to work apart. Computer science concentrated mostly on issues of complexity; game theory mostly on issues of incentives. But in the last dozen years we have seen a fusion of the two fields. Methodologies of each are used to solve problems in the other, and the concepts of each are incorporated to create better and more robust models in the other. Nash equilibrium, introduced in the 1950s, is the main concept used in the analysis of strategic games. The equilibrium is simple to describe, logically appealing, powerful in making predictions, and its existence was brilliantly demonstrated by John Nash.
机译:计算机科学和博弈论可以追溯到同一个人约翰·冯·诺伊曼(John von Neumann),并且两个主题都涉及理性决策的数学化。然而,多年来他们继续分开工作。计算机科学主要集中在复杂性问题上。博弈论主要涉及激励问题。但是在过去的十二年中,我们看到了这两个领域的融合。每种方法都用于解决另一种方法中的问题,并且将每种方法的概念合并在一起以在另一种方法中创建更好,更可靠的模型。 1950年代引入的纳什均衡是用于分析战略博弈的主要概念。均衡易于描述,在逻辑上很有吸引力,在做出预测时很有用,约翰·纳什(John Nash)很好地证明了均衡的存在。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号