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


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access 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

Supplementary Files
Action
1. JATS XML

Copyright (c) 2016 Springer Science+Business Media New York