Risk-Sensitive Average Optimality in Markov Decision Chains

Karel Sladký () and Raúl Montes- de-Oca ()
Additional contact information
Karel Sladký: Institute of Information Theory and Automation
Raúl Montes- de-Oca: Universidad Autónoma Metropolitana

A chapter in Operations Research Proceedings 2007, 2008, pp 69-74 from Springer

Abstract: Abstract We consider a Markov decision chain X = {X n, n = 0, 1, ...} with finite state space $$ \mathcal{I} $$ = {1, 2, ...,N} and a finite set $$ \mathcal{A}_i $$ = {1, 2, ...,K i} of possible decisions (actions) in state i ∈ $$ \mathcal{I} $$ . Supposing that in state i ∈ $$ \mathcal{I} $$ action k ∈ $$ \mathcal{A}_i $$ is selected, then state j is reached in the next transition with a given probability p ij k and one-stage transition reward r ij will be accrued to such transition.

Keywords: Markov Decision Process; Certainty Equivalent; Nonnegative Matrice; Exponential Utility; Finite State Space (search for similar items in EconPapers)
Date: 2008
References: Add references at CitEc
Citations: View citations in EconPapers (1)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-540-77903-2_11

Ordering information: This item can be ordered from
http://www.springer.com/9783540779032

DOI: 10.1007/978-3-540-77903-2_11

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().