Optimal stopping in a continuous search model

1986 ◽  
Vol 23 (2) ◽  
pp. 514-518 ◽  
Author(s):  
Dror Zuckerman
Keyword(s):  
Optimal Stopping ◽  
Renewal Process ◽  
Control Level ◽  
Market Price ◽  
Stopping Time ◽  
Control Limit ◽  
Interarrival Time ◽  
Search Model ◽  
Job Offers ◽  
Constant Cost

We examine a continuous search model in which rewards (e.g. job offers in a search model in the labor market, price offers for a given asset, etc.) are received randomly according to a renewal process determined by a known distribution function. The rewards are non-negative independent and have a common distribution with finite mean. Over the search period there is a constant cost per unit time. The searcher's objective is to choose a stopping time at which he receives the highest available reward (offer), so as to maximize the net expected discounted return. If the interarrival time distribution in the renewal process is new better than used (NBU), it is shown that the optimal stopping strategy possesses the control limit property. The term ‘control limit policy' refers to a strategy in which we accept the first reward (offer) which exceeds a critical control level ξ.

Optimal stopping in a continuous search model

1986 ◽  
Vol 23 (02) ◽  
pp. 514-518 ◽  
Author(s):  
Dror Zuckerman
Keyword(s):  
Optimal Stopping ◽  
Renewal Process ◽  
Control Level ◽  
Market Price ◽  
Stopping Time ◽  
Control Limit ◽  
Interarrival Time ◽  
Search Model ◽  
Job Offers ◽  
Constant Cost

We examine a continuous search model in which rewards (e.g. job offers in a search model in the labor market, price offers for a given asset, etc.) are received randomly according to a renewal process determined by a known distribution function. The rewards are non-negative independent and have a common distribution with finite mean. Over the search period there is a constant cost per unit time. The searcher's objective is to choose a stopping time at which he receives the highest available reward (offer), so as to maximize the net expected discounted return. If the interarrival time distribution in the renewal process is new better than used (NBU), it is shown that the optimal stopping strategy possesses the control limit property. The term ‘control limit policy' refers to a strategy in which we accept the first reward (offer) which exceeds a critical control level ξ.

Optimal R&D programs in a random environment

1990 ◽  
Vol 27 (2) ◽  
pp. 343-350 ◽  
Author(s):  
M. J. M. Posner ◽  
D. Zuckerman
Keyword(s):  
Random Environment ◽  
Optimal Stopping ◽  
Development Time ◽  
Research Effort ◽  
Stopping Time ◽  
Control Limit ◽  
Decision Variable ◽  
Classical Approach ◽  
Termination Time ◽  
D Model

Our study examines a stochastic R&D model with flexible termination time and without rivalry. Specifically, we assume a stochastic relationship between expenditures rate and the project's status. Furthermore, the termination time of the project is incorporated into the R&D model as a decision variable by allowing the controller to ‘sell' the obtained technology from the project at any point of time. The proposed framework extends the classical approach in the R&D literature.The main purpose of our study is to determine the optimal stopping time of the project and to characterize qualitatively the firm's expenditure strategy. We show that under certain realistic conditions, the optimal stopping strategy is a control limit policy. Furthermore, the research effort increases monotonically over the development time of the project.

scholarly journals ACCELERATED SHARE REPURCHASE: PRICING AND EXECUTION STRATEGY

2015 ◽  
Vol 18 (03) ◽  
pp. 1550019 ◽  
Author(s):  
OLIVIER GUÉANT ◽  
JIANG PU ◽  
GUILLAUME ROYER
Keyword(s):  
Numerical Methods ◽  
Option Pricing ◽  
Optimal Stopping ◽  
Market Price ◽  
Stopping Time ◽  
Share Repurchase ◽  
Optimal Execution ◽  
Execution Strategy ◽  
Bermudan Options ◽  
Optimal Execution Problem

In this paper, we consider the optimal execution problem associated to accelerated share repurchase (ASR) contracts. When firms want to repurchase their own shares, they often enter such a contract with a bank. The bank buys the shares for the firm and is paid the average market price over the execution period, the length of the period being decided upon by the bank during the buying process. Mathematically, the problem is new and related to both option pricing (Asian and Bermudan options) and optimal execution. We provide a model, along with associated numerical methods, to determine the optimal stopping time and the optimal buying strategy of the bank.

Optimal R&D programs in a random environment

1990 ◽  
Vol 27 (02) ◽  
pp. 343-350 ◽  
Author(s):  
M. J. M. Posner ◽  
D. Zuckerman
Keyword(s):  
Random Environment ◽  
Optimal Stopping ◽  
Development Time ◽  
Research Effort ◽  
Stopping Time ◽  
Control Limit ◽  
Decision Variable ◽  
Classical Approach ◽  
Termination Time ◽  
D Model

Our study examines a stochastic R&D model with flexible termination time and without rivalry. Specifically, we assume a stochastic relationship between expenditures rate and the project's status. Furthermore, the termination time of the project is incorporated into the R&D model as a decision variable by allowing the controller to ‘sell' the obtained technology from the project at any point of time. The proposed framework extends the classical approach in the R&D literature. The main purpose of our study is to determine the optimal stopping time of the project and to characterize qualitatively the firm's expenditure strategy. We show that under certain realistic conditions, the optimal stopping strategy is a control limit policy. Furthermore, the research effort increases monotonically over the development time of the project.

Optimal Stopping Time for Geometric Random Walks with Power Payoff Function

2020 ◽  
Vol 81 (7) ◽  
pp. 1192-1210
Author(s):  
O.V. Zverev ◽  
V.M. Khametov ◽  
E.A. Shelemekh
Keyword(s):  
Random Walks ◽  
Optimal Stopping ◽  
Stopping Time ◽  
Payoff Function ◽  
Optimal Stopping Time

On wald-type optimal stopping for Brownian motion

1997 ◽  
Vol 34 (1) ◽  
pp. 66-73 ◽  
Author(s):  
S. E. Graversen ◽  
G. Peškir
Keyword(s):  
Brownian Motion ◽  
Optimal Stopping ◽  
Stopping Time ◽  
Maximal Inequality ◽  
Stopping Times ◽  
Standard Brownian Motion ◽  
Square Root ◽  
Real Analysis ◽  
Optimal Stopping Problems ◽  
Wald's Identity

The solution is presented to all optimal stopping problems of the form supτE(G(|Β τ |) – cτ), where is standard Brownian motion and the supremum is taken over all stopping times τ for B with finite expectation, while the map G : ℝ+ → ℝ satisfies for some being given and fixed. The optimal stopping time is shown to be the hitting time by the reflecting Brownian motion of the set of all (approximate) maximum points of the map . The method of proof relies upon Wald's identity for Brownian motion and simple real analysis arguments. A simple proof of the Dubins–Jacka–Schwarz–Shepp–Shiryaev (square root of two) maximal inequality for randomly stopped Brownian motion is given as an application.

Optimal stopping and maximal inequalities for geometric Brownian motion

1998 ◽  
Vol 35 (04) ◽  
pp. 856-872 ◽  
Author(s):  
S. E. Graversen ◽  
G. Peskir
Keyword(s):  
Differential Equation ◽  
Brownian Motion ◽  
Optimal Stopping ◽  
Moving Boundary ◽  
Stopping Time ◽  
Practical Interest ◽  
Maximal Inequality ◽  
Geometric Brownian Motion ◽  
Stopping Times ◽  
Image Position

Explicit formulas are found for the payoff and the optimal stopping strategy of the optimal stopping problem supτ E (max0≤t≤τ X t − c τ), where X = (X t ) t≥0 is geometric Brownian motion with drift μ and volatility σ > 0, and the supremum is taken over all stopping times for X. The payoff is shown to be finite, if and only if μ < 0. The optimal stopping time is given by τ* = inf {t > 0 | X t = g * (max0≤t≤s X s )} where s ↦ g *(s) is the maximal solution of the (nonlinear) differential equation under the condition 0 < g(s) < s, where Δ = 1 − 2μ / σ2 and K = Δ σ2 / 2c. The estimate is established g *(s) ∼ ((Δ − 1) / K Δ)1 / Δ s 1−1/Δ as s → ∞. Applying these results we prove the following maximal inequality: where τ may be any stopping time for X. This extends the well-known identity E (sup t>0 X t ) = 1 − (σ 2 / 2 μ) and is shown to be sharp. The method of proof relies upon a smooth pasting guess (for the Stephan problem with moving boundary) and the Itô–Tanaka formula (being applied two-dimensionally). The key point and main novelty in our approach is the maximality principle for the moving boundary (the optimal stopping boundary is the maximal solution of the differential equation obtained by a smooth pasting guess). We think that this principle is by itself of theoretical and practical interest.

scholarly journals Predicting the Supremum: Optimality of ‘Stop at Once or Not at All’

2012 ◽  
Vol 49 (3) ◽  
pp. 806-820
Author(s):  
Pieter C. Allaart
Keyword(s):  
Optimal Stopping ◽  
Continuous Time ◽  
Analogous Result ◽  
Stopping Time ◽  
Stable Processes ◽  
Finite Variation ◽  
Lévy Measure ◽  
One Dimensional ◽  
Stationary Increments ◽  
Reverse Relationship

Let (Xt)0 ≤ t ≤ T be a one-dimensional stochastic process with independent and stationary increments, either in discrete or continuous time. In this paper we consider the problem of stopping the process (Xt) ‘as close as possible’ to its eventual supremum MT := sup0 ≤ t ≤ TXt, when the reward for stopping at time τ ≤ T is a nonincreasing convex function of MT - Xτ. Under fairly general conditions on the process (Xt), it is shown that the optimal stopping time τ takes a trivial form: it is either optimal to stop at time 0 or at time T. For the case of a random walk, the rule τ ≡ T is optimal if the steps of the walk stochastically dominate their opposites, and the rule τ ≡ 0 is optimal if the reverse relationship holds. An analogous result is proved for Lévy processes with finite Lévy measure. The result is then extended to some processes with nonfinite Lévy measure, including stable processes, CGMY processes, and processes whose jump component is of finite variation.

scholarly journals A Forward Algorithm for Solving Optimal Stopping Problems

2006 ◽  
Vol 43 (01) ◽  
pp. 102-113
Author(s):  
Albrecht Irle
Keyword(s):  
State Space ◽  
Optimal Stopping ◽  
Stopping Time ◽  
The State ◽  
Optimal Stopping Problem ◽  
Forward Algorithm ◽  
Optimal Stopping Time ◽  
Entrance Time ◽  
Markov Sequence ◽  
Optimal Stopping Problems

We consider the optimal stopping problem for g(Z n ), where Z n , n = 1, 2, …, is a homogeneous Markov sequence. An algorithm, called forward improvement iteration, is presented by which an optimal stopping time can be computed. Using an iterative step, this algorithm computes a sequence B 0 ⊇ B 1 ⊇ B 2 ⊇ · · · of subsets of the state space such that the first entrance time into the intersection F of these sets is an optimal stopping time. Various applications are given.

Sign in / Sign up

Export Citation Format

Share Document