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 p2-complete.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.