Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
149 tokens/sec
GPT-4o
9 tokens/sec
Gemini 2.5 Pro Pro
47 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 Consistent Stopping For The Mean-Standard Deviation Problem --- The Discrete Time Case (1802.08358v2)

Published 23 Feb 2018 in q-fin.MF, math.OC, math.PR, and q-fin.EC

Abstract: Inspired by Strotz's consistent planning strategy, we formulate the infinite horizon mean-variance stopping problem as a subgame perfect Nash equilibrium in order to determine time consistent strategies with no regret. Equilibria among stopping times or randomized stopping times may not exist. This motivates us to consider the notion of liquidation strategies, which lets the stopping right to be divisible. We then argue that the mean-standard deviation variant of this problem makes more sense for this type of strategies in terms of time consistency. It turns out that an equilibrium liquidation strategy always exists. We then analyze whether optimal equilibrium liquidation strategies exist and whether they are unique and observe that neither may hold.

Summary

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