research
∙
07/11/2023
Approximating the Value of Energy-Parity Objectives in Simple Stochastic Games
We consider simple stochastic games 𝒢 with energy-parity objectives, a c...
share
research
∙
03/22/2022
Strategy Complexity of Reachability in Countable Stochastic 2-Player Games
We study countably infinite stochastic 2-player games with reachability ...
research
∙
03/10/2022
Strategy Complexity of Point Payoff, Mean Payoff and Total Payoff Objectives in Countable MDPs
We study countably infinite Markov decision processes (MDPs) with real-v...
research
∙
07/01/2021
Strategy Complexity of Mean Payoff, Total Payoff and Point Payoff Objectives in Countable MDPs
We study countably infinite Markov decision processes (MDPs) with real-v...
research
∙
01/18/2021
Simple Stochastic Games with Almost-Sure Energy-Parity Objectives are in NP and coNP
We study stochastic games with energy-parity objectives, which combine q...
research
∙
12/26/2020
Transience in Countable MDPs
The Transience objective is not to visit any state infinitely often. Whi...
research
∙
07/07/2020
Strategy Complexity of Parity Objectives in Countable MDPs
We study countably infinite MDPs with parity objectives. Unlike in finit...
research
∙
06/21/2018
Universal Safety for Timed Petri Nets is PSPACE-complete
A timed network consists of an arbitrary number of initially identical 1...
research
∙
11/27/2017