Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes

DOI10.1109/LICS.2015.32zbMATH Open1401.68171arXiv1502.00611OpenAlexW1600623983MaRDI QIDQ4635808FDOQ4635808

Jan Křetínský, Krishnendu Chatterjee, Zuzana Komárková

Publication date: 23 April 2018

Published in: 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1502.00611

Mathematics Subject Classification ID

Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Markov and semi-Markov decision processes (90C40) Other game-theoretic models (91A40) Semantics in the theory of computing (68Q55)

Cited In (5)

• Percentile queries in multi-dimensional Markov decision processes
• Combinations of Qualitative Winning for Stochastic Parity Games
• Compositional strategy synthesis for stochastic games with multiple objectives
• An extended ϵ‐constraint method for a multiobjective finite‐horizon Markov decision process
• Quantitative Automata under Probabilistic Semantics

   Recommendations

• Title not available (Why is that?) 👍 👎
• Markov Decision Processes with Multiple Objectives 👍 👎
• Multi-objective discounted Markov decision processes with expectation and variance criteria 👍 👎
• Multiple objective nonatomic Markov decision processes with total reward criteria 👍 👎
• Title not available (Why is that?) 👍 👎
• Markov Decision Processes with Multiple Long-Run Average Objectives 👍 👎
• Markov Decision Processes with Multiple Long-run Average Objectives 👍 👎
• Title not available (Why is that?) 👍 👎
• On Finding Optimal Policies for Markov Decision Chains: A Unifying Framework for Mean-Variance-Tradeoffs 👍 👎
• Mixing Probabilistic and non-Probabilistic Objectives in Markov Decision Processes 👍 👎

This page was built for publication: Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4635808)