Predictable Forward Performance Processes: Infrequent Evaluation and Applications to Human-Machine Interactions

17 Oct 2021  ·  Gechun Liang, Moris S. Strub, Yuwei Wang ·

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

PDF Abstract
No code implementations yet. Submit your code now

Tasks


Datasets


  Add Datasets introduced or used in this paper

Results from the Paper


  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.

Methods


No methods listed for this paper. Add relevant methods here