IDEAS home Printed from https://ideas.repec.org/p/sef/csefwp/541.html
   My bibliography  Save this paper

Regularization and Approximation Methods in Stackelberg Games and Bilevel Optimization

Author

Listed:

Abstract

In a two-stage Stackelberg game, depending on the leader's information about the choice of the follower among his optimal responses, one can associate different types of mathematical problems. We present formulations and solution concepts for such problems, together with their possible connections in bilevel optimization, and we illustrate the crucial issues concerning these solution concepts. Then, we discuss which of these issues can be positively or negatively answered and how managing the latter ones by means of two widely used approaches: regularizing the set of optimal responses of the follower, via different types of approximate solutions, or regularizing the follower's payoff function, via the Tikhonov or the proximal regularizations. The first approach allows to obviate the lack of existence and/or stability through approximating problems, whose solutions exist under not restrictive conditions and enable to construct a surrogate solution to the original problem. The second approach permits to overcome the non-uniqueness of the follower's optimal response, by constructing sequences of Stackelberg games with a unique second-stage solution which approximate in some sense the original game, and to select among the solutions by using a constructive method with behavioural motivations.

Suggested Citation

  • Francesco Caruso & M. Beatrice Lignola & Jacqueline Morgan, 2019. "Regularization and Approximation Methods in Stackelberg Games and Bilevel Optimization," CSEF Working Papers 541, Centre for Studies in Economics and Finance (CSEF), University of Naples, Italy.
    • Handle: RePEc:sef:csefwp:541
    as

    Download full text from publisher

    File URL: http://www.csef.it/WP/wp541.pdf
    Download Restriction: no

    References listed on IDEAS

    as
    1. John C. Harsanyi & Reinhard Selten, 1988. "A General Theory of Equilibrium Selection in Games," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262582384.
    2. Francesco Caruso & Maria Carmela Ceparano & Jacqueline Morgan, 2019. "Subgame Perfect Nash Equilibrium: A Learning Approach via Costs to Move," Dynamic Games and Applications, Springer, vol. 9(2), pages 416-432, June.
    3. Alain Haurie & Jacek B Krawczyk & Georges Zaccour, 2012. "Games and Dynamic Games," World Scientific Books, World Scientific Publishing Co. Pte. Ltd., number 8442, November.
    4. H. Bonnel & J. Morgan, 2006. "Semivectorial Bilevel Optimization Problem: Penalty Approach," Journal of Optimization Theory and Applications, Springer, vol. 131(3), pages 365-382, December.
    5. M. Lignola & Jacqueline Morgan, 2012. "Approximate values for mathematical programs with variational inequality constraints," Computational Optimization and Applications, Springer, vol. 53(2), pages 485-503, October.
    6. Maria Carmela Ceparano & Jacqueline Morgan, 2017. "Equilibrium selection in multi-leader-follower games with vertical information," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 25(3), pages 526-543, October.
    7. Laurent Drouet & Alain Haurie & Francesco Moresino & Jean-Philippe Vial & Marc Vielle & Laurent Viguier, 2008. "An oracle based method to compute a coupled equilibrium in a model of international climate policy," Computational Management Science, Springer, vol. 5(1), pages 119-140, February.
    8. Dockner,Engelbert J. & Jorgensen,Steffen & Long,Ngo Van & Sorger,Gerhard, 2000. "Differential Games in Economics and Management Science," Cambridge Books, Cambridge University Press, number 9780521637329.
    9. Jacqueline Morgan, 2005. "Approximations and Well-Posedness in Multicriteria Games," Annals of Operations Research, Springer, vol. 137(1), pages 257-268, July.
    10. Jonathan F. Bard, 1983. "An Algorithm for Solving the General Bilevel Programming Problem," Mathematics of Operations Research, INFORMS, vol. 8(2), pages 260-272, May.
    Full references (including those not matched with items on IDEAS)

    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:sef:csefwp:541. 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: (Lia Ambrosio). General contact details of provider: http://edirc.repec.org/data/cssalit.html .

    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 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.