Optimization reformulations of the generalized Nash equilibrium problem using Nikaido-Isoda-type functions
- 731 Downloads
We consider the generalized Nash equilibrium problem which, in contrast to the standard Nash equilibrium problem, allows joint constraints of all players involved in the game. Using a regularized Nikaido-Isoda-function, we then present three optimization problems related to the generalized Nash equilibrium problem. The first optimization problem is a complete reformulation of the generalized Nash game in the sense that the global minima are precisely the solutions of the game. However, this reformulation is nonsmooth. We then modify this approach and obtain a smooth constrained optimization problem whose global minima correspond to so-called normalized Nash equilibria. The third approach uses the difference of two regularized Nikaido-Isoda-functions in order to get a smooth unconstrained optimization problem whose global minima are, once again, precisely the normalized Nash equilibria. Conditions for stationary points to be global minima of the two smooth optimization problems are also given. Some numerical results illustrate the behaviour of our approaches.
KeywordsGeneralized Nash equilibria Normalized Nash equilibria Joint constraints Regularized Nikaido-Isoda-function Constrained optimization reformulation Unconstrained optimization reformulation
Unable to display preview. Download preview PDF.
- 1.Adida, E., Perakis, G.: Dynamic pricing and inventory control: uncertainty and competition. Part B: an algorithm for the normalized Nash equilibrium. Operations Research Center, Sloan School of Management, MIT, Technical Report (December 2005) Google Scholar
- 2.Adida, E., Perakis, G.: Dynamic pricing and inventory control: uncertainty and competition. Part A: existence of Nash equilibrium. Operations Research Center, Sloan School of Management, MIT, Technical Report (January 2006) Google Scholar
- 8.Facchinei, F., Pang, J.-S.: Finite-Dimensional Variational Inequalities and Complementarity Problems, vol. I. Springer, New York (2003) Google Scholar
- 9.Facchinei, F., Pang, J.-S.: Finite-Dimensional Variational Inequalities and Complementarity Problems, vol. II. Springer, New York (2003) Google Scholar
- 13.Flåm, S.D., Ruszczyński, A.: Noncooperative convex games: computing equilibria by partial regularization. IIASA, Laxenburg, Austria, Working Paper 94-42 (May 1994) Google Scholar
- 14.Fletcher, R.: On the Barzilai-Borwein method. Department of Mathematics, University of Dundee, Dundee, United Kingdom, Numerical Analysis Report NA/207 (2001) Google Scholar
- 22.Kesselman, A., Leonardi, S., Bonifaci, V.: Game-theoretic analysis of Internet switching with selfish users. In: Lecture Notes in Computer Science, vol. 3828, pp. 236–245 (2005) Google Scholar
- 30.Peng, J.-M.: Equivalence of variational inequality problems to unconstrained optimization. Math. Program. 78, 347–356 (1997) Google Scholar
- 38.Zhang, L., Han, J.: Unconstrained optimization reformulation of equilibrium problems. Institute of Applied Mathematics, Chinese Academy of Sciences, Beijing, China, Technical Report (2006) Google Scholar