Abstract
AbstractThis paper studies convex generalized Nash equilibrium problems that are given by polynomials. We use rational and parametric expressions for Lagrange multipliers to formulate efficient polynomial optimization for computing generalized Nash equilibria (GNEs). The Moment-SOS hierarchy of semidefinite relaxations are used to solve the polynomial optimization. Under some general assumptions, we prove the method can find a GNE if there exists one, or detect nonexistence of GNEs. Numerical experiments are presented to show the efficiency of the method.
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference58 articles.
1. Anselmi, J., Ardagna, D., Passacantando, M.: Generalized nash equilibria for saas/paas clouds. Eur. J. Oper. Res. 236(1), 326–339 (2014)
2. Ahmadi, A.A., Zhang, J.: Semidefinite programming and Nash equilibria in bimatrix games. INFORMS J. Comput. 33(2), 607–628 (2020)
3. Ardagna, D., Ciavotta, M., Passacantando, M.: Generalized Nash equilibria for the service provisioning problem in multi-cloud systems. IEEE Trans. Serv. Comput. 10, 381–395 (2017)
4. Arrow, K., Debreu, G.: Existence of an equilibrium for a competitive economy. Econom. J. Econom. Soc. 22, 265–290 (1954)
5. Ba, Q., Pang, J.: Exact penalization of generalized Nash equilibrium problems. Oper. Res. (2020). https://doi.org/10.1287/opre.2019.1942
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献