Minimax methods for open-loop equilibria in N-person differential games. Part I: Linear quadratic games and constrained games* Academic Article uri icon

abstract

  • In [13], Nikaido and Isoda generalised von Neumann's symmetrisation method for matrix games. They showed that N-person noncooperative games can be treated by a minimax method. We apply this method to N-person differential games. Lukes and Russell [11] first studied N-person nonzero sum linear quadratic games in 1971. Here we have reproduced and strengthened their results. The existence and uniqueness of equilibria are completely determined by the invertibility of the decision operator, and the nonuniqueness of equilibrium strategies is only up to a finite dimensional subspace of the space of all admissible strategies. In the constrained case, we have established an existence result for games with a much weaker convexity assumption subject to compact convex constraints. We have also derived certain results for games with noncompact constraints. Several examples of quadratic and non-quadratic games are given to illustrate the theorem. Numerical computations are also possible and are given in the sequel [3]. © 1986, Royal Society of Edinburgh. All rights reserved.

author list (cited authors)

  • Chen, G., Zheng, Q., & Zhou, J.

citation count

  • 1

publication date

  • January 1986