Nash-equilibria and N-fold integer programming

Simple item page
dc.creatorHemmecke, Raymond
dc.creatorOnn, Shmuel
dc.creatorWeismantel, Robert
dc.date2009-03-26
dc.date.accessioned2026-07-07T12:57:04Z
dc.date.available2026-07-07T12:57:04Z
dc.descriptionInspired 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.
dc.identifierhttps://arxiv.org/abs/0903.4577
dc.identifierhttp://arxiv.org/abs/0903.4577
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/224799
dc.subjectOptimization and Control
dc.subjectCombinatorics
dc.subject52Bxx, 52Cxx, 68Qxx, 68Rxx, 68Uxx, 68Wxx, 90Bxx, 90Cxx, 91Axx
dc.titleNash-equilibria and N-fold integer programming
dc.typetext

Files

Collections

arXiv