Monotonically improving limit-optimal strategies in finite-state decision processes

T.P. Hill, J. Wal, van der

    Research output: Contribution to journalArticleAcademicpeer-review


    In every finite-state leavable gambling problem and in every finite-state Markov decision process with discounted, negative or positive reward criteria there exists a Markov strategy which is monotonically improving and optimal in the limit along every history. An example is given to show that for the positive and gambling cases such strategies cannot be constructed by simply switching to a "better" action or gamble at each successive return to a state.
    Original languageEnglish
    Pages (from-to)463-473
    Number of pages11
    JournalMathematics of Operations Research
    Issue number3
    Publication statusPublished - 1987

    Fingerprint Dive into the research topics of 'Monotonically improving limit-optimal strategies in finite-state decision processes'. Together they form a unique fingerprint.

    Cite this