J
Jean-François Raskin
Researcher at Université libre de Bruxelles
Publications - 306
Citations - 8087
Jean-François Raskin is an academic researcher from Université libre de Bruxelles. The author has contributed to research in topics: Decidability & Markov decision process. The author has an hindex of 47, co-authored 293 publications receiving 7429 citations. Previous affiliations of Jean-François Raskin include Free University of Brussels & Université de Namur.
Papers
More filters
Posted Content
Admissibility in Concurrent Games
TL;DR: It is proved that admissible strategies always exist in concurrent games, and they are characterised precisely, when the objectives of the players are omega-regular.
Journal ArticleDOI
Constrained existence problem for weak subgame perfect equilibria with ω-regular Boolean objectives
TL;DR: A fine-grained analysis of a fixpoint algorithm that computes the set of possible payoff profiles underlying weak SPEs and shows that the constrained existence problem is fixed parameter tractable and is polynomial when the number of players is fixed.
Posted Content
Event-Clock Automata: From Theory to Practice
TL;DR: In this article, it was shown that no finite time abstract language equivalence exists for ECA, and that regions do not form a time abstract bisimulation, but regions can still be used to build a finite automaton recognizing the untimed language of an ECA.
Journal ArticleDOI
Constrained existence problem for weak subgame perfect equilibria with omega-regular Boolean objectives
TL;DR: In this article, the authors considered the constrained existence problem for weak subgame perfect equilibria (weak SPE), a refinement of weak SPE, where players who deviate can only use the subclass of strategies that differ from the original one on a finite number of histories.
Proceedings ArticleDOI
The Adversarial Stackelberg Value in Quantitative Games
TL;DR: This paper shows that the adversarial Stackelberg value for two-player non-zero sum games played on bi-weighted graphs with the mean-payoff and the discounted sum functions is not always achievable but epsilon-optimal strategies exist.