activity
20072026
most citedAlgorithms for Omega-Regular Games with Imperfect Information

171 citations · 497 across the 31 of their papers we have counts for

collaborators
Showing cs.GTShow all

15 papers · 1 filter

cs.GT2026

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…

cs.GT2024

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…

cs.GT2024

Regular Games with Imperfect Information Are Not That Regular

Laurent Doyen, Thomas Soullard

We consider two-player games with imperfect information and the synthesis of a randomized strategy for one player that ensures the objective is satisfied almost-surely (i.e., with…

cs.GT2023

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…

cs.GT2022

Stochastic Games with Synchronizing Objectives

Laurent Doyen

We consider two-player stochastic games played on a finite graph for infinitely many rounds. Stochastic games generalize both Markov decision processes (MDP) by adding an adversary…

cs.GT2018

Observation and Distinction. Representing Information in Infinite Games

Dietmar Berwanger, Laurent Doyen

We compare two approaches for modelling imperfect information in infinite games by using finite-state automata. The first, more standard approach views information as the result of…