Quadratic two-team games

We consider stochastic quadratic two-player games where each player represents a team of agents subject to information constraints. We present conditions that guarantee the existence and uniqueness of a Nash equilibrium in the space of linear decentralized policies and we provide an iterative algorithm to compute such an equilibrium. The results are illustrated on a numerical example inspired from power systems security.