ABSTRACT
A successive approximations procedure for finding the Nash equilibrium of games between interconnected systems is introduced. For the case of linear system equations and quadratic costs, explicit conditions are found which guarantee convergence of the procedure. A coordinator is then introduced into the system to allow implementation of “primal” and “dual” iterative procedures for finding Pareto efficient Nash equilibria, if such exist.
