4 papers
Sure-almost-sure and Sure-limit-sure Window Mean Payoff in Markov Decision Processes
Pranshu Gaba, Shibashis Guha
Given rationals and , the sure-almost-sure problem for a threshold Boolean objective in a Markov decision process (MDP) asks if one can simultaneously ensure that all ou…
Recognizing Numbers
Pranshu Gaba, Arnab Sur
The use of monoids in the study of word languages recognized by finite-state automata has been quite fruitful. In this work, we look at the same idea of "recognizability by finite…
Optimising expectation with guarantees for window mean payoff in Markov decision processes
Pranshu Gaba, Shibashis Guha
The window mean-payoff objective strengthens the classical mean-payoff objective by computing the mean-payoff over a finite window that slides along an infinite path. Two variants…
Expectation in Stochastic Games with Prefix-independent Objectives
Laurent Doyen, Pranshu Gaba, Shibashis Guha
Stochastic two-player games model systems with an environment that is both adversarial and stochastic. In this paper, we study the expected value of bounded quantitative prefix-ind…