Construct · 1 fields · 1 citations

Lemke-Howson algorithm: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Game theory

pivoting algorithm that finds a Nash equilibrium of a two-player normal-form game by following a path of almost complementary strategy profiles.

In game theory, Lemke-Howson algorithm refers to pivoting algorithm that finds a Nash equilibrium of a two-player normal-form game by following a path of almost complementary strategy profiles. This meaning comes from Lemke (1964) in Journal of the Society for Industrial and Applied Mathematics.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how Lemke-Howson algorithm sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

equilibrium4 fields · 4 citationsjingle · one word, four constructs game2 fields · 3 citationsjingle · one word, two constructs Nash equilibrium1 fields · 2 citationsanchor · a standalone construct

References

Lemke, C. E., & Howson, Jr., J. T. (1964). Equilibrium Points of Bimatrix Games. Journal of the Society for Industrial and Applied Mathematics, 12(2), 413-423. https://doi.org/10.1137/0112033

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct