[(g,w)]-Optima in Markov Renewal Programs.

by Bennett L. Fox

Purchase

Purchase Print Copy

 FormatList Price Price
Add to Cart Paperback7 pages $20.00 $16.00 20% Web Discount

An extension of RM-5208, [Multichain Markov Renewal Programs], to cover the case of completely ergodic MRPs. Policies that are nearly optimal for small discount rates are found by linear programming. More precisely, the policies are [(g,w)]-optimal, where, for a given policy, [g] is the loss rate and [w] the bias term. Finding [(g,w)]-optima in completely ergodic programs is primarily of theoretical interest, because ordinarily there is a unique policy minimizing [g]. There are examples, however, in which several policies exist that minimize [g], but not all of these are [(g,w)]-optimal. 7 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.

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.