An optimal stopping problem with finite horizon for sums of I.I.D. random variables

Wolfgang Stadje

Stochastic Processes and their Applications, 1987, vol. 26, 107-121

Abstract: The problem of selling a commodity optimally at one of n successive time instants leads to the optimal stopping problem for the finite sequence ((n-j)lSj)1[less-than-or-equals, slant]j[less-than-or-equals, slant]n, where Sj=U1 + ... + Uj, U1, U2,... are i.i.d., E(U1) = 0 and E(U21) = 1. The optimal stopping time [pi]n is seen to be of the form [tau]n = inf{jj = n or j ...>cln-1,n = 0 , if is the solution of the equation . For the value vln we have . vl is explicitly computed. In the normal case we also obtain results on the speed of convergence of and .

Keywords: optimal; stopping; salesman; problem; finite; horizon (search for similar items in EconPapers)
Date: 1987
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0304-4149(87)90054-8
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:spapps:v:26:y:1987:i::p:107-121

Ordering information: This journal article can be ordered from
http://http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Stochastic Processes and their Applications is currently edited by T. Mikosch

More articles in Stochastic Processes and their Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().