8 citations · 18 across the 21 of their papers we have counts for
9 papers · 1 filter
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…
Algorithm and Strategy Construction for Sure-Almost-Sure Stochastic Parity Games
Laurent Doyen, Shibashis Guha
We consider turn-based stochastic two-player games with a combination of a parity condition that must hold surely, that is in all possible outcomes, and of a parity condition that…
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…
A Game of Pawns
Guy Avni, Pranav Ghorpade, Shibashis Guha
We introduce and study pawn games, a class of two-player zero-sum turn-based graph games. A turn-based graph game proceeds by placing a token on an initial vertex, and whoever cont…
Stochastic Window Mean-Payoff Games
Laurent Doyen, Pranshu Gaba, Shibashis Guha
Stochastic two-player games model systems with an environment that is both adversarial and stochastic. The adversarial part of the environment is modeled by a player (Player 2) who…
Expected Window Mean-Payoff
Benjamin Bordais, Shibashis Guha, Jean-François Raskin
In the window mean-payoff objective, given an infinite path, instead of considering a long run average, we consider the minimum payoff that can be ensured at every position of the…
Timed Network Games with Clocks
Guy Avni, Shibashis Guha, Orna Kupferman
Network games are widely used as a model for selfish resource-allocation problems. In the classical model, each player selects a path connecting her source and target vertices. The…
Mean-Payoff Games on Timed Automata
Shibashis Guha, Marcin Jurdzinski, Krishna S. +1
Mean-payoff games on timed automata are played on the infinite weighted graph of configurations of priced timed automata between two players, Player Min and Player Max, by moving a…