Lemke-Howson Algorithm for 2-Player Games

Version 1.3.0.0 (2.74 KB) by Richard Katzwer
A function for computing mixed Nash equilibria in bimatrix games.
5.0
(3)
1.2K Downloads
Updated 31 Dec 2014

View License

This function computes a sample mixed strategy Nash equilibrium in a bimatrix game. This function implements the Lemke-Howson complementary pivoting algorithm for solving Bimatrix Games, a variant of the Lemke algorithm for linear complementarity problems (LCPs).
References:

C. E. Lemke and J. T. Howson, Jr. "Equilibrium Points of Bimatrix Games" Journal of the Society for Industrial and Applied Mathematics. Vol. 12, No. 2 (Jun., 1964), pp. 413-423

Lloyd S. Shapley. "A note on the Lemke-Howson algorithm". Pivoting and Extension: Mathematical Programming Studies Volume 1, 1974, pp 175-189

Bruno Codenotti, Stefano De Rossi, Marino Pagan. "An experimental analysis of Lemke-Howson algorithm."

Cite As

Richard Katzwer (2025). Lemke-Howson Algorithm for 2-Player Games (https://www.mathworks.com/matlabcentral/fileexchange/44279-lemke-howson-algorithm-for-2-player-games), MATLAB Central File Exchange. Retrieved .

MATLAB Release Compatibility
Created with R2013a
Compatible with any release
Platform Compatibility
Windows macOS Linux
Categories
Find more on Strategy & Logic in Help Center and MATLAB Answers
Tags Add Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Version Published Release Notes
1.3.0.0

Changed title
1.2.0.0

Updated tags
1.1.0.0

Fixed strict-positivity check on column player payoff matrix 'B'.

1.0.0.0