On the convergence of the Lemke-Howson algorithm for bi-matrix games

DOI10.1007/S10958-016-2932-9MaRDI QIDQ308592zbMATH OpenOpenAlexFDO

Authors D. S. Nabatova

Publication date 6 September 2016

Published in Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10958-016-2932-9

zbMATH Keywords

convergencebi-matrix gamesLemke-Howson algorithm

Mathematics Subject Classification ID

2-person games (91A05) Algorithms in computer science (68W99)

Recommendations

• Publication:3468904
• A procedure for finding Nash equilibria in bi-matrix games
• Hard-to-Solve Bimatrix Games
• Implementing the modified LH algorithm
• scientific article; zbMATH DE number 4023062

Cites work

• scientific article; zbMATH DE number 3358265 (Why is no real title available?)
• Equilibrium Points of Bimatrix Games
• On the convergence of the Lemke-Howson algorithm for bi-matrix games

Cited in

(6)

• Implementing the modified LH algorithm
• An oddity property for two-person games
• Hard-to-Solve Bimatrix Games
• scientific article; zbMATH DE number 4135740 (Why is no real title available?)
• On the convergence of the Lemke-Howson algorithm for bi-matrix games
• Convergence conditions for the Brown-Robinson iterative method for bimatrix games

This page was built for publication: On the convergence of the Lemke-Howson algorithm for bi-matrix games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q308592)