2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/224799Inspired by a paper of R. W. Rosenthal, we investigate generalized Nash-equilibria of integer programming games. We show that generalized Nash-equilibria always exist and are related to an optimal solution of a so-called N-fold integer program. This link allows us to establish some polynomial time complexity results about solving this optimization problem and its inverse counter-part.Optimization and ControlCombinatorics52Bxx, 52Cxx, 68Qxx, 68Rxx, 68Uxx, 68Wxx, 90Bxx, 90Cxx, 91Axxtext