Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStéphane Le Roux 0001
Person information
- affiliation: Université Paris-Saclay, Paris, France
- affiliation (former): Technische Universität Darmstadt, Germany
- affiliation (former): Université Libre de Bruxelles, Belgium
Other persons with the same name
- Stéphane Le Roux 0002 — Commissariat à l'Énergie Atomique et aux Énergies Alternatives, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
[j14]Patricia Bouyer, Stéphane Le Roux, Youssouf Oualhadj, Mickael Randour, Pierre Vandenhove
:
Games Where You Can Play Optimally with Arena-Independent Finite Memory. Log. Methods Comput. Sci. 18(1) (2022)- 2021
- [j13]Véronique Bruyère, Stéphane Le Roux, Arno Pauly, Jean-François Raskin:
On the existence of weak subgame perfect equilibria. Inf. Comput. 276: 104553 (2021) - [j12]Stéphane Le Roux, Arno Pauly:
Equilibria in multi-player multi-outcome infinite sequential games. Inf. Comput. 276: 104557 (2021) - 2020
- [j11]Stéphane Le Roux, Arno Pauly:
A Semi-Potential for Finite and Infinite Games in Extensive Form. Dyn. Games Appl. 10(1): 120-144 (2020) - [j10]Thomas Brihaye, Gilles Geeraerts, Marion Hallet, Stéphane Le Roux:
On the termination of dynamics in sequential games. Inf. Comput. 272: 104505 (2020) - 2019
- [j9]Stéphane Le Roux:
Memoryless determinacy of infinite parity games: Another simple proof. Inf. Process. Lett. 143: 8-13 (2019) - [j8]Vasco Brattka, Stéphane Le Roux, Joseph S. Miller, Arno Pauly:
Connected choice and the Brouwer fixed point theorem. J. Math. Log. 19(1): 1950004:1-1950004:46 (2019) - 2018
- [j7]Stéphane Le Roux, Arno Pauly:
Extending finite-memory determinacy to multi-player games. Inf. Comput. 261: 676-694 (2018) - [j6]Stéphane Le Roux, Arno Pauly, Jean-François Raskin:
Minkowski Games. ACM Trans. Comput. Log. 19(3): 20:1-20:29 (2018) - 2015
- [j5]Stéphane Le Roux, Arno Pauly:
Closed choice: Cardinality vs convex dimension. Log. Methods Comput. Sci. 11(4) (2015) - 2014
- [j4]Stéphane Le Roux:
From winning strategy to Nash equilibrium. Math. Log. Q. 60(4-5): 354-371 (2014) - 2013
- [j3]Stéphane Le Roux:
Infinite sequential Nash equilibrium. Log. Methods Comput. Sci. 9(2) (2013) - 2010
- [j2]Leo Liberti, Stéphane Le Roux, Jeremy Leconte, Fabrizio Marinelli:
Mathematical programming based debugging. Electron. Notes Discret. Math. 36: 1311-1318 (2010) - 2008
- [j1]Stéphane Le Roux, Martin Ziegler:
Singular coverings and non-uniform notions of closed set computability. Math. Log. Q. 54(5): 545-560 (2008)
Conference and Workshop Papers
- 2024
- [c31]Benjamin Bordais, Patricia Bouyer, Stéphane Le Roux:
From Local to Global Optimality in Concurrent Parity Games. CSL 2024: 18:1-18:21 - 2023
- [c30]Benjamin Bordais, Patricia Bouyer, Stéphane Le Roux:
Subgame Optimal Strategies in Finite Concurrent Games with Prefix-Independent Objectives. FoSSaCS 2023: 541-560 - 2022
- [c29]Benjamin Bordais, Patricia Bouyer, Stéphane Le Roux:
Optimal Strategies in Concurrent Reachability Games. CSL 2022: 7:1-7:17 - [c28]Patricia Bouyer, Stéphane Le Roux, Nathan Thomasset:
Finite-Memory Strategies in Two-Player Infinite Games. CSL 2022: 8:1-8:16 - [c27]Benjamin Bordais, Patricia Bouyer, Stéphane Le Roux:
Playing (Almost-)Optimally in Concurrent Büchi and Co-Büchi Games. FSTTCS 2022: 33:1-33:18 - 2021
- [c26]Benjamin Bordais, Patricia Bouyer, Stéphane Le Roux:
From Local to Global Determinacy in Concurrent Graph Games. FSTTCS 2021: 41:1-41:14 - 2020
- [c25]Stéphane Le Roux:
Time-Aware Uniformization of Winning Strategies. CiE 2020: 193-204 - [c24]Patricia Bouyer, Stéphane Le Roux, Youssouf Oualhadj, Mickael Randour, Pierre Vandenhove:
Games Where You Can Play Optimally with Arena-Independent Finite Memory. CONCUR 2020: 24:1-24:22 - [c23]Nikolaos Alexopoulos, Emmanouil Vasilomanolakis, Stéphane Le Roux, Steven Rowe, Max Mühlhäuser:
TRIDEnT: towards a decentralized threat indicator marketplace. SAC 2020: 332-341 - 2018
- [c22]Stéphane Le Roux, Guillermo A. Pérez:
The Complexity of Graph-Based Reductions for Reachability in Markov Decision Processes. FoSSaCS 2018: 367-383 - [c21]Stéphane Le Roux, Arno Pauly, Mickael Randour:
Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions. FSTTCS 2018: 38:1-38:20 - [c20]Stéphane Le Roux:
Concurrent Games and Semi-Random Determinacy. MFCS 2018: 40:1-40:15 - 2017
- [c19]Véronique Bruyère, Stéphane Le Roux, Arno Pauly, Jean-François Raskin:
On the Existence of Weak Subgame Perfect Equilibria. FoSSaCS 2017: 145-161 - [c18]Suda Bharadwaj, Stéphane Le Roux, Guillermo A. Pérez, Ufuk Topcu:
Reduction Techniques for Model Checking and Learning in MDPs. IJCAI 2017: 4273-4279 - [c17]Stéphane Le Roux, Arno Pauly, Jean-François Raskin:
Minkowski Games. STACS 2017: 50:1-50:13 - [c16]Stéphane Le Roux, Érik Martin-Dorel, Jan-Georg Smaus:
An Existence Theorem of Nash Equilibrium in Coq and Isabelle. GandALF 2017: 46-60 - [c15]Thomas Brihaye, Gilles Geeraerts, Marion Hallet, Stéphane Le Roux:
Dynamics and Coalitions in Sequential Games. GandALF 2017: 136-150 - 2016
- [c14]Vasco Brattka, Stéphane Le Roux, Joseph S. Miller, Arno Pauly:
The Brouwer Fixed Point Theorem Revisited. CiE 2016: 58-67 - [c13]Volker Betz, Stéphane Le Roux:
Stable States of Perturbed Markov Chains. MFCS 2016: 18:1-18:14 - [c12]Stéphane Le Roux, Arno Pauly:
Extending Finite Memory Determinacy to Multiplayer Games. SR 2016: 27-40 - [c11]Stéphane Le Roux, Arno Pauly:
A Semi-Potential for Finite and Infinite Sequential Games (Extended Abstract). GandALF 2016: 242-256 - 2015
- [c10]Stéphane Le Roux, Arno Pauly:
Weihrauch Degrees of Finding Equilibria in Sequential Games. CiE 2015: 246-257 - [c9]Stéphane Le Roux:
Infinite Subgame Perfect Equilibrium in the Hausdorff Difference Hierarchy. TTCS 2015: 147-163 - 2014
- [c8]Stéphane Le Roux, Arno Pauly:
Infinite sequential games with real-valued payoffs. CSL-LICS 2014: 62:1-62:10 - 2013
- [c7]Stéphane Le Roux, Arno Pauly:
Closed Choice for Finite and for Convex Sets. CiE 2013: 294-305 - [c6]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:
A Machine-Checked Proof of the Odd Order Theorem. ITP 2013: 163-179 - 2012
- [c5]Vasco Brattka, Stéphane Le Roux, Arno Pauly:
On the Computational Content of the Brouwer Fixed Point Theorem. CiE 2012: 56-67 - 2010
- [c4]Eric Goubault, Stéphane Le Roux, Jeremy Leconte, Leo Liberti, Fabrizio Marinelli:
Static Analysis by Abstract Interpretation: A Mathematical Programming Approach. NSAD@SAS 2010: 73-87 - 2009
- [c3]Stéphane Le Roux:
Acyclic Preferences and Existence of Sequential Nash Equilibria: A Formal and Constructive Equivalence. TPHOLs 2009: 293-309 - 2008
- [c2]Stéphane Le Roux:
Graphs and Path Equilibria. AAIM 2008: 247-258 - 2007
- [c1]Stéphane Le Roux, Martin Ziegler:
Singular Coverings and Non-Uniform Notions of Closed Set Computability. CCA 2007: 73-88
Informal and Other Publications
- 2023
- [i29]Benjamin Bordais, Patricia Bouyer, Stéphane Le Roux:
Sub-game optimal strategies in concurrent games with prefix-independent objectives. CoRR abs/2301.10697 (2023) - [i28]Benjamin Bordais, Patricia Bouyer, Stéphane Le Roux:
From Local To Global Optimality in Concurrent Parity Games. CoRR abs/2311.14373 (2023) - 2022
- [i27]Benjamin Bordais, Patricia Bouyer, Stéphane Le Roux:
Playing (Almost-)Optimally in Concurrent Büchi and co-Büchi Games. CoRR abs/2203.06966 (2022) - 2021
- [i26]Benjamin Bordais, Patricia Bouyer, Stéphane Le Roux:
From local to global determinacy in concurrent graph games. CoRR abs/2107.04081 (2021) - [i25]Patricia Bouyer, Stéphane Le Roux, Nathan Thomasset:
Finite-memory strategies in two-player infinite games. CoRR abs/2107.09945 (2021) - [i24]Benjamin Bordais, Patricia Bouyer, Stéphane Le Roux:
Optimal strategies in concurrent reachability games. CoRR abs/2110.14724 (2021) - 2020
- [i23]Patricia Bouyer, Stéphane Le Roux, Youssouf Oualhadj, Mickael Randour, Pierre Vandenhove:
Games Where You Can Play Optimally with Finite Memory. CoRR abs/2001.03894 (2020) - 2019
- [i22]Nikolaos Alexopoulos, Emmanouil Vasilomanolakis, Stéphane Le Roux, Steven Rowe, Max Mühlhäuser:
TRIDEnT: Building Decentralized Incentives for Collaborative Security. CoRR abs/1905.03571 (2019) - [i21]Stéphane Le Roux:
Time-aware uniformization of winning strategies. CoRR abs/1907.05128 (2019) - 2018
- [i20]Stéphane Le Roux:
Memoryless Determinacy of Infinite Parity Games: Another Simple Proof. CoRR abs/1803.00655 (2018) - [i19]Stéphane Le Roux:
Concurrent games and semi-random determinacy. CoRR abs/1804.10896 (2018) - [i18]Stéphane Le Roux, Arno Pauly, Mickael Randour:
Extending finite-memory determinacy by Boolean combination of winning conditions. CoRR abs/1808.05791 (2018) - 2017
- [i17]Stéphane Le Roux, Guillermo A. Pérez:
The Complexity of Graph-Based Reductions for Reachability in Markov Decision Processes. CoRR abs/1710.07903 (2017) - 2016
- [i16]Stéphane Le Roux, Arno Pauly:
Extending finite memory determinacy: General techniques and an application to energy parity games. CoRR abs/1602.08912 (2016) - [i15]Stéphane Le Roux, Arno Pauly, Jean-François Raskin:
Minkowski games. CoRR abs/1609.07048 (2016) - [i14]Véronique Bruyère, Stéphane Le Roux, Arno Pauly, Jean-François Raskin:
On the existence of weak subgame perfect equilibria. CoRR abs/1612.01402 (2016) - 2015
- [i13]Stéphane Le Roux:
Infinite subgame perfect equilibrium in the Hausdorff difference hierarchy. CoRR abs/1505.06320 (2015) - [i12]Volker Betz, Stéphane Le Roux:
Stable states of perturbed Markov chains. CoRR abs/1508.05299 (2015) - 2014
- [i11]Stéphane Le Roux, Arno Pauly:
Infinite sequential games with real-valued payoffs. CoRR abs/1401.3325 (2014) - [i10]Stéphane Le Roux, Arno Pauly:
Weihrauch degrees of finding equilibria in sequential games. CoRR abs/1407.5587 (2014) - [i9]Stéphane Le Roux:
On terminating improvement in two-player games. CoRR abs/1409.6489 (2014) - 2013
- [i8]Stéphane Le Roux:
Lazy beats crazy: a spurious yet mathematical justification for laissez-faire. CoRR abs/1309.2798 (2013) - 2012
- [i7]Stéphane Le Roux:
From determinacy to Nash equilibrium. CoRR abs/1203.1866 (2012) - [i6]Vasco Brattka, Stéphane Le Roux, Arno Pauly:
Connected Choice and the Brouwer Fixed Point Theorem. CoRR abs/1206.4809 (2012) - 2008
- [i5]Stéphane Le Roux, Pierre Lescanne, René Vestergaard:
Conversion/Preference Games. CoRR abs/0811.0071 (2008) - 2007
- [i4]Stéphane Le Roux:
Acyclicity of Preferences, Nash Equilibria, and Subgame Perfect Equilibria: a Formal and Constructive Equivalence. CoRR abs/0705.3316 (2007) - [i3]Stéphane Le Roux:
Discrete Nondeterminism and Nash Equilibria for Strategy-Based Games. CoRR abs/0712.1519 (2007) - [i2]Stéphane Le Roux:
Graphs and Path Equilibria. CoRR abs/0712.1521 (2007) - 2006
- [i1]Stéphane Le Roux, Martin Ziegler:
Computable Closed Euclidean Subsets with and without Computable Points. CoRR abs/cs/0610080 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-02-08 23:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
