An N-player game can be approximated by adding a coordinator who interacts bilaterally with each player. The coordinator proposes strategies to the players, and his payoff is maximized when each player's optimal reply agrees with his proposal. When the feasible set of proposals is finite, a solution of an associated linear complementarity problem yields an approximate equilibrium of the original game. Computational efficiency is improved by using the vertices of Kuhn's triangulation of the players' strategy space for the coordinator's pure strategies. Computational experience is reported.
