Published in: LIPIcs, Volume 311, 35th International Conference on Concurrency Theory (CONCUR 2024)
Marnix Suilen, Marck van der Vegt, and Sebastian Junges. A PSPACE Algorithm for Almost-Sure Rabin Objectives in Multi-Environment MDPs. In 35th International Conference on Concurrency Theory (CONCUR 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 311, pp. 40:1-40:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{suilen_et_al:LIPIcs.CONCUR.2024.40, author = {Suilen, Marnix and van der Vegt, Marck and Junges, Sebastian}, title = {{A PSPACE Algorithm for Almost-Sure Rabin Objectives in Multi-Environment MDPs}}, booktitle = {35th International Conference on Concurrency Theory (CONCUR 2024)}, pages = {40:1--40:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-339-3}, ISSN = {1868-8969}, year = {2024}, volume = {311}, editor = {Majumdar, Rupak and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2024.40}, URN = {urn:nbn:de:0030-drops-208120}, doi = {10.4230/LIPIcs.CONCUR.2024.40}, annote = {Keywords: Markov Decision Processes, partial observability, linear-time Objectives} }
Published in: LIPIcs, Volume 306, 49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024)
Benjamin Monmege, Julie Parreaux, and Pierre-Alain Reynier. Synthesis of Robust Optimal Real-Time Systems. In 49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 306, pp. 74:1-74:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{monmege_et_al:LIPIcs.MFCS.2024.74, author = {Monmege, Benjamin and Parreaux, Julie and Reynier, Pierre-Alain}, title = {{Synthesis of Robust Optimal Real-Time Systems}}, booktitle = {49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024)}, pages = {74:1--74:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-335-5}, ISSN = {1868-8969}, year = {2024}, volume = {306}, editor = {Kr\'{a}lovi\v{c}, Rastislav and Ku\v{c}era, Anton{\'\i}n}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2024.74}, URN = {urn:nbn:de:0030-drops-206304}, doi = {10.4230/LIPIcs.MFCS.2024.74}, annote = {Keywords: Weighted timed games, Algorithmic game theory, Robustness} }
Published in: LIPIcs, Volume 297, 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)
Mohan Dantam and Richard Mayr. Finite-Memory Strategies for Almost-Sure Energy-MeanPayoff Objectives in MDPs. In 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 297, pp. 133:1-133:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{dantam_et_al:LIPIcs.ICALP.2024.133, author = {Dantam, Mohan and Mayr, Richard}, title = {{Finite-Memory Strategies for Almost-Sure Energy-MeanPayoff Objectives in MDPs}}, booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)}, pages = {133:1--133:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-322-5}, ISSN = {1868-8969}, year = {2024}, volume = {297}, editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.133}, URN = {urn:nbn:de:0030-drops-202762}, doi = {10.4230/LIPIcs.ICALP.2024.133}, annote = {Keywords: Markov decision processes, energy, mean payoff, parity, strategy complexity} }
Published in: LIPIcs, Volume 250, 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)
Patricia Bouyer, Mickael Randour, and Pierre Vandenhove. The True Colors of Memory: A Tour of Chromatic-Memory Strategies in Zero-Sum Games on Graphs (Invited Talk). In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 250, pp. 3:1-3:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bouyer_et_al:LIPIcs.FSTTCS.2022.3, author = {Bouyer, Patricia and Randour, Mickael and Vandenhove, Pierre}, title = {{The True Colors of Memory: A Tour of Chromatic-Memory Strategies in Zero-Sum Games on Graphs}}, booktitle = {42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)}, pages = {3:1--3:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-261-7}, ISSN = {1868-8969}, year = {2022}, volume = {250}, editor = {Dawar, Anuj and Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.3}, URN = {urn:nbn:de:0030-drops-173957}, doi = {10.4230/LIPIcs.FSTTCS.2022.3}, annote = {Keywords: two-player games on graphs, finite-memory strategies, chromatic memory, parity automata, \omega-regularity} }
Published in: LIPIcs, Volume 203, 32nd International Conference on Concurrency Theory (CONCUR 2021)
Patricia Bouyer, Youssouf Oualhadj, Mickael Randour, and Pierre Vandenhove. Arena-Independent Finite-Memory Determinacy in Stochastic Games. In 32nd International Conference on Concurrency Theory (CONCUR 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 203, pp. 26:1-26:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{bouyer_et_al:LIPIcs.CONCUR.2021.26, author = {Bouyer, Patricia and Oualhadj, Youssouf and Randour, Mickael and Vandenhove, Pierre}, title = {{Arena-Independent Finite-Memory Determinacy in Stochastic Games}}, booktitle = {32nd International Conference on Concurrency Theory (CONCUR 2021)}, pages = {26:1--26:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-203-7}, ISSN = {1868-8969}, year = {2021}, volume = {203}, editor = {Haddad, Serge and Varacca, Daniele}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2021.26}, URN = {urn:nbn:de:0030-drops-144037}, doi = {10.4230/LIPIcs.CONCUR.2021.26}, annote = {Keywords: two-player games on graphs, stochastic games, Markov decision processes, finite-memory determinacy, optimal strategies} }
Published in: LIPIcs, Volume 171, 31st International Conference on Concurrency Theory (CONCUR 2020)
Patricia Bouyer, Stéphane Le Roux, Youssouf Oualhadj, Mickael Randour, and Pierre Vandenhove. Games Where You Can Play Optimally with Arena-Independent Finite Memory. In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 24:1-24:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{bouyer_et_al:LIPIcs.CONCUR.2020.24, author = {Bouyer, Patricia and Le Roux, St\'{e}phane and Oualhadj, Youssouf and Randour, Mickael and Vandenhove, Pierre}, title = {{Games Where You Can Play Optimally with Arena-Independent Finite Memory}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {24:1--24:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-160-3}, ISSN = {1868-8969}, year = {2020}, volume = {171}, editor = {Konnov, Igor and Kov\'{a}cs, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.24}, URN = {urn:nbn:de:0030-drops-128360}, doi = {10.4230/LIPIcs.CONCUR.2020.24}, annote = {Keywords: two-player games on graphs, finite-memory determinacy, optimal strategies} }
Published in: LIPIcs, Volume 140, 30th International Conference on Concurrency Theory (CONCUR 2019)
Thomas Brihaye, Florent Delgrange, Youssouf Oualhadj, and Mickael Randour. Life Is Random, Time Is Not: Markov Decision Processes with Window Objectives. In 30th International Conference on Concurrency Theory (CONCUR 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 140, pp. 8:1-8:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{brihaye_et_al:LIPIcs.CONCUR.2019.8, author = {Brihaye, Thomas and Delgrange, Florent and Oualhadj, Youssouf and Randour, Mickael}, title = {{Life Is Random, Time Is Not: Markov Decision Processes with Window Objectives}}, booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)}, pages = {8:1--8:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-121-4}, ISSN = {1868-8969}, year = {2019}, volume = {140}, editor = {Fokkink, Wan and van Glabbeek, Rob}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.8}, URN = {urn:nbn:de:0030-drops-109103}, doi = {10.4230/LIPIcs.CONCUR.2019.8}, annote = {Keywords: Markov decision processes, window mean-payoff, window parity} }
Published in: LIPIcs, Volume 118, 29th International Conference on Concurrency Theory (CONCUR 2018)
Rodica Condurache, Youssouf Oualhadj, and Nicolas Troquard. The Complexity of Rational Synthesis for Concurrent Games. In 29th International Conference on Concurrency Theory (CONCUR 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 118, pp. 38:1-38:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{condurache_et_al:LIPIcs.CONCUR.2018.38, author = {Condurache, Rodica and Oualhadj, Youssouf and Troquard, Nicolas}, title = {{The Complexity of Rational Synthesis for Concurrent Games}}, booktitle = {29th International Conference on Concurrency Theory (CONCUR 2018)}, pages = {38:1--38:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-087-3}, ISSN = {1868-8969}, year = {2018}, volume = {118}, editor = {Schewe, Sven and Zhang, Lijun}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2018.38}, URN = {urn:nbn:de:0030-drops-95766}, doi = {10.4230/LIPIcs.CONCUR.2018.38}, annote = {Keywords: Synthesis, concurrent games, Nash equilibria} }
Feedback for Dagstuhl Publishing