Stéphane Le Roux

Affiliations:
  • Université Paris-Saclay, Paris, France
  • Technische Universität Darmstadt, Germany (former)
  • Université Libre de Bruxelles, Belgium (former)


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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
From Local to Global Optimality in Concurrent Parity Games.
Proceedings of the 32nd EACSL Annual Conference on Computer Science Logic, 2024

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

Subgame Optimal Strategies in Finite Concurrent Games with Prefix-Independent Objectives.
Proceedings of the Foundations of Software Science and Computation Structures, 2023

2022
Games Where You Can Play Optimally with Arena-Independent Finite Memory.
Log. Methods Comput. Sci., 2022

Playing (Almost-)Optimally in Concurrent Büchi and Co-Büchi Games.
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.
Proceedings of the 30th EACSL Annual Conference on Computer Science Logic, 2022

Optimal Strategies in Concurrent Reachability Games.
Proceedings of the 30th EACSL Annual Conference on Computer Science Logic, 2022

2021
Equilibria in multi-player multi-outcome infinite sequential games.
Inf. Comput., 2021

On the existence of weak subgame perfect equilibria.
Inf. Comput., 2021

From Local to Global Determinacy in Concurrent Graph Games.
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.
Inf. Comput., 2020

A Semi-Potential for Finite and Infinite Games in Extensive Form.
Dyn. Games Appl., 2020

Games Where You Can Play Optimally with Finite Memory.
CoRR, 2020

TRIDEnT: towards a decentralized threat indicator marketplace.
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.
Proceedings of the Beyond the Horizon of Computability, 2020

2019
Connected choice and the Brouwer fixed point theorem.
J. Math. Log., 2019

Memoryless determinacy of infinite parity games: Another simple proof.
Inf. Process. Lett., 2019

TRIDEnT: Building Decentralized Incentives for Collaborative Security.
CoRR, 2019

2018
Minkowski Games.
ACM Trans. Comput. Log., 2018

Extending finite-memory determinacy to multi-player games.
Inf. Comput., 2018

Concurrent Games and Semi-Random Determinacy.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions.
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.
Proceedings of the Foundations of Software Science and Computation Structures, 2018

2017
Dynamics and Coalitions in Sequential Games.
Proceedings of the Proceedings Eighth International Symposium on Games, 2017

An Existence Theorem of Nash Equilibrium in Coq and Isabelle.
Proceedings of the Proceedings Eighth International Symposium on Games, 2017

Reduction Techniques for Model Checking and Learning in MDPs.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

2016
A Semi-Potential for Finite and Infinite Sequential Games (Extended Abstract).
Proceedings of the Seventh International Symposium on Games, 2016

Extending Finite Memory Determinacy to Multiplayer Games.
Proceedings of the 4th International Workshop on Strategic Reasoning, 2016

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

Stable States of Perturbed Markov Chains.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

The Brouwer Fixed Point Theorem Revisited.
Proceedings of the Pursuit of the Universal - 12th Conference on Computability in Europe, 2016

2015
Closed choice: Cardinality vs convex dimension
Log. Methods Comput. Sci., 2015

Infinite Subgame Perfect Equilibrium in the Hausdorff Difference Hierarchy.
Proceedings of the Topics in Theoretical Computer Science, 2015

Weihrauch Degrees of Finding Equilibria in Sequential Games.
Proceedings of the Evolving Computability - 11th Conference on Computability in Europe, 2015

2014
From winning strategy to Nash equilibrium.
Math. Log. Q., 2014

On terminating improvement in two-player games.
CoRR, 2014

Infinite sequential games with real-valued payoffs.
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
Log. Methods Comput. Sci., 2013

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

A Machine-Checked Proof of the Odd Order Theorem.
Proceedings of the Interactive Theorem Proving - 4th International Conference, 2013

Closed Choice for Finite and for Convex Sets.
Proceedings of the Nature of Computation. Logic, Algorithms, Applications, 2013

2012
Connected Choice and the Brouwer Fixed Point Theorem
CoRR, 2012

From determinacy to Nash equilibrium
CoRR, 2012

On the Computational Content of the Brouwer Fixed Point Theorem.
Proceedings of the How the World Computes, 2012

2010
Static Analysis by Abstract Interpretation: A Mathematical Programming Approach.
Proceedings of the Proceeding of the Second International Workshop on Numerical and Symbolic Abstract Domains, 2010

Mathematical programming based debugging.
Electron. Notes Discret. Math., 2010

2009
Acyclic Preferences and Existence of Sequential Nash Equilibria: A Formal and Constructive Equivalence.
Proceedings of the Theorem Proving in Higher Order Logics, 22nd International Conference, 2009

2008
Conversion/Preference Games
CoRR, 2008

Graphs and Path Equilibria.
Proceedings of the Algorithmic Aspects in Information and Management, 2008

2007
Singular Coverings and Non-Uniform Notions of Closed Set Computability.
Proceedings of the Fourth International Conference on Computability and Complexity in Analysis, 2007

Discrete Nondeterminism and Nash Equilibria for Strategy-Based Games
CoRR, 2007

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

2006
Computable Closed Euclidean Subsets with and without Computable Points
CoRR, 2006


  Loading...