Computing Equilibria of N-Person Games

Abstract
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\leqq k\leqq N$.

This publication has 2 references indexed in Scilit: