The theories of algorithms and games were arguably born within a year of each other, in the wake of two quite distinct breakthroughs by John von Neumann, in the former case to investigate the great opportunities - as well as the ever mysterious obstacles - in attacking problems by computers, in the latter to model and study rational selfish behavior in the context of interaction, competition and cooperation. For more than half a century the two fields advanced as gloriously as they did separately. There was, of course, a tradition of computational considerations in equilibria initiated by Scarf , work on computing Nash and other equilibria, and reciprocal isolated works by algorithms researchers, as well as two important points of contact between the two fields a propos the issues of repeated games and bounded rationality and learning in games. But the current intensive interaction and cross-fertilization between the two disciplines, and the creation of a solid and growing body of work at their interface, must be seen as a direct consequence of the Internet.
展开▼
机译：算法和游戏的理论可以说是在一年之内诞生的，这是在约翰·冯·诺伊曼（John von Neumann）取得了两项截然不同的突破之后进行的，在前一种情况下，这是研究攻击问题的巨大机遇以及历来神秘的障碍通过计算机，后者在交互，竞争和合作的背景下对理性的自私行为进行建模和研究。半个多世纪以来，这两个领域分别取得了辉煌的进步。当然，有由Scarf发起的均衡计算考虑的传统，纳什和其他均衡的计算工作，算法研究人员的相互孤立的工作，以及这两个领域之间的两个重要联系，都提出了关于重复的游戏以及有限的理性和游戏学习。但是，这两个学科之间当前的密切互动和交叉应用，以及在它们的接口处创建稳固且不断发展的工作体系，必须被视为互联网的直接结果。
展开▼
