Author of the publication

How to Play in Infinite MDPs (Invited Talk).

, , , , and . ICALP, volume 168 of LIPIcs, page 3:1-3:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)

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.

 

Other publications of authors with the same name

Simple Stochastic Games with Almost-Sure Energy-Parity Objectives are in NP and coNP., , , and . FoSSaCS, volume 12650 of Lecture Notes in Computer Science, page 427-447. Springer, (2021)Memoryless Strategies in Stochastic Reachability Games., , , and . CoRR, (2024)Minimal Cost Reachability/Coverability in Priced Timed Petri Nets., and . FoSSaCS, volume 5504 of Lecture Notes in Computer Science, page 348-363. Springer, (2009)Strategy Complexity of Parity Objectives in Countable MDPs., , , and . CONCUR, volume 171 of LIPIcs, page 39:1-39:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Efficient reduction of nondeterministic automata with application to language inclusion testing., and . Logical Methods in Computer Science, (2019)How to Play in Infinite MDPs (Invited Talk)., , , , and . ICALP, volume 168 of LIPIcs, page 3:1-3:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Transience in Countable MDPs., , , and . CoRR, (2020)Strategy Complexity of Point Payoff, Mean Payoff and Total Payoff Objectives in Countable MDPs., and . CoRR, (2022)Strategy Complexity of Point Payoff, Mean Payoff and Total Payoff Objectives in Countable MDPs., and . Log. Methods Comput. Sci., (2023)Strategy Complexity of Mean Payoff, Total Payoff and Point Payoff Objectives in Countable MDPs., and . CONCUR, volume 203 of LIPIcs, page 12:1-12:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)