IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v59y2014i1p85-112.html
   My bibliography  Save this article

Non-cooperative games with minmax objectives

Author

Listed:
  • Francisco Facchinei
  • Jong-Shi Pang
  • Gesualdo Scutari

Abstract

We consider noncooperative games where each player minimizes the sum of a smooth function, which depends on the player, and of a possibly nonsmooth function that is the same for all players. For this class of games we consider two approaches: one based on an augmented game that is applicable only to a minmax game and another one derived by a smoothing procedure that is applicable more broadly. In both cases, centralized and, most importantly, distributed algorithms for the computation of Nash equilibria can be derived. Copyright Springer Science+Business Media New York 2014

Suggested Citation

  • Francisco Facchinei & Jong-Shi Pang & Gesualdo Scutari, 2014. "Non-cooperative games with minmax objectives," Computational Optimization and Applications, Springer, vol. 59(1), pages 85-112, October.
    • Handle: RePEc:spr:coopap:v:59:y:2014:i:1:p:85-112
    DOI: 10.1007/s10589-014-9642-3
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10589-014-9642-3
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10589-014-9642-3?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Francisco Facchinei & Veronica Piccialli & Marco Sciandrone, 2011. "Decomposition algorithms for generalized potential games," Computational Optimization and Applications, Springer, vol. 50(2), pages 237-262, October.
    2. Steffan Berridge & Jacek Krawczyk, "undated". "Relaxation Algorithms in Finding Nash Equilibrium," Computing in Economics and Finance 1997 159, Society for Computational Economics.
    3. Krawczyk, Jacek B., 2005. "Coupled constraint Nash equilibria in environmental games," Resource and Energy Economics, Elsevier, vol. 27(2), pages 157-181, June.
    4. Masao Fukushima, 2011. "Restricted generalized Nash equilibria and controlled penalty algorithm," Computational Management Science, Springer, vol. 8(3), pages 201-218, August.
    5. Ankur A. Kulkarni & Uday V. Shanbhag, 2012. "Revisiting Generalized Nash Games and Variational Inequalities," Journal of Optimization Theory and Applications, Springer, vol. 154(1), pages 175-186, July.
    6. Koichi Nabetani & Paul Tseng & Masao Fukushima, 2011. "Parametrized variational inequality approaches to generalized Nash equilibrium problems with shared constraints," Computational Optimization and Applications, Springer, vol. 48(3), pages 423-452, April.
    7. Jong-Shi Pang & Masao Fukushima, 2009. "Quasi-variational inequalities, generalized Nash equilibria, and multi-leader-follower games," Computational Management Science, Springer, vol. 6(3), pages 373-375, August.
    8. K. Kubota & M. Fukushima, 2010. "Gap Function Approach to the Generalized Nash Equilibrium Problem," Journal of Optimization Theory and Applications, Springer, vol. 144(3), pages 511-531, March.
    9. Jean-Philippe Vial, 1983. "Strong and Weak Convexity of Sets and Functions," Mathematics of Operations Research, INFORMS, vol. 8(2), pages 231-259, May.
    10. Francisco Facchinei & Christian Kanzow, 2010. "Generalized Nash Equilibrium Problems," Annals of Operations Research, Springer, vol. 175(1), pages 177-211, March.
    11. VIAL, Jean-Philippe, 1983. "Strong and weak convexity of sets and functions," LIDAM Reprints CORE 529, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    12. 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.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ying Cui & Ziyu He & Jong-Shi Pang, 2021. "Nonconvex robust programming via value-function optimization," Computational Optimization and Applications, Springer, vol. 78(2), pages 411-450, March.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Han, Deren & Zhang, Hongchao & Qian, Gang & Xu, Lingling, 2012. "An improved two-step method for solving generalized Nash equilibrium problems," European Journal of Operational Research, Elsevier, vol. 216(3), pages 613-623.
    2. Alexey Izmailov & Mikhail Solodov, 2014. "On error bounds and Newton-type methods for generalized Nash equilibrium problems," Computational Optimization and Applications, Springer, vol. 59(1), pages 201-218, October.
    3. Axel Dreves, 2016. "Improved error bound and a hybrid method for generalized Nash equilibrium problems," Computational Optimization and Applications, Springer, vol. 65(2), pages 431-448, November.
    4. Axel Dreves & Francisco Facchinei & Andreas Fischer & Markus Herrich, 2014. "A new error bound result for Generalized Nash Equilibrium Problems and its algorithmic application," Computational Optimization and Applications, Springer, vol. 59(1), pages 63-84, October.
    5. Dane A. Schiro & Benjamin F. Hobbs & Jong-Shi Pang, 2016. "Perfectly competitive capacity expansion games with risk-averse participants," Computational Optimization and Applications, Springer, vol. 65(2), pages 511-539, November.
    6. Giancarlo Bigi & Mauro Passacantando, 2016. "Gap functions for quasi-equilibria," Journal of Global Optimization, Springer, vol. 66(4), pages 791-810, December.
    7. Jiawang Nie & Xindong Tang & Lingling Xu, 2021. "The Gauss–Seidel method for generalized Nash equilibrium problems of polynomials," Computational Optimization and Applications, Springer, vol. 78(2), pages 529-557, March.
    8. 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.
    9. Axel Dreves & Anna Heusinger & Christian Kanzow & Masao Fukushima, 2013. "A globalized Newton method for the computation of normalized Nash equilibria," Journal of Global Optimization, Springer, vol. 56(2), pages 327-340, June.
    10. J. Contreras & J. B. Krawczyk & J. Zuccollo, 2016. "Economics of collective monitoring: a study of environmentally constrained electricity generators," Computational Management Science, Springer, vol. 13(3), pages 349-369, July.
    11. Migot, Tangi & Cojocaru, Monica-G., 2020. "A parametrized variational inequality approach to track the solution set of a generalized nash equilibrium problem," European Journal of Operational Research, Elsevier, vol. 283(3), pages 1136-1147.
    12. Simone Sagratella, 2017. "Algorithms for generalized potential games with mixed-integer variables," Computational Optimization and Applications, Springer, vol. 68(3), pages 689-717, December.
    13. Shipra Singh & Aviv Gibali & Simeon Reich, 2021. "Multi-Time Generalized Nash Equilibria with Dynamic Flow Applications," Mathematics, MDPI, vol. 9(14), pages 1-23, July.
    14. K. Kubota & M. Fukushima, 2010. "Gap Function Approach to the Generalized Nash Equilibrium Problem," Journal of Optimization Theory and Applications, Springer, vol. 144(3), pages 511-531, March.
    15. Sreekumaran, Harikrishnan & Hota, Ashish R. & Liu, Andrew L. & Uhan, Nelson A. & Sundaram, Shreyas, 2021. "Equilibrium strategies for multiple interdictors on a common network," European Journal of Operational Research, Elsevier, vol. 288(2), pages 523-538.
    16. Flam, Sjur & Ruszczynski, A., 2006. "Computing Normalized Equilibria in Convex-Concave Games," Working Papers 2006:9, Lund University, Department of Economics.
    17. Nadja Harms & Tim Hoheisel & Christian Kanzow, 2015. "On a Smooth Dual Gap Function for a Class of Player Convex Generalized Nash Equilibrium Problems," Journal of Optimization Theory and Applications, Springer, vol. 166(2), pages 659-685, August.
    18. Contreras, Javier & Krawczyk, Jacek & Zuccollo, James, 2008. "The invisible polluter: Can regulators save consumer surplus?," MPRA Paper 9890, University Library of Munich, Germany.
    19. Contreras, Javier & Krawczyk, Jacek & Zuccollo, James, 2008. "Can planners control competitive generators?," MPRA Paper 10395, University Library of Munich, Germany.
    20. Vladimir Shikhman, 2022. "On local uniqueness of normalized Nash equilibria," Papers 2205.13878, arXiv.org.

    Corrections

    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:59:y:2014:i:1:p:85-112. See general information about how to correct material in RePEc.

    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 CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.