171 citations · 513 across the 65 of their papers we have counts for
90 papers
Subgame Perfection in Graph Games with -Recognizable Preference Relations
Véronique Bruyère, Christophe Grandmont, Noémie Meunier +1
This paper investigates the constrained existence problem for subgame perfect equilibria (SPEs) in multiplayer graph games. In the proposed framework, each player has a preference…
A Numerical Approach to the Realizability Problems for Memoryless Nash and Epsilon Equilibria in Concurrent Multiplayer Reachability Games
Senthil Rajasekaran, Jean-François Raskin, Moshe Y. Vardi
The existence of equilibria, which is called the realizability problem in the formal methods community, for probabilistic undiscounted state-based systems has proven to be an incre…
Algorithms for Robbins' Problem using Markov Decision Processes
Léonard Brice, F. Thomas Bruss, Anirban Majumdar +1
In this paper, we consider Robbins' problem, which is a full information variant of the well-known secretary selection problem. In this version of the problem, the goal is to minim…
Multi-Environment MDPs with Prior and Universal Semantics
Benjamin Bordais, Jean-François Raskin
Multiple-environment Markov decision processes (MEMDPs) equip an MDP with several probabilistic transition functions (one per possible environment) so that the state is observable…
Learning Event-recording Automata Passively
Anirban Majumdar, Sayan Mukherjee, Jean-François Raskin
This paper presents a state-merging algorithm for learning timed languages definable by Event-Recording Automata (ERA) using positive and negative samples in the form of symbolic t…
The Value Problem for Multiple-Environment MDPs with Parity Objective
Krishnendu Chatterjee, Laurent Doyen, Jean-François Raskin +1
We consider multiple-environment Markov decision processes (MEMDP), which consist of a finite set of MDPs over the same state space, representing different scenarios of transition…