Geodesic
On the convergence of the Lemke–Howson algorithm for bi-matrix games
Contemporary Mathematics and Its Applications, Tome 95 (2015), pp. 100-113 
D. S. Nabatova. On the convergence of the Lemke–Howson algorithm for bi-matrix games. Contemporary Mathematics and Its Applications, Tome 95 (2015), pp. 100-113. http://geodesic.mathdoc.fr/item/CMA_2015_95_a11/
@article{CMA_2015_95_a11,
     author = {D. S. Nabatova},
     title = {On the convergence of the {Lemke{\textendash}Howson} algorithm for bi-matrix games},
     journal = {Contemporary Mathematics and Its Applications},
     pages = {100--113},
     year = {2015},
     volume = {95},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/CMA_2015_95_a11/}
}
TY  - JOUR
AU  - D. S. Nabatova
TI  - On the convergence of the Lemke–Howson algorithm for bi-matrix games
JO  - Contemporary Mathematics and Its Applications
PY  - 2015
SP  - 100
EP  - 113
VL  - 95
UR  - http://geodesic.mathdoc.fr/item/CMA_2015_95_a11/
LA  - ru
ID  - CMA_2015_95_a11
ER  - 
%0 Journal Article
%A D. S. Nabatova
%T On the convergence of the Lemke–Howson algorithm for bi-matrix games
%J Contemporary Mathematics and Its Applications
%D 2015
%P 100-113
%V 95
%U http://geodesic.mathdoc.fr/item/CMA_2015_95_a11/
%G ru
%F CMA_2015_95_a11

Voir la notice de l'article provenant de la source Math-Net.Ru

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.