2009/03/26 by Hemmecke, Raymond, Onn, Shmuel, Weismantel, Robert
#52Bxx #52Cxx #68Qxx #68Rxx #68Uxx #68Wxx #90Bxx #90Cxx #91Axx #Combinatorics (math.CO) #FOS: Mathematics #Optimization and Control (math.OC)
paper · doi:10.48550/arxiv.0903.4577
Inspired 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.