IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v47y2022i4p2891-2930.html
   My bibliography  Save this article

McKean–Vlasov Optimal Control: Limit Theory and Equivalence Between Different Formulations

Author

Listed:
  • Mao Fabrice Djete

    (Centre de Mathématiques Appliquées, École Polytechnique, 91120 Palaiseau, France)

  • Dylan Possamaï

    (Department of Mathematics, Eidgenössische Technische Hochschule Zürich, 8092 Zürich, Switzerland)

  • Xiaolu Tan

    (Department of Mathematics, The Chinese University of Hong Kong, Hong Kong)

Abstract

We study a McKean–Vlasov optimal control problem with common noise in order to establish the corresponding limit theory as well as the equivalence between different formulations, including strong, weak, and relaxed formulations. In contrast to the strong formulation, in which the problem is formulated on a fixed probability space equipped with two Brownian filtrations, the weak formulation is obtained by considering a more general probability space with two filtrations satisfying an ( H )-hypothesis type condition from the theory of enlargement of filtrations. When the common noise is uncontrolled, our relaxed formulation is obtained by considering a suitable controlled martingale problem. As for classic optimal control problems, we prove that the set of all relaxed controls is the closure of the set of all strong controls when considered as probability measures on the canonical space. Consequently, we obtain the equivalence of the different formulations of the control problem under additional mild regularity conditions on the reward functions. This is also a crucial technical step to prove the limit theory of the McKean–Vlasov control problem, that is, proving that it consists in the limit of a large population control problem with common noise.

Suggested Citation

  • Mao Fabrice Djete & Dylan Possamaï & Xiaolu Tan, 2022. "McKean–Vlasov Optimal Control: Limit Theory and Equivalence Between Different Formulations," Mathematics of Operations Research, INFORMS, vol. 47(4), pages 2891-2930, November.
  • Handle: RePEc:inm:ormoor:v:47:y:2022:i:4:p:2891-2930
    DOI: 10.1287/moor.2021.1232
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/moor.2021.1232
    Download Restriction: no

    File URL: https://libkey.io/10.1287/moor.2021.1232?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
    ---><---

    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:inm:ormoor:v:47:y:2022:i:4:p:2891-2930. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.