IDEAS home Printed from https://ideas.repec.org/a/spr/decfin/v43y2020i1d10.1007_s10203-019-00235-0.html
   My bibliography  Save this article

Optimal markov strategies

Author

Listed:
  • William D. Sudderth

    (University of Minnesota)

Abstract

For discrete Dubins–Savage gambling problems (Markov decision processes) with payoff equal to the limsup of the utilities of the sequence of successive states, the existence of an optimal strategy at every fortune implies the existence of an optimal Markov strategy at every fortune. If the state space is finite, the same is true when the payoff is the liminf.

Suggested Citation

  • William D. Sudderth, 2020. "Optimal markov strategies," Decisions in Economics and Finance, Springer;Associazione per la Matematica, vol. 43(1), pages 43-54, June.
  • Handle: RePEc:spr:decfin:v:43:y:2020:i:1:d:10.1007_s10203-019-00235-0
    DOI: 10.1007/s10203-019-00235-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10203-019-00235-0
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10203-019-00235-0?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Hill, Theodore P. & Pestien, Victor C., 1987. "The existence of good Markov strategies for decision processes with general payoffs," Stochastic Processes and their Applications, Elsevier, vol. 24(1), pages 61-76, February.
    2. William D. Sudderth, 1983. "Gambling Problems with a Limit Inferior Payoff," Mathematics of Operations Research, INFORMS, vol. 8(2), pages 287-297, May.
    3. William D. Sudderth, 2016. "Finitely Additive Dynamic Programming," Mathematics of Operations Research, INFORMS, vol. 41(1), pages 92-108, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Pierpaolo Angelini & Fabrizio Maturo, 2020. "Non-Parametric Probability Distributions Embedded Inside of a Linear Space Provided with a Quadratic Metric," Mathematics, MDPI, vol. 8(11), pages 1-17, October.
    2. Gianluca Cassese & Pietro Rigo & Barbara Vantaggi, 2020. "A special issue on the mathematics of subjective probability," Decisions in Economics and Finance, Springer;Associazione per la Matematica, vol. 43(1), pages 1-2, June.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Pestien, Victor & Wang, Xiaobo, 1998. "Markov-achievable payoffs for finite-horizon decision models," Stochastic Processes and their Applications, Elsevier, vol. 73(1), pages 101-118, January.
    2. János Flesch & Arkadi Predtetchinski & William Sudderth, 2021. "Discrete stop-or-go games," International Journal of Game Theory, Springer;Game Theory Society, vol. 50(2), pages 559-579, June.
    3. Flesch, János & Vermeulen, Dries & Zseleva, Anna, 2017. "Zero-sum games with charges," Games and Economic Behavior, Elsevier, vol. 102(C), pages 666-686.

    More about this item

    Keywords

    Gambling theory; Markov decision processes; Optimal strategy; Stationary strategy; Markov strategy;
    All these keywords.

    JEL classification:

    • C44 - Mathematical and Quantitative Methods - - Econometric and Statistical Methods: Special Topics - - - Operations Research; Statistical Decision Theory
    • C81 - Mathematical and Quantitative Methods - - Data Collection and Data Estimation Methodology; Computer Programs - - - Methodology for Collecting, Estimating, and Organizing Microeconomic Data; Data Access
    • C73 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Stochastic and Dynamic Games; Evolutionary Games

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:decfin:v:43:y:2020:i:1:d:10.1007_s10203-019-00235-0. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.