( en | de | ru )

 

Disambiguation of "Roux, Stéphane Le"

Author of the publication

copydeleteadd this publication to your clipboard
Sub-game optimal strategies in concurrent games with prefix-independent objectives.

, , and . CoRR, (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Johan Le Roux

Gaël Le Roux

Hermanus Hendrik Le Roux

Stéphane Haussler

Stéphane Klein

 

Other publications of authors with the same name

Acyclic Preferences and Existence of Sequential Nash Equilibria: A Formal and Constructive Equivalence.. TPHOLs, volume 5674 of Lecture Notes in Computer Science, page 293-309. Springer, (2009)Dynamics and Coalitions in Sequential Games., , , and . GandALF, volume 256 of EPTCS, page 136-150. (2017)Convergence stability and estimator in orbital free electronic structure calculation on a grid at finite temperature., and . J. Comput. Phys., 226 (2): 2063-2077 (2007)Subgame Optimal Strategies in Finite Concurrent Games with Prefix-Independent Objectives., , and . FoSSaCS, volume 13992 of Lecture Notes in Computer Science, page 541-560. Springer, (2023)Recent developments in the ABINIT software package., , , , , , , , , and 45 other author(s). Comput. Phys. Commun., (2016)Reduction Techniques for Model Checking and Learning in MDPs., , , and . IJCAI, page 4273-4279. ijcai.org, (2017)The Complexity of Graph-Based Reductions for Reachability in Markov Decision Processes., and . FoSSaCS, volume 10803 of Lecture Notes in Computer Science, page 367-383. Springer, (2018)From Local to Global Determinacy in Concurrent Graph Games., , and . FSTTCS, volume 213 of LIPIcs, page 41:1-41:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Optimal Strategies in Concurrent Reachability Games., , and . CSL, volume 216 of LIPIcs, page 7:1-7:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Singular coverings and non-uniform notions of closed set computability., and . Math. Log. Q., 54 (5): 545-560 (2008)