Lemke-Howson Algorithm for 2-Player Games

A function for computing mixed Nash equilibria in bimatrix games.
1,2K download
Aggiornato 31 dic 2014

Visualizza la licenza

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."

Cita come

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

Compatibilità della release di MATLAB
Creato con R2013a
Compatibile con qualsiasi release
Compatibilità della piattaforma
Windows macOS Linux
Categorie
Scopri di più su Strategy & Logic in Help Center e MATLAB Answers

Community Treasure Hunt

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

Start Hunting!
Versione Pubblicato Note della release
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