Počet záznamů: 1  

Second Order Optimality in Markov Decision Chains

  1. 1.
    0485146 - ÚTIA 2018 RIV CZ eng J - Článek v odborném periodiku
    Sladký, Karel
    Second Order Optimality in Markov Decision Chains.
    Kybernetika. Roč. 53, č. 6 (2017), s. 1086-1099. ISSN 0023-5954
    Grant CEP: GA ČR GA15-10331S
    Institucionální podpora: RVO:67985556
    Klíčová slova: Markov decision chains * second order optimality * optimalilty conditions for transient, discounted and average models * policy and value iterations
    Obor OECD: Statistics and probability
    Impakt faktor: 0.632, rok: 2017
    http://library.utia.cas.cz/separaty/2017/E/sladky-0485146.pdf

    The article is devoted to Markov reward chains in discrete-time setting with finite state spaces. Unfortunately, the usual optimization criteria examined in the literature on Markov decision chains, such as a total discounted, total reward up to reaching some specific state (called the first passage models) or mean (average) reward optimality, may be quite insufficient to characterize the problem from the point of a decision maker. To this end it seems that it may be preferable if not necessary to select more sophisticated criteria that also reflect variability -risk features of the problem. Perhaps the best known approaches stem from the classical work of Markowitz on mean variance selection rules, i.e. we optimize the weighted sum of average or total reward and its variance. The article presents explicit formulae for calculating the variances for transient and discounted models (where the value of the discount factor depends on the current state and action taken) for finite and infinite time horizon. The same result is presented for the long run average nondiscounted models where finding stationary policies minimizing the average variance in the class of policies with a given long run average reward is discussed.
    Trvalý link: http://hdl.handle.net/11104/0280354

     
     
Počet záznamů: 1  

  Tyto stránky využívají soubory cookies, které usnadňují jejich prohlížení. Další informace o tom jak používáme cookies.