The algorithm of Lemke and Howson for finding an equilibrium of a 2-person game is extended to provide a constructive procedure for finding an equilibrium of an N-person game by finding in succession an equilibrium for each of certain related k-person games, 1 k N.
No takes yet. Share an insight, caveat, or question.
Robert B. Wilson (1971) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: