A Note on Well-posedness of Nash-type Games Problems with Set Payoff


Authors

Yu Zhang - College of Statistics and Mathematics, Yunnan University of Finance and Economics, Kunming 650221, China. Tao Chen - College of Public Foundation, Yunnan Open University, Kunming, 650223, China.


Abstract

In this paper, Nash-type games problems with set payoff (for short, NGPSP) are first introduced. Then, in terms of the measure of noncompactness, some well-posedness results for Nash-type games problems with set payoff are obtained in Banach spaces.


Share and Cite

  • Share on Facebook
  • Share on Twitter
  • Share on LinkedIn
ISRP Style

Yu Zhang, Tao Chen, A Note on Well-posedness of Nash-type Games Problems with Set Payoff, Journal of Nonlinear Sciences and Applications, 9 (2016), no. 2, 486--492

AMA Style

Zhang Yu, Chen Tao, A Note on Well-posedness of Nash-type Games Problems with Set Payoff. J. Nonlinear Sci. Appl. (2016); 9(2):486--492

Chicago/Turabian Style

Zhang, Yu, Chen, Tao. "A Note on Well-posedness of Nash-type Games Problems with Set Payoff." Journal of Nonlinear Sciences and Applications, 9, no. 2 (2016): 486--492


Keywords


MSC


References