Nash-equilibria and N-fold integer programming
Optimization and Control
2009-03-27 v1 Combinatorics
Abstract
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.
Keywords
Cite
@article{arxiv.0903.4577,
title = {Nash-equilibria and N-fold integer programming},
author = {Raymond Hemmecke and Shmuel Onn and Robert Weismantel},
journal= {arXiv preprint arXiv:0903.4577},
year = {2009}
}