{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:29:04Z","timestamp":1725488944958},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540699941"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69995-8_88","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T12:28:21Z","timestamp":1186748901000},"page":"555-561","source":"Crossref","is-referenced-by-count":0,"title":["Risk-Sensitive Optimality Criteria in Markov Decision Processes"],"prefix":"10.1007","author":[{"given":"Karel","family":"Sladk\u00fd","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"88_CR1","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s001860050094","volume":"50","author":"T.D. Bielecki","year":"1999","unstructured":"Bielecki TD, Hern\u00e1ndez-Hern\u00e1ndez TD, Pliska SR (1999) Risk-sensitive control of finite state Markov chains in discrete time, with application to portfolio management. Math Methods Oper Res 50:167\u2013188","journal-title":"Math Methods Oper Res"},{"key":"88_CR2","doi-asserted-by":"publisher","first-page":"752","DOI":"10.1287\/moor.28.4.752.20515","volume":"28","author":"R. Cavazos-Cadena","year":"2003","unstructured":"Cavazos-Cadena R, Montes-de-Oca R (2003) The value iteration algorithm in risk-sensitive average Markov decision chains with finite state space. Math Oper Res 28:752\u2013756","journal-title":"Math Oper Res"},{"key":"88_CR3","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s001860200256","volume":"57","author":"R. Cavazos-Cadena","year":"2003","unstructured":"Cavazos-Cadena R (2003) Solution to the risk-sensitive average cost optimality equation in a class of Markov decision processes with finite state space. Math Methods Oper Res 57:253\u2013285","journal-title":"Math Methods Oper Res"},{"key":"88_CR4","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1287\/mnsc.23.1.43","volume":"23","author":"S.A. Jaquette","year":"1976","unstructured":"Jaquette SA (1976) A utility criterion for Markov decision processes. Manag Sci 23:43\u201349","journal-title":"Manag Sci"},{"key":"88_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s001860200252","volume":"57","author":"K. Hinderer","year":"2003","unstructured":"Hinderer K, Waldmann KH (2003) The critical discount factor for finite Markovian decision processes with an absorbing set. Math Methods Oper Res 57:1\u201319","journal-title":"Math Methods Oper Res"},{"key":"88_CR6","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1287\/mnsc.18.7.356","volume":"23","author":"R.A. Howard","year":"1972","unstructured":"Howard RA, Matheson J (1972) Risk-sensitive Markov decision processes. Manag Sci 23:356\u2013369","journal-title":"Manag Sci"},{"key":"88_CR7","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316887","volume-title":"Markov decision processes \u2014 discrete stochastic dynamic programming","author":"M.L. Puterman","year":"1994","unstructured":"Puterman ML (1994) Markov decision processes \u2014 discrete stochastic dynamic programming. Wiley, New York"},{"key":"88_CR8","doi-asserted-by":"crossref","first-page":"582","DOI":"10.1287\/moor.7.4.582","volume":"7","author":"U.G. Rothblum","year":"1982","unstructured":"Rothblum UG, Whittle P (1982) Growth optimality for branching Markov decision chains. Math Oper Res 7:582\u2013601","journal-title":"Math Oper Res"},{"key":"88_CR9","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/BFb0120753","volume":"6","author":"K. Sladk\u00fd","year":"1976","unstructured":"Sladk\u00fd K (1976) On dynamic programming recursions for multiplicative Markov decision chains. Math Programming Study 6:216\u2013226","journal-title":"Math Programming Study"},{"key":"88_CR10","first-page":"526","volume":"16","author":"K. Sladk\u00fd","year":"1980","unstructured":"Sladk\u00fd K (1980) Bounds on discrete dynamic programming recursions I. Kybernetika 16: 526\u2013547","journal-title":"Kybernetika"},{"key":"88_CR11","first-page":"489","volume":"17","author":"K. Sladk\u00fd","year":"1981","unstructured":"Sladk\u00fd K (1981) On the existence of stationary optimal policies in discrete dynamic programing. Kybernetika 17:489\u2013513","journal-title":"Kybernetika"},{"key":"88_CR12","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s00186-005-0039-z","volume":"62","author":"K. Sladk\u00fd","year":"2005","unstructured":"Sladk\u00fd K (2005) On mean reward variance in semi-Markov processes. Math Methods Oper Res 62:387\u2013397","journal-title":"Math Methods Oper Res"},{"key":"88_CR13","volume-title":"Optimization over time \u2014 dynamic programming and stochastic control","author":"P. Whittle","year":"1983","unstructured":"Whittle P (1983) Optimization over time \u2014 dynamic programming and stochastic control. Volume II, Chapter 35, Wiley, Chichester"},{"key":"88_CR14","volume-title":"Nonnegative matrices in dynamic programming","author":"W.H.M. Zijm","year":"1983","unstructured":"Zijm WHM (1983) Nonnegative matrices in dynamic programming. Mathematical Centre Tract, Amsterdam"}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2006"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69995-8_88.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,21]],"date-time":"2021-08-21T10:55:47Z","timestamp":1629543347000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69995-8_88"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540699941"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69995-8_88","relation":{},"subject":[]}}