Email this article On the Convergence of the Lemke–Howson Algorithm for Bi-Matrix Games
- Authors: Nabatova D.S.1
-
Affiliations:
- Financial University under the Government of the Russian Federation
- Issue: Vol 216, No 5 (2016)
- Pages: 702-715
- Section: Article
- URL: https://bakhtiniada.ru/1072-3374/article/view/237900
- DOI: https://doi.org/10.1007/s10958-016-2932-9
- ID: 237900
Cite item
Open Access
Access granted
Subscription Access
Abstract
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.
About the authors
D. S. Nabatova
Financial University under the Government of the Russian Federation
Author for correspondence.
Email: nabatova805@mail.ru
Russian Federation, Moscow
Supplementary files
