On the Convergence of the Lemke–Howson Algorithm for Bi-Matrix Games


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

We discuss conditions that guarantee the convergence of the computational Lemke–Howson algorithm for the solution of bi-matrix games and the computation of all Nash equilibria. An example is also presented.

作者简介

D. Nabatova

Financial University under the Government of the Russian Federation

编辑信件的主要联系方式.
Email: nabatova805@mail.ru
俄罗斯联邦, Moscow

补充文件

附件文件
动作
1. JATS XML

版权所有 © Springer Science+Business Media New York, 2016