Nonsmooth optimization reformulations characterizing all solutions of jointly convex generalized Nash equilibrium problems
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Anna Heusinger & Christian Kanzow, 2009. "Optimization reformulations of the generalized Nash equilibrium problem using Nikaido-Isoda-type functions," Computational Optimization and Applications, Springer, vol. 43(3), pages 353-377, July.
- Steffan Berridge & Jacek Krawczyk, "undated". "Relaxation Algorithms in Finding Nash Equilibrium," Computing in Economics and Finance 1997 159, Society for Computational Economics.
- Harker, Patrick T., 1991. "Generalized Nash games and quasi-variational inequalities," European Journal of Operational Research, Elsevier, vol. 54(1), pages 81-94, September.
- Jong-Shi Pang & Masao Fukushima, 2005. "Quasi-variational inequalities, generalized Nash equilibria, and multi-leader-follower games," Computational Management Science, Springer, vol. 2(1), pages 21-56, January.
CitationsCitations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
- repec:spr:mathme:v:86:y:2017:i:3:d:10.1007_s00186-017-0599-8 is not listed on IDEAS
- Axel Dreves, 2014. "Finding all solutions of affine generalized Nash equilibrium problems with one-dimensional strategy sets," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 80(2), pages 139-159, October.
- Giancarlo Bigi & Mauro Passacantando, 2016. "Gap functions for quasi-equilibria," Journal of Global Optimization, Springer, vol. 66(4), pages 791-810, December.
- repec:eee:ejores:v:266:y:2018:i:2:p:543-553 is not listed on IDEAS
- repec:spr:coopap:v:68:y:2017:i:3:d:10.1007_s10589-017-9927-4 is not listed on IDEAS
More about this item
KeywordsGeneralized Nash equilibrium problem; Jointly convex; Optimization reformulation; Continuity; PC 1 mapping; Semismoothness; Constant rank constraint qualification;
StatisticsAccess and download statistics
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:coopap:v:50:y:2011:i:1:p:23-48. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla) or (Rebekah McClure). General contact details of provider: http://www.springer.com .
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.