An optimal stopping problem in the stochastic Gilpin-Ayala population model

被引：11

作者：

Ai, Xiaohui ^{[1
]}

Sun, Yang ^{[2
]}

机构：

[1] Harbin Inst Technol, Dept Math, Harbin 150001, Peoples R China

[2] Harbin Univ Sci & Technol, Sch Appl Sci, Harbin 150080, Peoples R China

来源：

ADVANCES IN DIFFERENCE EQUATIONS | 2012年

关键词：

optimal stopping time; stochastic Gilpin-Ayala population model; smooth pasting technique; HARVESTING POLICY;

D O I：

10.1186/1687-1847-2012-210

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

We present an explicit solution to an optimal stopping problem of the stochastic Gilpin-Ayala population model by applying the smooth pasting technique (Dixit in The Art of Smooth Pasting, 1993 and Dixit and Pindyck in Investment under Uncertainty, 1994). The optimal stopping rule is to find an optimal stopping time and an optimal stopping boundary of maximizing the expected discounted reward, which are given in this paper explicitly.

引用

页数：8

共 22 条

[1] Optimal harvesting under stochastic fluctuations and critical depensation [J].

Alvarez, LHR .

MATHEMATICAL BIOSCIENCES, 1998, 152 (01) :63-85

[2] Optimal harvesting of stochastically fluctuating populations [J].

Alvarez, LHR ;

Shepp, LA .

JOURNAL OF MATHEMATICAL BIOLOGY, 1998, 37 (02) :155-177

[3]

[Anonymous], 1972, HDB MATH FUNCTIONS F

[4]

[Anonymous], 2010, Handbook of Mathematical Functions

[5]

Clark C., 1976, Mathematical Bioeconomics: The Optimal Management of Renewable Resources

[6]

Clark CW., 2010, Mathematical bioeconomics: the mathematics of conservation, V3

[7]

Dixit A.K., 1993, The Art of Smooth Pasting

[8] INVESTMENT UNDER UNCERTAINTY - DIXIT,AK, PINDYCK,RS [J].

SCHWARTZ, ES .

JOURNAL OF FINANCE, 1994, 49 (05) :1924-1928

[9] Optimal harvesting policy for single population with periodic coefficients [J].

Fan, M ;

Wang, K .

MATHEMATICAL BIOSCIENCES, 1998, 152 (02) :165-177

[10] An optimal stopping problem in a diffusion-type model with delay [J].

Gapeev, PV ;

Reiss, M .

STATISTICS & PROBABILITY LETTERS, 2006, 76 (06) :601-608

← 1 2 3 →