A Countable Policy Set for Sequential Decision Problems.
Purchase
Purchase Print Copy
| Format | List Price | Price | |
|---|---|---|---|
| Add to Cart | Paperback13 pages | $20.00 | $16.00 20% Web Discount |
In denumerable state, denumerable action sequential decision problems in which the reward function has uniformly bounded second moment, the optimal reward for the decisionmaker who restricts himself to the countable set of stationary policies consisting of those that choose some arbitrary action at all but a finite number of states will be the same as the optimal reward for the decisionmaker who optimizes overall stationary policies. Under some further restriction, he can do almost as well simply by solving a large finite state truncation of the orginal problem. 13 pp. Ref.
This report is part of the RAND Corporation Paper series. The paper was a product of the RAND Corporation from 1948 to 2003 that captured speeches, memorials, and derivative research, usually prepared on authors' own time and meant to be the scholarly or scientific contribution of individual authors to their professional fields. Papers were less formal than reports and did not require rigorous peer review.
This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit www.rand.org/pubs/permissions.
The RAND Corporation is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.