Symmetric duality in quadratic programming and matrix game equivalence Original Research Article

In this note, we study equivalence between symmetric duality in quadratic programming and matrix games. In particular, we obtain two different zero-sum games (a symmetric game and a nonsymmetric game) whose Nash equilibria correspond to the solutions of pairs of quadratic primal-dual problems.