Youssouf Oualhadj

According to our database, Youssouf Oualhadj authored at least 24 papers between 2010 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Deciding the synthesis problem for hybrid games through bisimulation.

Catalin Dima, Mariem Hammami, Youssouf Oualhadj, Régine Laleau

CoRR, 2024

Controller Synthesis in Timed Büchi Automata: Robustness and Punctual Guards.

Benoît Barbot, Damien Busatto-Gaston, Catalin Dima, Youssouf Oualhadj

Proceedings of the Quantitative Evaluation of Systems and Formal Modeling and Analysis of Timed Systems, 2024

2023

Arena-Independent Finite-Memory Determinacy in Stochastic Games.

Patricia Bouyer, Youssouf Oualhadj, Mickael Randour, Pierre Vandenhove

Log. Methods Comput. Sci., 2023

Synthesis of Resource-Aware Controllers Against Rational Agents.

Rodica Condurache, Catalin Dima, Youssouf Oualhadj, Nicolas Troquard

Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

2022

Games Where You Can Play Optimally with Arena-Independent Finite Memory.

Patricia Bouyer, Stéphane Le Roux, Youssouf Oualhadj, Mickael Randour, Pierre Vandenhove

Log. Methods Comput. Sci., 2022

Careful Autonomous Agents in Environments With Multiple Common Resources.

Rodica Condurache, Catalin Dima, Madalina Jitaru, Youssouf Oualhadj, Nicolas Troquard

Proceedings of the Second Workshop on Agents and Robots for reliable Engineered Autonomy, 2022

Fairness and promptness in Muller formulas.

Youssouf Oualhadj, Léo Tible, Daniele Varacca

CoRR, 2022

2021

Rational Synthesis in the Commons with Careless and Careful Agents.

Rodica Condurache, Catalin Dima, Youssouf Oualhadj, Nicolas Troquard

Proceedings of the AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, 2021

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

Games Where You Can Play Optimally with Finite Memory.

Patricia Bouyer, Stéphane Le Roux, Youssouf Oualhadj, Mickael Randour, Pierre Vandenhove

CoRR, 2020

2018

Banach-Mazur Parity Games and Almost-sure Winning Strategies.

Youssouf Oualhadj, Léo Tible, Daniele Varacca

CoRR, 2018

The Complexity of Rational Synthesis for Concurrent Games.

Rodica Condurache, Youssouf Oualhadj, Nicolas Troquard

Proceedings of the 29th International Conference on Concurrency Theory, 2018

2017

The Complexity of Concurrent Rational Synthesis.

Rodica Condurache, Youssouf Oualhadj

CoRR, 2017

2016

Rational verification in Iterated Electric Boolean Games.

Youssouf Oualhadj, Nicolas Troquard

Proceedings of the 4th International Workshop on Strategic Reasoning, 2016

2015

Deciding the value 1 problem for probabilistic leaktight automata.

Nathanaël Fijalkow, Hugo Gimbert, Edon Kelmendi, Youssouf Oualhadj

Log. Methods Comput. Sci., 2015

2014

Deciding the Value 1 Problem for $\sharp$ -acyclic Partially Observable Markov Decision Processes.

Hugo Gimbert, Youssouf Oualhadj

Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014

Two Recursively Inseparable Problems for Probabilistic Automata.

Nathanaël Fijalkow, Hugo Gimbert, Florian Horn, Youssouf Oualhadj

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Perfect-Information Stochastic Mean-Payoff Parity Games.

Krishnendu Chatterjee, Laurent Doyen, Hugo Gimbert, Youssouf Oualhadj

Proceedings of the Foundations of Software Science and Computation Structures, 2014

Probabilistic Robust Timed Games.

Youssouf Oualhadj, Pierre-Alain Reynier, Ocan Sankur

Proceedings of the CONCUR 2014 - Concurrency Theory - 25th International Conference, 2014

2012

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

Youssouf Oualhadj

PhD thesis, 2012

Deciding the Value 1 Problem for Probabilistic Leaktight Automata.

Nathanaël Fijalkow, Hugo Gimbert, Youssouf Oualhadj

Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

2011

A Class of Probabilistic Automata with a Decidable Value 1 Problem

Nathanaël Fijalkow, Hugo Gimbert, Youssouf Oualhadj

CoRR, 2011

Pushing undecidability of the isolation problem for probabilistic automata

Nathanaël Fijalkow, Hugo Gimbert, Youssouf Oualhadj

CoRR, 2011

2010

Probabilistic Automata on Finite Words: Decidable and Undecidable Problems.

Hugo Gimbert, Youssouf Oualhadj

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010