Computable Closed Euclidean Subsets with and without Computable Points - Stéphane Le Roux 001; Martin Ziegler 001 (CoRR, 2006)

Acyclicity of Preferences, Nash Equilibria, and Subgame Perfect Equilibria: a Formal and Constructive Equivalence - Stéphane Le Roux 001 (CoRR, 2007)

Discrete Nondeterminism and Nash Equilibria for Strategy-Based Games - Stéphane Le Roux 001 (CoRR, 2007)

Singular Coverings and Non-Uniform Notions of Closed Set Computability. - Stéphane Le Roux 001; Martin Ziegler 001 (CCA, 2007)

Graphs and Path Equilibria. - Stéphane Le Roux 001 (AAIM, 2008)

Conversion/Preference Games - Stéphane Le Roux 001; Pierre Lescanne; René Vestergaard (CoRR, 2008)

Acyclic Preferences and Existence of Sequential Nash Equilibria: A Formal and Constructive Equivalence. - Stéphane Le Roux 001 (TPHOLs, 2009)

Mathematical programming based debugging. - Leo Liberti; Stéphane Le Roux 001; Jeremy Leconte; Fabrizio Marinelli 001 (Electron. Notes Discret. Math., 2010)

Static Analysis by Abstract Interpretation: A Mathematical Programming Approach. - Eric Goubault; Stéphane Le Roux 001; Jeremy Leconte; Leo Liberti; Fabrizio Marinelli 001 (NSAD@SAS, 2010)

On the Computational Content of the Brouwer Fixed Point Theorem. - Vasco Brattka; Stéphane Le Roux 001; Arno Pauly (CiE, 2012)

From determinacy to Nash equilibrium - Stéphane Le Roux 001 (CoRR, 2012)

Connected Choice and the Brouwer Fixed Point Theorem - Vasco Brattka; Stéphane Le Roux 001; Arno Pauly (CoRR, 2012)

Closed Choice for Finite and for Convex Sets. - Stéphane Le Roux 001; Arno Pauly (CiE, 2013)

A Machine-Checked Proof of the Odd Order Theorem. - Georges Gonthier; Andrea Asperti; Jeremy Avigad; Yves Bertot; Cyril Cohen; François Garillot; Stéphane Le Roux 001; Assia Mahboubi; Russell O'Connor; Sidi Ould Biha; Ioana Pasca; Laurence Rideau; et al. (ITP, 2013)

Lazy beats crazy: a spurious yet mathematical justification for laissez-faire. - Stéphane Le Roux 001 (CoRR, 2013)

Infinite sequential Nash equilibrium - Stéphane Le Roux 001 (Log. Methods Comput. Sci., 2013)

Infinite sequential games with real-valued payoffs. - Stéphane Le Roux 001; Arno Pauly (CSL-LICS, 2014)

On terminating improvement in two-player games. - Stéphane Le Roux 001 (CoRR, 2014)

From winning strategy to Nash equilibrium. - Stéphane Le Roux 001 (Math. Log. Q., 2014)

Weihrauch Degrees of Finding Equilibria in Sequential Games. - Stéphane Le Roux 001; Arno Pauly (CiE, 2015)

Infinite Subgame Perfect Equilibrium in the Hausdorff Difference Hierarchy. - Stéphane Le Roux 001 (TTCS, 2015)

Closed choice: Cardinality vs convex dimension - Stéphane Le Roux 001; Arno Pauly (Log. Methods Comput. Sci., 2015)

The Brouwer Fixed Point Theorem Revisited. - Vasco Brattka; Stéphane Le Roux 001; Joseph S. Miller; Arno Pauly (CiE, 2016)

Stable States of Perturbed Markov Chains. - Volker Betz; Stéphane Le Roux 001 (MFCS, 2016)

Extending finite memory determinacy: General techniques and an application to energy parity games. - Stéphane Le Roux 001; Arno Pauly (CoRR, 2016)

Extending Finite Memory Determinacy to Multiplayer Games. - Stéphane Le Roux 001; Arno Pauly (SR, 2016)

A Semi-Potential for Finite and Infinite Sequential Games (Extended Abstract). - Stéphane Le Roux 001; Arno Pauly (GandALF, 2016)

Reduction Techniques for Model Checking and Learning in MDPs. - Suda Bharadwaj; Stéphane Le Roux 001; Guillermo A. Pérez 001; Ufuk Topcu (IJCAI, 2017)

An Existence Theorem of Nash Equilibrium in Coq and Isabelle. - Stéphane Le Roux 001; Érik Martin-Dorel; Jan-Georg Smaus (GandALF, 2017)

Dynamics and Coalitions in Sequential Games. - Thomas Brihaye; Gilles Geeraerts; Marion Hallet; Stéphane Le Roux 001 (GandALF, 2017)

The Complexity of Graph-Based Reductions for Reachability in Markov Decision Processes. - Stéphane Le Roux 001; Guillermo A. Pérez 001 (FoSSaCS, 2018)

Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions. - Stéphane Le Roux 001; Arno Pauly; Mickael Randour (FSTTCS, 2018)

Concurrent Games and Semi-Random Determinacy. - Stéphane Le Roux 001 (MFCS, 2018)

Extending finite-memory determinacy to multi-player games. - Stéphane Le Roux 001; Arno Pauly (Inf. Comput., 2018)

Minkowski Games. - Stéphane Le Roux 001; Arno Pauly; Jean-François Raskin (ACM Trans. Comput. Log., 2018)

TRIDEnT: Building Decentralized Incentives for Collaborative Security. - Nikolaos Alexopoulos; Emmanouil Vasilomanolakis; Stéphane Le Roux 001; Steven Rowe; Max Mühlhäuser (CoRR, 2019)

Memoryless determinacy of infinite parity games: Another simple proof. - Stéphane Le Roux 001 (Inf. Process. Lett., 2019)

Connected choice and the Brouwer fixed point theorem. - Vasco Brattka; Stéphane Le Roux 001; Joseph S. Miller; Arno Pauly (J. Math. Log., 2019)

Time-Aware Uniformization of Winning Strategies. - Stéphane Le Roux 001 (CiE, 2020)

TRIDEnT: towards a decentralized threat indicator marketplace. - Nikolaos Alexopoulos; Emmanouil Vasilomanolakis; Stéphane Le Roux 001; Steven Rowe; Max Mühlhäuser (SAC, 2020)

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

A Semi-Potential for Finite and Infinite Games in Extensive Form. - Stéphane Le Roux 001; Arno Pauly (Dyn. Games Appl., 2020)

On the termination of dynamics in sequential games. - Thomas Brihaye; Gilles Geeraerts; Marion Hallet; Stéphane Le Roux 001 (Inf. Comput., 2020)

From Local to Global Determinacy in Concurrent Graph Games. - Benjamin Bordais; Patricia Bouyer; Stéphane Le Roux 001 (FSTTCS, 2021)

On the existence of weak subgame perfect equilibria. - Véronique Bruyère; Stéphane Le Roux 001; Arno Pauly; Jean-François Raskin (Inf. Comput., 2021)

Equilibria in multi-player multi-outcome infinite sequential games. - Stéphane Le Roux 001; Arno Pauly (Inf. Comput., 2021)

Optimal Strategies in Concurrent Reachability Games. - Benjamin Bordais; Patricia Bouyer; Stéphane Le Roux 001 (CSL, 2022)

Finite-Memory Strategies in Two-Player Infinite Games. - Patricia Bouyer; Stéphane Le Roux 001; Nathan Thomasset (CSL, 2022)

Playing (Almost-)Optimally in Concurrent Büchi and Co-Büchi Games. - Benjamin Bordais; Patricia Bouyer; Stéphane Le Roux 001 (FSTTCS, 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)

Subgame Optimal Strategies in Finite Concurrent Games with Prefix-Independent Objectives. - Benjamin Bordais; Patricia Bouyer; Stéphane Le Roux 001 (FoSSaCS, 2023)

Sub-game optimal strategies in concurrent games with prefix-independent objectives. - Benjamin Bordais; Patricia Bouyer; Stéphane Le Roux 001 (CoRR, 2023)

From Local to Global Optimality in Concurrent Parity Games. - Benjamin Bordais; Patricia Bouyer; Stéphane Le Roux 001 (CSL, 2024)

An Automata-Based Method to Formalize Psychological Theories: The Case Study of Lazarus and Folkman's Stress Theory. - Alain Finkel; Gaspard Fougea; Stéphane Le Roux 001 (MODELSWARD, 2025)