Prolonged Learning and Hasty Stopping: the Wald Problem with Ambiguity
This paper studies sequential information acquisition by an ambiguity-averse decision maker (DM), who decides how long to collect information before taking an irreversible action. The agent optimizes against the worst-case belief and updates prior by prior. We show that the consideration of ambiguity gives rise to rich dynamics: compared to the Bayesian DM, the DM here tends to experiment excessively when facing modest uncertainty and, to counteract it, may stop experimenting prematurely when facing high uncertainty. In the latter case, the DM's stopping rule is non-monotonic in beliefs and features randomized stopping.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Robust Exploratory Stopping under Ambiguity in Reinforcement Learning
We propose and analyze a continuous-time robust reinforcement learning framework for optimal stopping under ambiguity. In this framework, an agent chooses a robust exploratory stopping time motivated by two objectives: r…
Reinforcement LearningOptimal 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 …
Decision MakingOptimal Stopping under Model Ambiguity: a Time-Consistent Equilibrium Approach
An unconventional approach for optimal stopping under model ambiguity is introduced. Besides ambiguity itself, we take into account how ambiguity-averse an agent is. This inclusion of ambiguity attitude, via an $\alpha$-…
Decision MakingEarly Stopping for Nonparametric Testing
Early stopping of iterative algorithms is an algorithmic regularization method to avoid over-fitting in estimation and classification. In this paper, we show that early stopping can also be applied to obtain the minimax …
General ClassificationSpeed, Accuracy, and Complexity
This paper re-examines the use of response time to infer problem complexity. It revisits a canonical Wald model of optimal stopping, taking signal-to-noise ratio as a measure of problem complexity. While choice quality i…