IDEAS home Printed from https://ideas.repec.org/a/kap/compec/v53y2019i2d10.1007_s10614-017-9757-6.html
   My bibliography  Save this article

A Numerical Algorithm for the Coupled PDEs Control Problem

Author

Listed:
  • Gonglin Yuan

    (Guangxi University)

  • Xiangrong Li

    (Guangxi University)

Abstract

For the coupled PDE control problem, at time $$t_i$$ t i with the ith point, the standard algorithm will first obtain the two space variables $$(z_i,v_i)$$ ( z i , v i ) and then obtain the control variables $$(\varsigma _i^{opt},\mu _i^{opt})$$ ( ς i o p t , μ i o p t ) from the given initial points $$(\varsigma _i^0,\mu _i^0)$$ ( ς i 0 , μ i 0 ) . How many points i are determined by the facts of the case? We usually believe that the largest i defined by n is big because the small step size $$\tau =\frac{T-t_0}{n}$$ τ = T - t 0 n will generate a good approximation, where T denotes the terminal time. Thus, the solution process is very tedious, and much CPU time is required. In this paper, we present a new method to overcome this drawback. This presented method, which fully utilizes the first-order conditions, simultaneously considers the two space variables $$(z_i,v_i)$$ ( z i , v i ) and the control variables $$(\varsigma _i^{opt},\mu _i^{opt})$$ ( ς i o p t , μ i o p t ) with $$t_i$$ t i at i. The computational complexity of the new algorithm is $$O(N^3)$$ O ( N 3 ) , whereas that of the normal algorithm is $$O(N^3+N^3K)$$ O ( N 3 + N 3 K ) . The performance of the proposed algorithm is tested using an example.

Suggested Citation

  • Gonglin Yuan & Xiangrong Li, 2019. "A Numerical Algorithm for the Coupled PDEs Control Problem," Computational Economics, Springer;Society for Computational Economics, vol. 53(2), pages 697-707, February.
  • Handle: RePEc:kap:compec:v:53:y:2019:i:2:d:10.1007_s10614-017-9757-6
    DOI: 10.1007/s10614-017-9757-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10614-017-9757-6
    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/s10614-017-9757-6?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. SORIN, Sylvain, 1984. "'Big match' with lack of information on one side (part 1)," LIDAM Reprints CORE 601, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    2. Rida Laraki, 2002. "Repeated Games with Lack of Information on One Side: The Dual Differential Approach," Mathematics of Operations Research, INFORMS, vol. 27(2), pages 419-440, May.
    3. Truman Bewley & Elon Kohlberg, 1976. "The Asymptotic Theory of Stochastic Games," Mathematics of Operations Research, INFORMS, vol. 1(3), pages 197-208, August.
    4. Truman Bewley & Elon Kohlberg, 1976. "The Asymptotic Solution of a Recursion Equation Occurring in Stochastic Games," Mathematics of Operations Research, INFORMS, vol. 1(4), pages 321-336, November.
    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. Peng Li, 2021. "The Valuation of Weather Derivatives Using One Sided Crank–Nicolson Schemes," Computational Economics, Springer;Society for Computational Economics, vol. 58(3), pages 825-847, October.

    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. Laraki, Rida & Sorin, Sylvain, 2015. "Advances in Zero-Sum Dynamic Games," Handbook of Game Theory with Economic Applications,, Elsevier.
    2. Jérôme Bolte & Stéphane Gaubert & Guillaume Vigeral, 2015. "Definable Zero-Sum Stochastic Games," Mathematics of Operations Research, INFORMS, vol. 40(1), pages 171-191, February.
    3. Xiaoxi Li & Xavier Venel, 2016. "Recursive games: Uniform value, Tauberian theorem and the Mertens conjecture " M axmin = lim v n = lim v λ "," PSE-Ecole d'économie de Paris (Postprint) hal-01302553, HAL.
    4. Xiaoxi Li & Xavier Venel, 2016. "Recursive games: Uniform value, Tauberian theorem and the Mertens conjecture " M axmin = lim v n = lim v λ "," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) hal-01302553, HAL.
    5. repec:dau:papers:123456789/10880 is not listed on IDEAS
    6. Guillaume Vigeral, 2013. "A Zero-Sum Stochastic Game with Compact Action Sets and no Asymptotic Value," Dynamic Games and Applications, Springer, vol. 3(2), pages 172-186, June.
    7. Xiaoxi Li & Xavier Venel, 2016. "Recursive games: Uniform value, Tauberian theorem and the Mertens conjecture " M axmin = lim v n = lim v λ "," Post-Print hal-01302553, HAL.
    8. Eilon Solan, 2005. "Subgame-Perfection in Quitting Games with Perfect Information and Differential Equations," Mathematics of Operations Research, INFORMS, vol. 30(1), pages 51-72, February.
    9. Sugaya, Takuo & Yamamoto, Yuichi, 2020. "Common learning and cooperation in repeated games," Theoretical Economics, Econometric Society, vol. 15(3), July.
    10. Johannes Horner & Takuo Sugaya & Satoru Takahashi & Nicolas Vieille, 2009. "Recursive Methods in Discounted Stochastic Games: An Algorithm for delta Approaching 1 and a Folk Theorem," Cowles Foundation Discussion Papers 1742, Cowles Foundation for Research in Economics, Yale University, revised Aug 2010.
    11. Levy, Yehuda, 2012. "Stochastic games with information lag," Games and Economic Behavior, Elsevier, vol. 74(1), pages 243-256.
    12. Dmitry Khlopin, 2018. "Tauberian Theorem for Value Functions," Dynamic Games and Applications, Springer, vol. 8(2), pages 401-422, June.
    13. Rida Laraki, 2010. "Explicit formulas for repeated games with absorbing states," International Journal of Game Theory, Springer;Game Theory Society, vol. 39(1), pages 53-69, March.
    14. Abraham Neyman, 2013. "Stochastic Games with Short-Stage Duration," Dynamic Games and Applications, Springer, vol. 3(2), pages 236-278, June.
    15. Fabien Gensbittel & Marcin Peski & Jérôme Renault, 2021. "Value-Based Distance Between Information Structures," Working Papers hal-01869139, HAL.
    16. Fudenberg, Drew & Yamamoto, Yuichi, 2011. "Learning from private information in noisy repeated games," Journal of Economic Theory, Elsevier, vol. 146(5), pages 1733-1769, September.
    17. Jérôme Renault & Xavier Venel, 2017. "Long-Term Values in Markov Decision Processes and Repeated Games, and a New Distance for Probability Spaces," Mathematics of Operations Research, INFORMS, vol. 42(2), pages 349-376, May.
    18. Vieille, Nicolas, 2002. "Stochastic games: Recent results," Handbook of Game Theory with Economic Applications, in: R.J. Aumann & S. Hart (ed.), Handbook of Game Theory with Economic Applications, edition 1, volume 3, chapter 48, pages 1833-1850, Elsevier.
    19. Eilon Solan, 2018. "The modified stochastic game," International Journal of Game Theory, Springer;Game Theory Society, vol. 47(4), pages 1287-1327, November.
    20. Joseph M. Abdou & Nikolaos Pnevmatikos, 2019. "Asymptotic Value in Frequency-Dependent Games with Separable Payoffs: A Differential Approach," Dynamic Games and Applications, Springer, vol. 9(2), pages 295-313, June.
    21. Hörner, Johannes & Takahashi, Satoru, 2016. "How fast do equilibrium payoff sets converge in repeated games?," Journal of Economic Theory, Elsevier, vol. 165(C), pages 332-359.

    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:kap:compec:v:53:y:2019:i:2:d:10.1007_s10614-017-9757-6. 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.