Stéphane Le Roux

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

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

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

Extending finite-memory determinacy by Boolean combination of winning conditions.
CoRR, 2018

Concurrent games and semi-random determinacy.
CoRR, 2018

Memoryless Determinacy of Infinite Parity Games: Another Simple Proof.
CoRR, 2018

Concurrent Games and Semi-Random Determinacy.
Proceedings of the 43rd International Symposium on Mathematical Foundations of 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
The Complexity of Graph-Based Reductions for Reachability in Markov Decision Processes.
CoRR, 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

Minkowski Games.
Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

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

On the Existence of Weak Subgame Perfect Equilibria.
Proceedings of the Foundations of Software Science and Computation Structures, 2017

2016
On the existence of weak subgame perfect equilibria.
CoRR, 2016

Minkowski games.
CoRR, 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
Logical Methods in Computer Science, 2015

Infinite subgame perfect equilibrium in the Hausdorff difference hierarchy.
CoRR, 2015

Stable states of perturbed Markov chains.
CoRR, 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

Weihrauch degrees of finding equilibria in sequential games.
CoRR, 2014

Infinite sequential games with real-valued payoffs.
CoRR, 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
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.
Electr. Notes Theor. Comput. Sci., 2010

Mathematical programming based debugging.
Electronic Notes in Discrete Mathematics, 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
Singular coverings and non-uniform notions of closed set computability.
Math. Log. Q., 2008

Singular Coverings and Non-Uniform Notions of Closed Set Computability.
Electr. Notes Theor. Comput. Sci., 2008

Conversion/Preference Games
CoRR, 2008

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

2007
Graphs and Path Equilibria
CoRR, 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...