Best Approximate Solution for Generalized Nash Games and Quasi-optimization Problems
Abstract
In this article, we consider generalized Nash games where the associated constraint map is not necessarily self. The classical Nash equilibrium may not exist for such games and therefore we introduce the notion of best approximate solution for such games. We investigate the occurrence of best approximate solutions for such generalized Nash games consisting of infinitely many players in which each player regulates the strategy variable lying in a topological vector space. Based on the maximum theorem and a fixed point result for Kakutani factorizable maps, we derive the existence of best approximate solutions under the quasi-concavity and weak continuity assumption on players' objective functions. Furthermore, we demonstrate the occurrence of best approximate solutions for quasi-optimization problems.
Cite
@article{arxiv.2204.00782,
title = {Best Approximate Solution for Generalized Nash Games and Quasi-optimization Problems},
author = {Asrifa Sultana and Shivani Valecha},
journal= {arXiv preprint arXiv:2204.00782},
year = {2022}
}