Stopping rules and tactics for processes indexed by a directed set
A new notion of tactic for processes indexed by a directed set is introduced. The main theorem, giving conditions under which tactics can be mapped on stopping times on the line, is applied to reduce some optimal stopping problems in the plane to the same problems on the line. In the case of independent random variables, one achieves a nearly complete reduction of the optimal reward problem to the linear case.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 11 (1981)
Issue (Month): 2 (June)
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/622892/description#description|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional|