<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="style/detail_T.xsl"?>
<bibitem type="C">   <ARLID>0490663</ARLID> <utime>20240103220150.4</utime><mtime>20180626235959.9</mtime>   <WOS>000455265500044</WOS>            <title language="eng" primary="1">Central Moments and Risk-Sensitive Optimality in Markov Reward Chains</title>  <specification> <page_count>7 s.</page_count> <media_type>P</media_type> </specification>   <serial><ARLID>cav_un_epca*0490662</ARLID><ISBN>978-80-89962-07-5</ISBN><title>Quantitative Methods in Economics: Multiple Criteria Decision Making XIX</title><part_num/><part_title/><page_num>325-331</page_num><publisher><place>Bratislava</place><name>University of  Economics, Bratislava</name><year>2018</year></publisher><editor><name1>Reiff</name1><name2>Martin</name2></editor><editor><name1>Gežík</name1><name2>Pavel</name2></editor></serial>    <keyword>Discrete-time  Markov reward chains</keyword>   <keyword>exponential utility</keyword>   <keyword>moment generating functions</keyword>   <keyword>formulae for central moments</keyword>    <author primary="1"> <ARLID>cav_un_auth*0101196</ARLID> <full_dept language="cz">Ekonometrie</full_dept> <full_dept language="eng">Department of Econometrics</full_dept> <department language="cz">E</department> <department language="eng">E</department> <full_dept>Department of Econometrics</full_dept>  <share>100</share> <name1>Sladký</name1> <name2>Karel</name2> <institution>UTIA-B</institution> <garant>K</garant> <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author>   <source> <url>http://library.utia.cas.cz/separaty/2018/E/sladky-0490663.pdf</url> </source>        <cas_special> <project> <ARLID>cav_un_auth*0363963</ARLID> <project_id>GA18-02739S</project_id> <agency>GA ČR</agency> </project>  <abstract language="eng" primary="1">There is no doubt that usual optimization criteria examined in the literature on optimization of Markov reward processes, e.g. total discounted or mean reward, may be quite insufficient to characterize the problem from the point of the decision maker. To this end it is necessary to select more sophisticated criteria that reflect also the variability-risk features of the problem (cf. Cavazos-Cadena and Fernandez-Gaucherand (1999), Cavazos-Cadena and Hernández-Hernández (2005), Howard and Matheson (1972), Jaquette (1976),  Kawai (1987), Mandl (1971), Sladký (2005),(2008),(2013), van Dijk and Sladký (2006), White (1988)).  In the present paper we consider unichain Markov reward processes with finite state spaces and assume that the generated reward is evaluated by an exponential utility function. Using the Taylor expansion we present explicit formulae for calculating variance and higher central moments of the total reward generated by the Markov reward chain along with its asymptotic behavior and the growth rates if the considered time horizon tends to infinity.</abstract>    <action target="EUR"> <ARLID>cav_un_auth*0361941</ARLID> <name>Quantitative Methods in Economics: Multiple Criteria Decision Making XIX</name>  <dates>20180523</dates> <unknown tag="mrcbC20-s">20180525</unknown> <place>Trenčianské Teplice</place> <country>SK</country>  </action>  <RIV>BB</RIV> <FORD0>50000</FORD0> <FORD1>50200</FORD1> <FORD2>50202</FORD2>   <reportyear>2019</reportyear>      <num_of_auth>1</num_of_auth>  <presentation_type> PR </presentation_type> <inst_support> RVO:67985556 </inst_support>  <permalink>http://hdl.handle.net/11104/0286786</permalink>   <confidential>S</confidential>  <unknown tag="mrcbC86"> n.a. Proceedings Paper Economics </unknown>       <arlyear>2018</arlyear>       <unknown tag="mrcbU14"> SCOPUS </unknown> <unknown tag="mrcbU24"> PUBMED </unknown> <unknown tag="mrcbU34"> 000455265500044 WOS </unknown> <unknown tag="mrcbU63"> cav_un_epca*0490662 Quantitative Methods in Economics: Multiple Criteria Decision Making XIX University of  Economics, Bratislava 2018 Bratislava 325 331 978-80-89962-07-5 </unknown> <unknown tag="mrcbU67"> 340 Reiff Martin </unknown> <unknown tag="mrcbU67"> 340 Gežík Pavel </unknown> </cas_special> </bibitem>