Threshold Constraints with Guarantees for Parity Objectives in Markov Decision Processes

DOI10.4230/LIPIcs.ICALP.2017.121zbMath1442.90199arXiv1702.05472OpenAlexW2963046256MaRDI QIDQ5111453

Raphaël Berthon, Mickael Randour, Jean-François Raskin

Publication date: 27 May 2020

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

zbMATH Keywords

Markov decision processesparity gamesparity objectivesbeyond worst-case synthesis

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Games involving graphs (91A43) Markov and semi-Markov decision processes (90C40)

Related Items (9)

Simple Strategies in Multi-Objective MDPs ⋮ Unnamed Item ⋮ Multi-cost bounded tradeoff analysis in MDP ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Combinations of Qualitative Winning for Stochastic Parity Games ⋮ Learning-Based Mean-Payoff Optimization in an Unknown MDP under Omega-Regular Constraints ⋮ Unnamed Item ⋮ Timed games with bounded window parity objectives

This page was built for publication: Threshold Constraints with Guarantees for Parity Objectives in Markov Decision Processes