On the Convergence of the Lemke–Howson Algorithm for Bi-Matrix Games
- 作者: Nabatova D.S.1
-
隶属关系:
- Financial University under the Government of the Russian Federation
- 期: 卷 216, 编号 5 (2016)
- 页面: 702-715
- 栏目: Article
- URL: https://bakhtiniada.ru/1072-3374/article/view/237900
- DOI: https://doi.org/10.1007/s10958-016-2932-9
- ID: 237900
如何引用文章
详细
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
补充文件
