default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMickael Randour
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]James C. A. Main
, Mickael Randour:
Different strokes in randomised strategies: Revisiting Kuhn's theorem under finite-memory assumptions. Inf. Comput. 301: 105229 (2024)- [j12]Patricia Bouyer, Antonio Casares, Mickael Randour, Pierre Vandenhove:
Half-Positional Objectives Recognized by Deterministic Büchi Automata. Log. Methods Comput. Sci. 20(3) (2024) - 2023
- [j11]Patricia Bouyer, Youssouf Oualhadj, Mickael Randour, Pierre Vandenhove:
Arena-Independent Finite-Memory Determinacy in Stochastic Games. Log. Methods Comput. Sci. 19(4) (2023) - [j10]Patricia Bouyer, Mickael Randour, Pierre Vandenhove:
Characterizing Omega-Regularity through Finite-Memory Determinacy of Games on Infinite Graphs. TheoretiCS 2 (2023) - [c30]Thomas Brihaye, Aline Goeminne, James C. A. Main, Mickael Randour:
Reachability Games and Friends: A Journey Through the Lens of Memory and Complexity (Invited Talk). FSTTCS 2023: 1:1-1:26 - [c29]Patricia Bouyer, Nathanaël Fijalkow, Mickael Randour, Pierre Vandenhove:
How to Play Optimally for Regular Objectives? ICALP 2023: 118:1-118:18 - [c28]Patricia Bouyer, Antonio Casares, Mickael Randour, Pierre Vandenhove:
Half-Positional Objectives Recognized by Deterministic Büchi Automata (Extended Abstract). IJCAI 2023: 6420-6425 - [i27]Nathanaël Fijalkow, Nathalie Bertrand, Patricia Bouyer-Decitre, Romain Brenguier, Arnaud Carayol, John Fearnley, Hugo Gimbert, Florian Horn, Rasmus Ibsen-Jensen, Nicolas Markey, Benjamin Monmege, Petr Novotný, Mickael Randour, Ocan Sankur, Sylvain Schmitz, Olivier Serre, Mateusz Skomra:
Games on Graphs. CoRR abs/2305.10546 (2023) - 2022
- [j9]Luca Aceto, Orna Kupferman, Mickael Randour, Davide Sangiorgi:
Interviews with the 2022 CONCUR Test-of-Time Award Recipients. Bull. EATCS 138 (2022) - [j8]Patricia Bouyer, Thomas Brihaye, Mickael Randour, Cédric Rivière, Pierre Vandenhove:
Decisiveness of stochastic systems and its application to hybrid models. Inf. Comput. 289(Part): 104861 (2022) - [j7]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) - [c27]Ilaria Castellani, Paul Gastin, Orna Kupferman, Mickael Randour, Davide Sangiorgi:
CONCUR Test-Of-Time Award 2022 (Invited Paper). CONCUR 2022: 1:1-1:3 - [c26]Patricia Bouyer, Antonio Casares, Mickael Randour, Pierre Vandenhove:
Half-Positional Objectives Recognized by Deterministic Büchi Automata. CONCUR 2022: 20:1-20:18 - [c25]James C. A. Main, Mickael Randour:
Different Strokes in Randomised Strategies: Revisiting Kuhn's Theorem Under Finite-Memory Assumptions. CONCUR 2022: 22:1-22:18 - [c24]James C. A. Main, Mickael Randour, Jeremy Sproston:
Timed Games with Bounded Window Parity Objectives. FORMATS 2022: 165-182 - [c23]Patricia Bouyer, Mickael Randour, Pierre Vandenhove:
The True Colors of Memory: A Tour of Chromatic-Memory Strategies in Zero-Sum Games on Graphs (Invited Talk). FSTTCS 2022: 3:1-3:18 - [c22]Patricia Bouyer, Mickael Randour, Pierre Vandenhove:
Characterizing Omega-Regularity Through Finite-Memory Determinacy of Games on Infinite Graphs. STACS 2022: 16:1-16:16 - [i26]James C. A. Main, Mickael Randour:
Different strokes in randomised strategies: Revisiting Kuhn's theorem under finite-memory assumptions. CoRR abs/2201.10825 (2022) - [i25]Patricia Bouyer, Antonio Casares, Mickael Randour, Pierre Vandenhove:
Half-Positional Objectives Recognized by Deterministic Büchi Automata. CoRR abs/2205.01365 (2022) - [i24]James C. A. Main, Mickael Randour, Jeremy Sproston:
Timed Games with Bounded Window Parity Objectives. CoRR abs/2205.04197 (2022) - [i23]Patricia Bouyer, Nathanaël Fijalkow, Mickael Randour, Pierre Vandenhove:
How to Play Optimally for Regular Objectives? CoRR abs/2210.09703 (2022) - 2021
- [c21]James C. A. Main, Mickael Randour, Jeremy Sproston:
Time Flies When Looking out of the Window: Timed Games with Window Parity Objectives. CONCUR 2021: 25:1-25:16 - [c20]Patricia Bouyer, Youssouf Oualhadj, Mickael Randour, Pierre Vandenhove:
Arena-Independent Finite-Memory Determinacy in Stochastic Games. CONCUR 2021: 26:1-26:18 - [i22]Patricia Bouyer, Youssouf Oualhadj, Mickael Randour, Pierre Vandenhove:
Arena-Independent Finite-Memory Determinacy in Stochastic Games. CoRR abs/2102.10104 (2021) - [i21]James C. A. Main, Mickael Randour, Jeremy Sproston:
Time Flies When Looking out of the Window: Timed Games with Window Parity Objectives. CoRR abs/2105.06686 (2021) - [i20]Patricia Bouyer, Mickael Randour, Pierre Vandenhove:
Characterizing Omega-Regularity through Finite-Memory Determinacy of Games on Infinite Graphs. CoRR abs/2110.01276 (2021) - 2020
- [j6]Thomas Brihaye, Florent Delgrange, Youssouf Oualhadj, Mickael Randour:
Life is Random, Time is Not: Markov Decision Processes with Window Objectives. Log. Methods Comput. Sci. 16(4) (2020) - [c19]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 - [c18]Florent Delgrange, Joost-Pieter Katoen, Tim Quatmann, Mickael Randour:
Simple Strategies in Multi-Objective MDPs. TACAS (1) 2020: 346-364 - [c17]Patricia Bouyer, Thomas Brihaye, Mickael Randour, Cédric Rivière, Pierre Vandenhove:
Decisiveness of Stochastic Systems and its Application to Hybrid Models. GandALF 2020: 149-165 - [i19]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) - [i18]Patricia Bouyer, Thomas Brihaye, Mickael Randour, Cédric Rivière, Pierre Vandenhove:
Decisiveness of Stochastic Systems and its Application to Hybrid Models (Full Version). CoRR abs/2009.13152 (2020)
2010 – 2019
- 2019
- [c16]Thomas Brihaye, Florent Delgrange, Youssouf Oualhadj, Mickael Randour:
Life Is Random, Time Is Not: Markov Decision Processes with Window Objectives. CONCUR 2019: 8:1-8:18 - [c15]Véronique Bruyère, Quentin Hautem, Mickael Randour, Jean-François Raskin:
Energy Mean-Payoff Games. CONCUR 2019: 21:1-21:17 - [i17]Thomas Brihaye, Florent Delgrange, Youssouf Oualhadj, Mickael Randour:
Life is Random, Time is Not: Markov Decision Processes with Window Objectives. CoRR abs/1901.03571 (2019) - [i16]Véronique Bruyère, Quentin Hautem, Mickael Randour, Jean-François Raskin:
Energy mean-payoff games. CoRR abs/1907.01359 (2019) - [i15]Florent Delgrange, Joost-Pieter Katoen, Tim Quatmann, Mickael Randour:
Simple Strategies in Multi-Objective MDPs (Technical Report). CoRR abs/1910.11024 (2019) - 2018
- [j5]Patricia Bouyer, Nicolas Markey, Mickael Randour, Kim G. Larsen, Simon Laursen:
Average-energy games. Acta Informatica 55(2): 91-127 (2018) - [c14]Stéphane Le Roux, Arno Pauly, Mickael Randour:
Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions. FSTTCS 2018: 38:1-38:20 - [c13]Patricia Bouyer, Mauricio González, Nicolas Markey, Mickael Randour:
Multi-weighted Markov Decision Processes with Reachability Objectives. GandALF 2018: 250-264 - [i14]Stéphane Le Roux, Arno Pauly, Mickael Randour:
Extending finite-memory determinacy by Boolean combination of winning conditions. CoRR abs/1808.05791 (2018) - 2017
- [j4]Mickael Randour, Jean-François Raskin, Ocan Sankur:
Percentile queries in multi-dimensional Markov decision processes. Formal Methods Syst. Des. 50(2-3): 207-248 (2017) - [j3]Véronique Bruyère, Emmanuel Filiot, Mickael Randour, Jean-François Raskin:
Meet your expectations with guarantees: Beyond worst-case synthesis in quantitative games. Inf. Comput. 254: 259-295 (2017) - [c12]Patricia Bouyer, Piotr Hofman, Nicolas Markey, Mickael Randour, Martin Zimmermann:
Bounding Average-Energy Games. FoSSaCS 2017: 179-195 - [c11]Raphaël Berthon, Mickael Randour, Jean-François Raskin:
Threshold Constraints with Guarantees for Parity Objectives in Markov Decision Processes. ICALP 2017: 121:1-121:15 - [i13]Raphaël Berthon, Mickael Randour, Jean-François Raskin:
Threshold Constraints with Guarantees for Parity Objectives in Markov Decision Processes. CoRR abs/1702.05472 (2017) - 2016
- [c10]Patricia Bouyer, Nicolas Markey, Mickael Randour, Arnaud Sangnier, Daniel Stan:
Reachability in Networks of Register Protocols under Stochastic Schedulers. ICALP 2016: 106:1-106:14 - [c9]Romain Brenguier, Lorenzo Clemente, Paul Hunter, Guillermo A. Pérez, Mickael Randour, Jean-François Raskin, Ocan Sankur, Mathieu Sassolas:
Non-Zero Sum Games for Reactive Synthesis. LATA 2016: 3-23 - [c8]Véronique Bruyère, Quentin Hautem, Mickael Randour:
Window parity games: an alternative approach toward parity games with time bounds. GandALF 2016: 135-148 - [i12]Patricia Bouyer, Nicolas Markey, Mickael Randour, Arnaud Sangnier, Daniel Stan:
Reachability in Networks of Register Protocols under Stochastic Schedulers. CoRR abs/1602.05928 (2016) - [i11]Mickael Randour:
Reconciling Rationality and Stochasticity: Rich Behavioral Models in Two-Player Games. CoRR abs/1603.05072 (2016) - [i10]Véronique Bruyère, Quentin Hautem, Mickael Randour:
Window Parity Games: An Alternative Approach Toward Parity Games with Time Bounds (Full Version). CoRR abs/1609.05952 (2016) - [i9]Patricia Bouyer, Piotr Hofman, Nicolas Markey, Mickael Randour, Martin Zimmermann:
Bounding Average-energy Games. CoRR abs/1610.07858 (2016) - 2015
- [j2]Krishnendu Chatterjee, Laurent Doyen, Mickael Randour, Jean-François Raskin:
Looking at mean-payoff and total-payoff through windows. Inf. Comput. 242: 25-52 (2015) - [c7]Mickael Randour, Jean-François Raskin, Ocan Sankur:
Percentile Queries in Multi-dimensional Markov Decision Processes. CAV (1) 2015: 123-139 - [c6]Mickael Randour, Jean-François Raskin, Ocan Sankur:
Variations on the Stochastic Shortest Path Problem. VMCAI 2015: 1-18 - [c5]Patricia Bouyer, Nicolas Markey, Mickael Randour, Kim Guldstrand Larsen, Simon Laursen:
Average-energy games. GandALF 2015: 1-15 - [i8]Romain Brenguier, Lorenzo Clemente, Paul Hunter, Guillermo A. Pérez, Mickael Randour, Jean-François Raskin, Ocan Sankur, Mathieu Sassolas:
Non-Zero Sum Games for Reactive Synthesis. CoRR abs/1512.05568 (2015) - [i7]Patricia Bouyer, Nicolas Markey, Mickael Randour, Kim G. Larsen, Simon Laursen:
Average-energy games (full version). CoRR abs/1512.08106 (2015) - 2014
- [j1]Krishnendu Chatterjee, Mickael Randour, Jean-François Raskin:
Strategy synthesis for multi-dimensional quantitative objectives. Acta Informatica 51(3-4): 129-163 (2014) - [c4]Véronique Bruyère, Emmanuel Filiot, Mickael Randour, Jean-François Raskin:
Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games. STACS 2014: 199-213 - [c3]Véronique Bruyère, Emmanuel Filiot, Mickael Randour, Jean-François Raskin:
Expectations or Guarantees? I Want It All! A crossroad between games and MDPs. SR 2014: 1-8 - [i6]Mickael Randour, Jean-François Raskin, Ocan Sankur:
Percentile Queries in Multi-Dimensional Markov Decision Processes. CoRR abs/1410.4801 (2014) - [i5]Mickael Randour, Jean-François Raskin, Ocan Sankur:
Variations on the Stochastic Shortest Path Problem. CoRR abs/1411.0835 (2014) - 2013
- [c2]Krishnendu Chatterjee, Laurent Doyen, Mickael Randour, Jean-François Raskin:
Looking at Mean-Payoff and Total-Payoff through Windows. ATVA 2013: 118-132 - [i4]Krishnendu Chatterjee, Laurent Doyen, Mickael Randour, Jean-François Raskin:
Looking at Mean-Payoff and Total-Payoff through Windows. CoRR abs/1302.4248 (2013) - [i3]Véronique Bruyère, Emmanuel Filiot, Mickael Randour, Jean-François Raskin:
Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games. CoRR abs/1309.5439 (2013) - 2012
- [c1]Krishnendu Chatterjee, Mickael Randour, Jean-François Raskin:
Strategy Synthesis for Multi-Dimensional Quantitative Objectives. CONCUR 2012: 115-131 - [i2]Krishnendu Chatterjee, Mickael Randour, Jean-François Raskin:
Strategy Synthesis for Multi-dimensional Quantitative Objectives. CoRR abs/1201.5073 (2012) - [i1]Mickael Randour:
Automated synthesis of reliable and efficient systems through game theory: a case study. CoRR abs/1204.3283 (2012)
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-12-02 22:26 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:
