Jean-François Raskin

research

∙ 08/15/2023

Formally-Sharp DAgger for MCTS: Lower-Latency Monte Carlo Tree Search using Data Aggregation with Formal Methods

We study how to efficiently combine formal methods, Monte Carlo Tree Sea...

0 Debraj Chakraborty, et al. ∙

research

∙ 05/16/2023

Bi-Objective Lexicographic Optimization in Markov Decision Processes with Related Objectives

We consider lexicographic bi-objective problems on Markov Decision Proce...

0 Damien Busatto-Gaston, et al. ∙

research

∙ 01/30/2023

Rational verification and checking for Nash and subgame-perfect equilibria in graph games

We study two natural problems about rational behaviors in multiplayer no...

0 Léonard Brice, et al. ∙

research

∙ 01/25/2023

LTL Reactive Synthesis with a Few Hints

We study a variant of the problem of synthesizing Mealy machines that en...

0 Mrudula Balachander, et al. ∙

research

∙ 11/07/2022

Learning Probabilistic Temporal Safety Properties from Examples in Relational Domains

We propose a framework for learning a fragment of probabilistic computat...

0 Gavin Rens, et al. ∙

research

∙ 04/25/2022

Strategy Synthesis for Global Window PCTL

Given a Markov decision process (MDP) M and a formula Φ, the strategy sy...

0 Benjamin Bordais, et al. ∙

research

∙ 03/16/2022

Subgame-perfect Equilibria in Mean-payoff Games (journal version)

In this paper, we provide an effective characterization of all the subga...

0 Léonard Brice, et al. ∙

research

∙ 03/02/2022

Stackelberg-Pareto Synthesis (Extended Version)

We study the framework of two-player Stackelberg games played on graphs ...

0 Véronique Bruyère, et al. ∙

research

∙ 02/27/2022

Pareto-Rational Verification

We study the rational verification problem which consists in verifying t...

0 Véronique Bruyère, et al. ∙

research

∙ 02/17/2022

The Complexity of SPEs in Mean-payoff Games

We establish that the subgame perfect equilibrium (SPE) threshold proble...

0 Léonard Brice, et al. ∙

research

∙ 07/15/2021

On the Complexity of SPEs in Parity Games

We study the complexity of problems related to subgame-perfect equilibri...

0 Léonard Brice, et al. ∙

research

∙ 06/22/2021

Lifted Model Checking for Relational MDPs

Model checking has been developed for verifying the behaviour of systems...

0 Wen-Chi Yang, et al. ∙

research

∙ 04/23/2021

Active Learning of Sequential Transducers with Side Information about the Domain

Active learning is a setting in which a student queries a teacher, throu...

0 Raphaël Berthon, et al. ∙

research

∙ 02/17/2021

Stackelberg-Pareto Synthesis (Full Version)

In this paper, we study the framework of two-player Stackelberg games pl...

0 Véronique Bruyère, et al. ∙

research

∙ 01/26/2021

Subgame-perfect Equilibria in Mean-payoff Games

In this paper, we provide an effective characterization of all the subga...

0 Léonard Brice, et al. ∙

research

∙ 09/26/2020

Online Learning of Non-Markovian Reward Models

There are situations in which an agent should receive rewards only after...

14 Gavin Rens, et al. ∙

research

∙ 09/20/2020

Proceedings 11th International Symposium on Games, Automata, Logics, and Formal Verification

This volume contains the proceedings of the 11th International Symposium...

0 Jean-François Raskin, et al. ∙

research

∙ 07/13/2020

Stackelberg Mean-payoff Games with a Rationally Bounded Adversarial Follower

Two-player Stackelberg games are non-zero sum strategic games between a ...

0 Mrudula Balachander, et al. ∙

research

∙ 06/08/2020

Monte Carlo Tree Search guided by Symbolic Advice for MDPs

In this paper, we consider the online computation of a strategy that aim...

0 Damien Busatto-Gaston, et al. ∙

research

∙ 05/19/2020

Safe Learning for Near Optimal Scheduling

In this paper, we investigate the combination of synthesis techniques an...

0 Gilles Geeraerts, et al. ∙

research

∙ 04/28/2020

Mixing Probabilistic and non-Probabilistic Objectives in Markov Decision Processes

In this paper, we consider algorithms to decide the existence of strateg...

0 Raphaël Berthon, et al. ∙

research

∙ 04/27/2020

The Adversarial Stackelberg Value in Quantitative Games

In this paper, we study the notion of adversarial Stackelberg value for ...

0 Emmanuel Filiot, et al. ∙

research

∙ 01/25/2020

Learning Non-Markovian Reward Models in MDPs

There are situations in which an agent should receive rewards only after...

0 Gavin Rens, et al. ∙

research

∙ 09/12/2019

Proceedings Tenth International Symposium on Games, Automata, Logics, and Formal Verification

This volume contains the proceedings of the Tenth International Symposiu...

0 Jerome Leroux, et al. ∙

research

∙ 07/16/2019

Partial Solvers for Generalized Parity Games

Parity games have been broadly studied in recent years for their applica...

0 Véronique Bruyère, et al. ∙

research

∙ 07/02/2019

Energy mean-payoff games

In this paper, we study one-player and two-player energy mean-payoff gam...

0 Véronique Bruyère, et al. ∙

research

∙ 05/02/2019

The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games (full version)

We study multiplayer quantitative reachability games played on a finite ...

0 Thomas Brihaye, et al. ∙

research

∙ 01/14/2019

Monadic Second Order Logic with Path-Measure Quantifier is Undecidable

We prove that the theory of monadic second order logic (MSO) of the infi...

0 Raphaël Berthon, et al. ∙

research

∙ 12/21/2018

Expected Window Mean-Payoff

In the window mean-payoff objective, given an infinite path, instead of ...

0 Benjamin Bordais, et al. ∙

research

∙ 09/10/2018

Constrained Existence Problem for Weak Subgame Perfect Equilibria with ω-Regular Boolean Objectives

We study multiplayer turn-based games played on a finite directed graph ...

0 Thomas Brihaye, et al. ∙

research

∙ 06/14/2018

Constrained existence problem for weak subgame perfect equilibria with omega-regular Boolean objectives (full version)

We study multiplayer turn-based games played on a finite directed graph ...

0 Thomas Brihaye, et al. ∙

research

∙ 06/14/2018

Constrained existence problem for weak subgame perfect equilibria with omega-regular Boolean objectives

We study multiplayer turn-based games played on a finite directed graph ...

0 Thomas Brihaye, et al. ∙

research

∙ 05/29/2018

Beyond admissibility: Dominance between chains of strategies

Admissible strategies, i.e. those that are not dominated by any other st...

0 Nicolas Basset, et al. ∙

research

∙ 04/24/2018

Learning-Based Mean-Payoff Optimization in an Unknown MDP under Omega-Regular Constraints

We formalize the problem of maximizing the mean-payoff value with high p...

0 Jan Křetínský, et al. ∙

research

∙ 11/29/2017

The 4th Reactive Synthesis Competition (SYNTCOMP 2017): Benchmarks, Participants & Results

We report on the fourth reactive synthesis competition (SYNTCOMP 2017). ...

0 Swen Jacobs, et al. ∙

research

∙ 07/19/2017

Parameterized complexity of games with monotonically ordered ω-regular objectives

In recent years, two-player zero-sum games with multiple objectives have...

0 Véronique Bruyère, et al. ∙

research

∙ 02/17/2017

Threshold Constraints with Guarantees for Parity Objectives in Markov Decision Processes

The beyond worst-case synthesis problem was introduced recently by Bruyè...

0 Raphaël Berthon, et al. ∙

research

∙ 11/26/2016

Optimizing Expectation with Guarantees in POMDPs (Technical Report)

A standard objective in partially-observable Markov decision processes (...

0 Krishnendu Chatterjee, et al. ∙

Jean-François Raskin

Featured Co-authors