Geodesic
An approach for determining the optimal strategies for an average Markov decision problem with finite state and action spaces
Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica, no. 1 (2018), pp. 34-49 
Dmitrii Lozovanu; Stefan Pickl. An approach for determining the optimal strategies for an average Markov decision problem with finite state and action spaces. Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica, no. 1 (2018), pp. 34-49. http://geodesic.mathdoc.fr/item/BASM_2018_1_a3/
@article{BASM_2018_1_a3,
     author = {Dmitrii Lozovanu and Stefan Pickl},
     title = {An approach for determining the optimal strategies for an average {Markov} decision problem with finite state and action spaces},
     journal = {Buletinul Academiei de \c{S}tiin\c{t}e a Republicii Moldova. Matematica},
     pages = {34--49},
     year = {2018},
     number = {1},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/BASM_2018_1_a3/}
}
TY  - JOUR
AU  - Dmitrii Lozovanu
AU  - Stefan Pickl
TI  - An approach for determining the optimal strategies for an average Markov decision problem with finite state and action spaces
JO  - Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica
PY  - 2018
SP  - 34
EP  - 49
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/BASM_2018_1_a3/
LA  - en
ID  - BASM_2018_1_a3
ER  - 
%0 Journal Article
%A Dmitrii Lozovanu
%A Stefan Pickl
%T An approach for determining the optimal strategies for an average Markov decision problem with finite state and action spaces
%J Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica
%D 2018
%P 34-49
%N 1
%U http://geodesic.mathdoc.fr/item/BASM_2018_1_a3/
%G en
%F BASM_2018_1_a3

Voir la notice de l'article provenant de la source Math-Net.Ru

The average reward Markov decision problem with finite state and action spaces is considered and an approach for determining the optimal pure and mixed stationary strategies for this problem is proposed. We show that the considered problem can be formulated in terms of stationary strategies where the objective function is quasi-monotonic (i.e. it is quasi-convex and quasi-concave) on the feasible set of stationary strategies. Using such a quasi-monotonic programming model with linear constraints we ground algorithms for determining the optimal pure and mixed stationary strategies for the average Markov decision problem.

[1] Boyd S., Vandenberghe L., Convex Optimization, Cambridge University Press, Cambridge, 2004 | MR | Zbl

[2] Kruk S., Wolkowicz H., “Pseudolinear programming”, SIAM Review, 41:4 (1999), 795–805 | DOI | MR | Zbl

[3] Hu Q., Yue W., Markov Decision Processes with their Applications, Springer, New York, 2008 | MR | Zbl

[4] Lozovanu D., “The game-theoretical approach to Markov decision problems and determining Nash equilibria for stochastic positional games”, Int. J. of Mathematical Modelling and Numercal Optimization, 2:2 (2011), 154–158

[5] Lozovanu D., Pickl S., Optimization of Stochastic Discrete Systems and Control on Complex Networks, Springer, 2015 | MR | Zbl

[6] Lozovanu D., Pickl S., “Determining the optimal strategies for discrete control problems on stochastic networks with discounted costs”, Discrete Applied Mathematics, 182 (2015), 169–180 | DOI | MR | Zbl

[7] Lozovanu D., Pickl S., “On Nash equilibria for stochastic games and determining the optimal strategies of the players”, Contribution to game theory and management, 8, St. Petersburg University, 2015, 187–198 | MR

[8] Puterman M., Markov Decision Processes: Discrete Stochastic Dynamic Programming, John Wiley, New Jersey, 2005 | MR | Zbl

[9] White D., Markov Decision Processes, Wiley, New York, 1993 | MR | Zbl