IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v78y2021i3d10.1007_s10589-020-00257-0.html
   My bibliography  Save this article

Decomposition Algorithms for Some Deterministic and Two-Stage Stochastic Single-Leader Multi-Follower Games

Author

Listed:
  • Pedro Borges

    (Instituto de Matemática Pura e Aplicada)

  • Claudia Sagastizábal

    (IMECC/UNICAMP)

  • Mikhail Solodov

    (Instituto de Matemática Pura e Aplicada)

Abstract

We consider a certain class of hierarchical decision problems that can be viewed as single-leader multi-follower games, and be represented by a virtual market coordinator trying to set a price system for traded goods, according to some criterion that balances supply and demand. The objective function of the market coordinator involves the decisions of many agents, which are taken independently by solving convex optimization problems that depend on the price configuration and on realizations of future states of the economy. One traditional way of solving this problem is via a mixed complementarity formulation. However, this approach can become impractical when the numbers of agents and/or scenarios become large. This work concerns agent-wise and scenario-wise decomposition algorithms to solve the equilibrium problems in question, assuming that the solutions of the agents’ problems are unique, which is natural in many applications (when solutions are not unique, the approximating problems are still well-defined, but the convergence properties of the algorithm are not established). The algorithm is based on a previous work of the authors, where a suitable regularization of solution mappings of fully parameterized convex problems is developed. Here, we show one specific strategy to manage the regularization parameter, extend some theoretical results to the current setting, and prove that the smooth approximations of the market coordinator’s problem converge epigraphically to the original problem. Numerical experiments and some comparisons with the complementarity solver PATH are shown for the two-stage stochastic Walrasian equilibrium problem.

Suggested Citation

  • Pedro Borges & Claudia Sagastizábal & Mikhail Solodov, 2021. "Decomposition Algorithms for Some Deterministic and Two-Stage Stochastic Single-Leader Multi-Follower Games," Computational Optimization and Applications, Springer, vol. 78(3), pages 675-704, April.
  • Handle: RePEc:spr:coopap:v:78:y:2021:i:3:d:10.1007_s10589-020-00257-0
    DOI: 10.1007/s10589-020-00257-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10589-020-00257-0
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10589-020-00257-0?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. Mengwei Xu & Soon-Yi Wu & Jane Ye, 2014. "Solving semi-infinite programs by smoothing projected gradient method," Computational Optimization and Applications, Springer, vol. 59(3), pages 591-616, December.
    2. William Chung & J. David Fuller, 2010. "Subproblem Approximation in Dantzig-Wolfe Decomposition of Variational Inequality Models with an Application to a Multicommodity Economic Equilibrium Model," Operations Research, INFORMS, vol. 58(5), pages 1318-1327, October.
    3. 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.
    4. 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.
    5. L. M. Graña Drummond & B. F. Svaiter, 1999. "On Well Definedness of the Central Path," Journal of Optimization Theory and Applications, Springer, vol. 102(2), pages 223-237, August.
    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. Julio Deride & Roger J-B Wets, 2023. "Solving equilibrium problems in economies with financial markets, home production, and retention," Papers 2308.05849, arXiv.org.

    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. 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.
    2. María J. Cánovas & Marco A. López & Juan Parra & F. Javier Toledo, 2006. "Lipschitz Continuity of the Optimal Value via Bounds on the Optimal Set in Linear Semi-Infinite Optimization," Mathematics of Operations Research, INFORMS, vol. 31(3), pages 478-489, August.
    3. 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.
    4. 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.
    5. Simone Sagratella, 2017. "Algorithms for generalized potential games with mixed-integer variables," Computational Optimization and Applications, Springer, vol. 68(3), pages 689-717, December.
    6. Kukushkin, Nikolai S., 2015. "Cournot tatonnement and potentials," Journal of Mathematical Economics, Elsevier, vol. 59(C), pages 117-127.
    7. Le Cadre, Hélène & Mou, Yuting & Höschle, Hanspeter, 2022. "Parametrized Inexact-ADMM based coordination games: A normalized Nash equilibrium approach," European Journal of Operational Research, Elsevier, vol. 296(2), pages 696-716.
    8. M. Paul Laiu & André L. Tits, 2019. "A constraint-reduced MPC algorithm for convex quadratic programming, with a modified active set identification scheme," Computational Optimization and Applications, Springer, vol. 72(3), pages 727-768, April.
    9. Mathew P. Abraham & Ankur A. Kulkarni, 2018. "An Approach Based on Generalized Nash Games and Shared Constraints for Discrete Time Dynamic Games," Dynamic Games and Applications, Springer, vol. 8(4), pages 641-670, December.
    10. Luo, Fengqiao & Mehrotra, Sanjay, 2019. "Decomposition algorithm for distributionally robust optimization using Wasserstein metric with an application to a class of regression models," European Journal of Operational Research, Elsevier, vol. 278(1), pages 20-35.
    11. Zheng Peng & Wenxing Zhu, 2013. "An Alternating Direction Method for Nash Equilibrium of Two-Person Games with Alternating Offers," Journal of Optimization Theory and Applications, Springer, vol. 157(2), pages 533-551, May.
    12. Lampariello, Lorenzo & Neumann, Christoph & Ricci, Jacopo M. & Sagratella, Simone & Stein, Oliver, 2021. "Equilibrium selection for multi-portfolio optimization," European Journal of Operational Research, Elsevier, vol. 295(1), pages 363-373.
    13. Hélène Le Cadre & Yuting Mou & Hanspeter Höschle, 2020. "Parametrized Inexact-ADMM to Span the Set of Generalized Nash Equilibria: A Normalized Equilibrium Approach," Working Papers hal-02925005, HAL.
    14. 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.
    15. Giancarlo Bigi & Mauro Passacantando, 2016. "Gap functions for quasi-equilibria," Journal of Global Optimization, Springer, vol. 66(4), pages 791-810, December.
    16. Li-Ping Pang & Jian Lv & Jin-He Wang, 2016. "Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems," Computational Optimization and Applications, Springer, vol. 64(2), pages 433-465, June.
    17. Stefan Schwarze & Oliver Stein, 2023. "A branch-and-prune algorithm for discrete Nash equilibrium problems," Computational Optimization and Applications, Springer, vol. 86(2), pages 491-519, November.
    18. Jinlong Lei & Uday V. Shanbhag, 2020. "Asynchronous Schemes for Stochastic and Misspecified Potential Games and Nonconvex Optimization," Operations Research, INFORMS, vol. 68(6), pages 1742-1766, November.
    19. Juan Pablo Luna & Claudia Sagastizábal & Mikhail Solodov, 2020. "A class of Benders decomposition methods for variational inequalities," Computational Optimization and Applications, Springer, vol. 76(3), pages 935-959, July.
    20. 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.

    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:78:y:2021:i:3:d:10.1007_s10589-020-00257-0. 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.