Probabilistic Automata on Finite Words: Decidable and Undecidable Problems. - Hugo Gimbert; Youssouf Oualhadj (ICALP (2), 2010)

Pushing undecidability of the isolation problem for probabilistic automata - Nathanaël Fijalkow; Hugo Gimbert; Youssouf Oualhadj (CoRR, 2011)

A Class of Probabilistic Automata with a Decidable Value 1 Problem - Nathanaël Fijalkow; Hugo Gimbert; Youssouf Oualhadj (CoRR, 2011)

Deciding the Value 1 Problem for Probabilistic Leaktight Automata. - Nathanaël Fijalkow; Hugo Gimbert; Youssouf Oualhadj (LICS, 2012)

The value problem in stochastic games. (Le problème de la valeur dans les jeux stochastiques). - Youssouf Oualhadj (2012)

Probabilistic Robust Timed Games. - Youssouf Oualhadj; Pierre-Alain Reynier; Ocan Sankur (CONCUR, 2014)

Perfect-Information Stochastic Mean-Payoff Parity Games. - Krishnendu Chatterjee; Laurent Doyen 001; Hugo Gimbert; Youssouf Oualhadj (FoSSaCS, 2014)

Two Recursively Inseparable Problems for Probabilistic Automata. - Nathanaël Fijalkow; Hugo Gimbert; Florian Horn 001; Youssouf Oualhadj (MFCS (1), 2014)

Deciding the Value 1 Problem for $ sharp$ -acyclic Partially Observable Markov Decision Processes. - Hugo Gimbert; Youssouf Oualhadj (SOFSEM, 2014)

Deciding the value 1 problem for probabilistic leaktight automata. - Nathanaël Fijalkow; Hugo Gimbert; Edon Kelmendi; Youssouf Oualhadj (Log. Methods Comput. Sci., 2015)

Rational verification in Iterated Electric Boolean Games. - Youssouf Oualhadj; Nicolas Troquard (SR, 2016)

The Complexity of Concurrent Rational Synthesis. - Rodica Condurache; Youssouf Oualhadj (CoRR, 2017)

The Complexity of Rational Synthesis for Concurrent Games. - Rodica Condurache; Youssouf Oualhadj; Nicolas Troquard (CONCUR, 2018)

Banach-Mazur Parity Games and Almost-sure Winning Strategies. - Youssouf Oualhadj; Léo Tible; Daniele Varacca (CoRR, 2018)

Games Where You Can Play Optimally with Finite Memory. - Patricia Bouyer; Stéphane Le Roux 001; Youssouf Oualhadj; Mickael Randour; Pierre Vandenhove (CoRR, 2020)

Life is Random, Time is Not: Markov Decision Processes with Window Objectives. - Thomas Brihaye; Florent Delgrange; Youssouf Oualhadj; Mickael Randour (Log. Methods Comput. Sci., 2020)

Rational Synthesis in the Commons with Careless and Careful Agents. - Rodica Condurache; Catalin Dima; Youssouf Oualhadj; Nicolas Troquard (AAMAS, 2021)

Fairness and promptness in Muller formulas. - Youssouf Oualhadj; Léo Tible; Daniele Varacca (CoRR, 2022)

Careful Autonomous Agents in Environments With Multiple Common Resources. - Rodica Condurache; Catalin Dima; Madalina Jitaru; Youssouf Oualhadj; Nicolas Troquard (AREA@IJCAI-ECAI, 2022)

Games Where You Can Play Optimally with Arena-Independent Finite Memory. - Patricia Bouyer; Stéphane Le Roux 001; Youssouf Oualhadj; Mickael Randour; Pierre Vandenhove (Log. Methods Comput. Sci., 2022)

Synthesis of Resource-Aware Controllers Against Rational Agents. - Rodica Condurache; Catalin Dima; Youssouf Oualhadj; Nicolas Troquard (AAMAS, 2023)

Arena-Independent Finite-Memory Determinacy in Stochastic Games. - Patricia Bouyer; Youssouf Oualhadj; Mickael Randour; Pierre Vandenhove (Log. Methods Comput. Sci., 2023)

The Controller Synthesis Problem: Implementability and robustness. - Youssouf Oualhadj (2024)

Promptness and Fairness in Muller LTL Formulas. - Damien Busatto-Gaston; Youssouf Oualhadj; Léo Tible; Daniele Varacca (FSTTCS, 2024)

Deciding the Synthesis Problem for Hybrid Games Through Bisimulation. - Catalin Dima; Mariem Hammami; Youssouf Oualhadj; Régine Laleau (ICFEM, 2024)

Controller synthesis in timed Büchi automata: Robustness and punctual guards. - Benoît Barbot; Damien Busatto-Gaston; Catalin Dima; Youssouf Oualhadj (Perform. Evaluation, 2025)