Lemke–Howson algorithm: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

    10 October 2022

    • curprev 11:5811:58, 10 October 2022‎ Admin talk contribs‎ 1,321 bytes +1,321‎ Created page with "== Algorithm Details == Year : 1964 Family : Nash Equilibria Authors : C. E. Lemke and J. T. Howson, Jr. Read More: https://epubs.siam.org/doi/abs/10.1137/0112033?journalCode=smjmap.1& Paper Link : https://epubs.siam.org/doi/abs/10.1137/0112033?journalCode=smjmap.1 Time Complexity : == Problem Statement == Nash equilibrium is a concept within game theory where the optimal outcome of a game is where there is no incentive to deviate from the initial strategy. Mo..."
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Lemke–Howson_algorithm"