Unifying two views on multiple mean-payoff objectives in Markov decision processes

K. Chatterjee, Z. Křetínská, J. Kretinsky, Logical Methods in Computer Science 13 (2017) 15.

Download
OA 511.83 KB

Journal Article | Published | English
Department
Abstract
We consider Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) objectives. There exist two different views: (i) the expectation semantics, where the goal is to optimize the expected mean-payoff objective, and (ii) the satisfaction semantics, where the goal is to maximize the probability of runs such that the mean-payoff value stays above a given vector. We consider optimization with respect to both objectives at once, thus unifying the existing semantics. Precisely, the goal is to optimize the expectation while ensuring the satisfaction constraint. Our problem captures the notion of optimization with respect to strategies that are risk-averse (i.e., ensure certain probabilistic guarantee). Our main results are as follows: First, we present algorithms for the decision problems which are always polynomial in the size of the MDP. We also show that an approximation of the Pareto-curve can be computed in time polynomial in the size of the MDP, and the approximation factor, but exponential in the number of dimensions. Second, we present a complete characterization of the strategy complexity (in terms of memory bounds and randomization) required to solve our problem.
Publishing Year
Date Published
2017-07-03
Journal Title
Logical Methods in Computer Science
Volume
13
Issue
2
Article Number
15
ISSN
IST-REx-ID

Cite this

Chatterjee K, Křetínská Z, Kretinsky J. Unifying two views on multiple mean-payoff objectives in Markov decision processes. Logical Methods in Computer Science. 2017;13(2):15. doi:10.23638/LMCS-13(2:15)2017
Chatterjee, K., Křetínská, Z., & Kretinsky, J. (2017). Unifying two views on multiple mean-payoff objectives in Markov decision processes. Logical Methods in Computer Science, 13(2), 15. https://doi.org/10.23638/LMCS-13(2:15)2017
Chatterjee, Krishnendu, Zuzana Křetínská, and Jan Kretinsky. “Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.” Logical Methods in Computer Science 13, no. 2 (2017): 15. https://doi.org/10.23638/LMCS-13(2:15)2017.
K. Chatterjee, Z. Křetínská, and J. Kretinsky, “Unifying two views on multiple mean-payoff objectives in Markov decision processes,” Logical Methods in Computer Science, vol. 13, no. 2, p. 15, 2017.
Chatterjee K, Křetínská Z, Kretinsky J. 2017. Unifying two views on multiple mean-payoff objectives in Markov decision processes. Logical Methods in Computer Science. 13(2), 15.
Chatterjee, Krishnendu, et al. “Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.” Logical Methods in Computer Science, vol. 13, no. 2, International Federation of Computational Logic, 2017, p. 15, doi:10.23638/LMCS-13(2:15)2017.
All files available under the following license(s):
Creative Commons License:
CC-BY-NDCreative Commons Attribution-NoDerivates (CC BY-ND 4.0)
Main File(s)
Access Level
OA Open Access
Last Uploaded
2018-12-12T10:18:32Z


Export

Marked Publications

Open Data IST Research Explorer

Search this title in

Google Scholar