Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
139 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Time-inconsistent mean-field optimal stopping: A limit approach (2209.04174v3)

Published 9 Sep 2022 in math.PR and math.OC

Abstract: We provide a characterization of an optimal stopping time for a class of finite horizon time-inconsistent optimal stopping problems (OSPs) of mean-field type, adapted to the Brownian filtration, including those related to mean-field diffusion processes and recursive utility functions. Despite the time-inconsistency of the OSP, we show that it is optimal to stop when the value-process hits the reward process for the first time, as is the case for the standard time-consistent OSP. We solve the problem by approximating the corresponding value-process with a sequence of Snell envelopes of processes, for which a sequence of optimal stopping times is constituted of the hitting times of each of the reward processes by the associated value-process. Then, under mild assumptions, we show that this sequence of hitting times converges in probability to the hitting time for the mean-field OSP and that the limit is optimal.

Summary

We haven't generated a summary for this paper yet.