On the Character of the Smallest and Largest Optimal Generated Rule
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    Assume that (Xn,?n)1 is an adapted reward sequence, (γn1) is snell's envelope of Xn,(An) is a predictable increased process with A0=0 in Doob-Meyer's decomposition of (γn). In this paper,from J. Klass,we prove that σ1=inf{K≥1:Xk1≥γk} is the smallest semi-optimal and the largest strong regular generalized rule,and K0?sup{n≥0:An=0}<∞ is the largest reqular generalized rule. Hence another expression of the uniqueness of optimal generalized rule is given.

    Reference
    Related
    Cited by
Get Citation
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:June 30,1988
  • Revised:
  • Adopted:
  • Online: July 04,2015
  • Published:
Article QR Code