The Variance-Penalized Stochastic Shortest Path Problem

4Citations
Citations of this article
N/AReaders
Mendeley users who have this article in their library.
Get full text

Abstract

The stochastic shortest path problem (SSPP) asks to resolve the non-deterministic choices in a Markov decision process (MDP) such that the expected accumulated weight before reaching a target state is maximized. This paper addresses the optimization of the variance-penalized expectation (VPE) of the accumulated weight, which is a variant of the SSPP in which a multiple of the variance of accumulated weights is incurred as a penalty. It is shown that the optimal VPE in MDPs with non-negative weights as well as an optimal deterministic finite-memory scheduler can be computed in exponential space. The threshold problem whether the maximal VPE exceeds a given rational is shown to be EXPTIME-hard and to lie in NEXPTIME. Furthermore, a result of interest in its own right obtained on the way is that a variance-minimal scheduler among all expectation-optimal schedulers can be computed in polynomial time.

References Powered by Scopus

PORTFOLIO SELECTION

16833Citations
N/AReaders
Get full text

Markov decision processes: Discrete stochastic dynamic programming

7331Citations
N/AReaders
Get full text

VARIANCE OF DISCOUNTED MARKOV DECISION PROCESSES.

181Citations
N/AReaders
Get full text

Cited by Powered by Scopus

Entropic Risk for Turn-Based Stochastic Games

4Citations
N/AReaders
Get full text

Entropic risk for turn-based stochastic games

0Citations
N/AReaders
Get full text

Risk-Averse Optimization of Total Rewards in Markovian Models Using Deviation Measures

0Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Piribauer, J., Sankur, O., & Baier, C. (2022). The Variance-Penalized Stochastic Shortest Path Problem. In Leibniz International Proceedings in Informatics, LIPIcs (Vol. 229). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ICALP.2022.129

Save time finding and organizing research with Mendeley

Sign up for free