Stéphane Le Roux

According to our database, Stéphane Le Roux authored at least 53 papers between 2006 and 2024.

Collaborative distances:

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

2024

From Local to Global Optimality in Concurrent Parity Games.

Benjamin Bordais, Patricia Bouyer, Stéphane Le Roux

Proceedings of the 32nd EACSL Annual Conference on Computer Science Logic, 2024

2023

Sub-game optimal strategies in concurrent games with prefix-independent objectives.

Benjamin Bordais, Patricia Bouyer, Stéphane Le Roux

CoRR, 2023

Subgame Optimal Strategies in Finite Concurrent Games with Prefix-Independent Objectives.

Benjamin Bordais, Patricia Bouyer, Stéphane Le Roux

Proceedings of the Foundations of Software Science and Computation Structures, 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

Playing (Almost-)Optimally in Concurrent Büchi and Co-Büchi Games.

Benjamin Bordais, Patricia Bouyer, Stéphane Le Roux

Proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2022

Finite-Memory Strategies in Two-Player Infinite Games.

Patricia Bouyer, Stéphane Le Roux, Nathan Thomasset

Proceedings of the 30th EACSL Annual Conference on Computer Science Logic, 2022

Optimal Strategies in Concurrent Reachability Games.

Benjamin Bordais, Patricia Bouyer, Stéphane Le Roux

Proceedings of the 30th EACSL Annual Conference on Computer Science Logic, 2022

2021

Equilibria in multi-player multi-outcome infinite sequential games.

Stéphane Le Roux, Arno Pauly

Inf. Comput., 2021

On the existence of weak subgame perfect equilibria.

Véronique Bruyère, Stéphane Le Roux, Arno Pauly, Jean-François Raskin

Inf. Comput., 2021

From Local to Global Determinacy in Concurrent Graph Games.

Benjamin Bordais, Patricia Bouyer, Stéphane Le Roux

Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

2020

On the termination of dynamics in sequential games.

Thomas Brihaye, Gilles Geeraerts, Marion Hallet, Stéphane Le Roux

Inf. Comput., 2020

A Semi-Potential for Finite and Infinite Games in Extensive Form.

Stéphane Le Roux, Arno Pauly

Dyn. Games Appl., 2020

Games Where You Can Play Optimally with Finite Memory.

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

CoRR, 2020

TRIDEnT: towards a decentralized threat indicator marketplace.

Nikolaos Alexopoulos, Emmanouil Vasilomanolakis, Stéphane Le Roux, Steven Rowe, Max Mühlhäuser

Proceedings of the SAC '20: The 35th ACM/SIGAPP Symposium on Applied Computing, online event, [Brno, Czech Republic], March 30, 2020

Time-Aware Uniformization of Winning Strategies.

Stéphane Le Roux

Proceedings of the Beyond the Horizon of Computability, 2020

2019

Connected choice and the Brouwer fixed point theorem.

Vasco Brattka, Stéphane Le Roux, Joseph S. Miller, Arno Pauly

J. Math. Log., 2019

Memoryless determinacy of infinite parity games: Another simple proof.

Stéphane Le Roux

Inf. Process. Lett., 2019

TRIDEnT: Building Decentralized Incentives for Collaborative Security.

Nikolaos Alexopoulos, Emmanouil Vasilomanolakis, Stéphane Le Roux, Steven Rowe, Max Mühlhäuser

CoRR, 2019

2018

Minkowski Games.

Stéphane Le Roux, Arno Pauly, Jean-François Raskin

ACM Trans. Comput. Log., 2018

Extending finite-memory determinacy to multi-player games.

Stéphane Le Roux, Arno Pauly

Inf. Comput., 2018

Concurrent Games and Semi-Random Determinacy.

Stéphane Le Roux

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions.

Stéphane Le Roux, Arno Pauly, Mickael Randour

Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

The Complexity of Graph-Based Reductions for Reachability in Markov Decision Processes.

Stéphane Le Roux, Guillermo A. Pérez

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

2017

Dynamics and Coalitions in Sequential Games.

Thomas Brihaye, Gilles Geeraerts, Marion Hallet, Stéphane Le Roux

Proceedings of the Proceedings Eighth International Symposium on Games, 2017

An Existence Theorem of Nash Equilibrium in Coq and Isabelle.

Stéphane Le Roux, Érik Martin-Dorel, Jan-Georg Smaus

Proceedings of the Proceedings Eighth International Symposium on Games, 2017

Reduction Techniques for Model Checking and Learning in MDPs.

Suda Bharadwaj, Stéphane Le Roux, Guillermo A. Pérez, Ufuk Topcu

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

2016

A Semi-Potential for Finite and Infinite Sequential Games (Extended Abstract).

Stéphane Le Roux, Arno Pauly

Proceedings of the Seventh International Symposium on Games, 2016

Extending Finite Memory Determinacy to Multiplayer Games.

Stéphane Le Roux, Arno Pauly

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

Extending finite memory determinacy: General techniques and an application to energy parity games.

Stéphane Le Roux, Arno Pauly

CoRR, 2016

Stable States of Perturbed Markov Chains.

Volker Betz, Stéphane Le Roux

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

The Brouwer Fixed Point Theorem Revisited.

Vasco Brattka, Stéphane Le Roux, Joseph S. Miller, Arno Pauly

Proceedings of the Pursuit of the Universal - 12th Conference on Computability in Europe, 2016

2015

Closed choice: Cardinality vs convex dimension

Stéphane Le Roux, Arno Pauly

Log. Methods Comput. Sci., 2015

Infinite Subgame Perfect Equilibrium in the Hausdorff Difference Hierarchy.

Stéphane Le Roux

Proceedings of the Topics in Theoretical Computer Science, 2015

Weihrauch Degrees of Finding Equilibria in Sequential Games.

Stéphane Le Roux, Arno Pauly

Proceedings of the Evolving Computability - 11th Conference on Computability in Europe, 2015

2014

From winning strategy to Nash equilibrium.

Stéphane Le Roux

Math. Log. Q., 2014

On terminating improvement in two-player games.

Stéphane Le Roux

CoRR, 2014

Infinite sequential games with real-valued payoffs.

Stéphane Le Roux, Arno Pauly

Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

2013

Infinite sequential Nash equilibrium

Stéphane Le Roux

Log. Methods Comput. Sci., 2013

Lazy beats crazy: a spurious yet mathematical justification for laissez-faire.

Stéphane Le Roux

CoRR, 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, Assia Mahboubi, Russell O'Connor, Sidi Ould Biha, Ioana Pasca, Laurence Rideau, Alexey Solovyev, Enrico Tassi, Laurent Théry

Proceedings of the Interactive Theorem Proving - 4th International Conference, 2013

Closed Choice for Finite and for Convex Sets.

Stéphane Le Roux, Arno Pauly

Proceedings of the Nature of Computation. Logic, Algorithms, Applications, 2013

2012

Connected Choice and the Brouwer Fixed Point Theorem

Vasco Brattka, Stéphane Le Roux, Arno Pauly

CoRR, 2012

From determinacy to Nash equilibrium

Stéphane Le Roux

CoRR, 2012

On the Computational Content of the Brouwer Fixed Point Theorem.

Vasco Brattka, Stéphane Le Roux, Arno Pauly

Proceedings of the How the World Computes, 2012

2010

Static Analysis by Abstract Interpretation: A Mathematical Programming Approach.

Eric Goubault, Stéphane Le Roux, Jeremy Leconte, Leo Liberti, Fabrizio Marinelli

Proceedings of the Proceeding of the Second International Workshop on Numerical and Symbolic Abstract Domains, 2010

Mathematical programming based debugging.

Leo Liberti, Stéphane Le Roux, Jeremy Leconte, Fabrizio Marinelli

Electron. Notes Discret. Math., 2010

2009

Acyclic Preferences and Existence of Sequential Nash Equilibria: A Formal and Constructive Equivalence.

Stéphane Le Roux

Proceedings of the Theorem Proving in Higher Order Logics, 22nd International Conference, 2009

2008

Conversion/Preference Games

Stéphane Le Roux, Pierre Lescanne, René Vestergaard

CoRR, 2008

Graphs and Path Equilibria.

Stéphane Le Roux

Proceedings of the Algorithmic Aspects in Information and Management, 2008

2007

Singular Coverings and Non-Uniform Notions of Closed Set Computability.

Stéphane Le Roux, Martin Ziegler

Proceedings of the Fourth International Conference on Computability and Complexity in Analysis, 2007

Discrete Nondeterminism and Nash Equilibria for Strategy-Based Games

Stéphane Le Roux

CoRR, 2007

Acyclicity of Preferences, Nash Equilibria, and Subgame Perfect Equilibria: a Formal and Constructive Equivalence

Stéphane Le Roux

CoRR, 2007

2006

Computable Closed Euclidean Subsets with and without Computable Points

Stéphane Le Roux, Martin Ziegler

CoRR, 2006