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 8, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)
Tomás Brázdil, Václav Brozek, and Kousha Etessami. One-Counter Stochastic Games. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010). Leibniz International Proceedings in Informatics (LIPIcs), Volume 8, pp. 108-119, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@InProceedings{brazdil_et_al:LIPIcs.FSTTCS.2010.108, author = {Br\'{a}zdil, Tom\'{a}s and Brozek, V\'{a}clav and Etessami, Kousha}, title = {{One-Counter Stochastic Games}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)}, pages = {108--119}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-23-1}, ISSN = {1868-8969}, year = {2010}, volume = {8}, editor = {Lodaya, Kamal and Mahajan, Meena}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.108}, URN = {urn:nbn:de:0030-drops-28571}, doi = {10.4230/LIPIcs.FSTTCS.2010.108}, annote = {Keywords: one-counter automata, simple stochastic games, Markov decision process, termination, limit, long run average reward} }
Published in: LIPIcs, Volume 3, 26th International Symposium on Theoretical Aspects of Computer Science (2009)
Tomas Brazdil, Vaclav Brozek, Antonin Kucera, and Jan Obdrzalek. Qualitative Reachability in Stochastic BPA Games. In 26th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 3, pp. 207-218, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{brazdil_et_al:LIPIcs.STACS.2009.1837, author = {Brazdil, Tomas and Brozek, Vaclav and Kucera, Antonin and Obdrzalek, Jan}, title = {{Qualitative Reachability in Stochastic BPA Games}}, booktitle = {26th International Symposium on Theoretical Aspects of Computer Science}, pages = {207--218}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-09-5}, ISSN = {1868-8969}, year = {2009}, volume = {3}, editor = {Albers, Susanne and Marion, Jean-Yves}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1837}, URN = {urn:nbn:de:0030-drops-18375}, doi = {10.4230/LIPIcs.STACS.2009.1837}, annote = {Keywords: Stochastic games, Reachability, Pushdown automata} }