Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If You Use a Screen Reader

This content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.

Blackwell Optimal Policies in Countable Dynamic Programming without Aperiodicity Assumptions

Alexander A. Yushkevich
Lecture Notes-Monograph Series
Vol. 30, Statistics, Probability and Game Theory: Papers in Honor of David Blackwell (1996), pp. 401-407
Stable URL: http://www.jstor.org/stable/4355958
Page Count: 7
  • Read Online (Free)
  • Download ($19.00)
  • Subscribe ($19.50)
  • Cite this Item
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Blackwell Optimal Policies in Countable Dynamic Programming without Aperiodicity Assumptions
Preview not available

Abstract

The existence of stationary Blackwell optimal policies is proved in denumerable dynamic programming models satisfying compactness-continuity conditions and a uniform Doeblin condition. The latter is given in terms compatible with periodic chains.

Page Thumbnails

  • Thumbnail: Page 
401
    401
  • Thumbnail: Page 
402
    402
  • Thumbnail: Page 
403
    403
  • Thumbnail: Page 
404
    404
  • Thumbnail: Page 
405
    405
  • Thumbnail: Page 
406
    406
  • Thumbnail: Page 
407
    407