Optimal stopping and divestment timing under scenario ambiguity and learning
Aiming to analyze the impact of environmental transition on the value of assets and on asset stranding, we study optimal stopping and divestment timing decisions for an economic agent whose future revenues depend on the realization of a scenario from a given set of possible futures. Since the future scenario is unknown and the probabilities of individual prospective scenarios are ambiguous, we adopt the smooth model of decision making under ambiguity aversion of Klibanoff et al (2005), framing the optimal divestment decision as an optimal stopping problem with learning under ambiguity aversion. We then prove a minimax result reducing this problem to a series of standard optimal stopping problems with learning. The theory is illustrated with two examples: the problem of optimally selling a stock with ambiguous drift, and the problem of optimal divestment from a coal-fired power plant under transition scenario ambiguity.
Code (0)
등록된 구현이 없습니다.
Tasks
Decision MakingMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Optimal Entry and Exit with Signature in Statistical Arbitrage
In this paper, we explore an optimal timing strategy for the trading of price spreads exhibiting mean-reverting characteristics. A sequential optimal stopping framework is formulated to analyze the optimal timings for bo…
Optimal Multiple Trading Times Under the Exponential OU Model with Transaction Costs
This paper studies the timing of trades under mean-reverting price dynamics subject to fixed transaction costs. We solve an optimal double stopping problem to determine the optimal times to enter and subsequently exit th…
LLM-OSDA: An Optimal-Stopping Dynamic Auction for Native Advertising in Multi-Turn LLM Conversations
LLM-native advertising embeds sponsored content directly into model-generated responses, shifting the unit of sale from a fixed slot to a moment within an evolving conversation. Existing LLM ad-auction mechanisms primari…
Continuous-time Optimal Stopping through Deep Reinforcement Learning
Simulation based solvers for optimal stopping problems must discretize the stopping decision. Under classical dynamic programming, a coarse exercise grid with only a few stopping opportunities can materially undervalue t…
Computational EfficiencyReinforcement LearningOptimal Mean-Reverting Spread Trading: Nonlinear Integral Equation Approach
We study several optimal stopping problems that arise from trading a mean-reverting price spread over a finite horizon. Modeling the spread by the Ornstein-Uhlenbeck process, we analyze three different trading strategies…
Position