A note on the complexity of integer programming games

Abstract

In this brief note, we prove that the existence of Nash equilibria on integer programming games is ${\Sigma }_2^p$-complete.

Cited by in corpus (1)

• When Nash Meets Stackelberg