Lemke–Howson algorithm

E1917310 UNEXPLORED

The Lemke–Howson algorithm is a pivoting procedure in game theory used to compute one Nash equilibrium of a finite two-player bimatrix game.

Try in SPARQL Jump to: Surface forms Referenced by

All labels observed (1)

Label Occurrences
Lemke–Howson algorithm canonical 1

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.

Scarf algorithm → relatedAlgorithm → Lemke–Howson algorithm ⓘ