IDEAS home Printed from https://ideas.repec.org/a/bla/mathfi/v33y2023i4p1248-1286.html
   My bibliography  Save this article

Predictable forward performance processes: Infrequent evaluation and applications to human‐machine interactions

Author

Listed:
  • Gechun Liang
  • Moris S. Strub
  • Yuwei Wang

Abstract

We study discrete‐time predictable forward processes when trading times do not coincide with performance evaluation times in a binomial tree model for the financial market. The key step in the construction of these processes is to solve a linear functional equation of higher order associated with the inverse problem driving the evolution of the predictable forward process. We provide sufficient conditions for the existence and uniqueness and an explicit construction of the predictable forward process under these conditions. Furthermore, we find that these processes are inherently myopic in the sense that optimal strategies do not make use of future model parameters even if these are known. Finally, we argue that predictable forward preferences are a viable framework to model human‐machine interactions occurring in automated trading or robo‐advising. For both applications, we determine an optimal interaction schedule of a human agent interacting infrequently with a machine that is in charge of trading.

Suggested Citation

  • Gechun Liang & Moris S. Strub & Yuwei Wang, 2023. "Predictable forward performance processes: Infrequent evaluation and applications to human‐machine interactions," Mathematical Finance, Wiley Blackwell, vol. 33(4), pages 1248-1286, October.
    • Handle: RePEc:bla:mathfi:v:33:y:2023:i:4:p:1248-1286
    DOI: 10.1111/mafi.12408
    as

    Download full text from publisher

    File URL: https://doi.org/10.1111/mafi.12408
    Download Restriction: no
    File URL: https://libkey.io/10.1111/mafi.12408?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
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:bla:mathfi:v:33:y:2023:i:4:p:1248-1286. 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: Wiley Content Delivery (email available below). General contact details of provider: http://www.blackwellpublishing.com/journal.asp?ref=0960-1627 .

    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.