I7 Logo
Chair for Foundations of Software Reliability and Theoretical Computer Science
Informatik Logo TUM Logo
Publications - Strategy Complexity of Parity Objectives in Countable MDPs

Reference:

Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, and Patrick Totzke. Strategy complexity of parity objectives in countable MDPs. In Igor Konnov and Laura Kovács, editors, 31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference), volume 171 of LIPIcs, pages 39:1–39:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.

Suggested BibTeX entry:

@inproceedings{20KMST-CONCUR,
    author = {Stefan Kiefer and Richard Mayr and Mahsa Shirmohammadi and Patrick Totzke},
    booktitle = {31st International Conference on Concurrency Theory, {CONCUR} 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference)},
    editor = {Igor Konnov and Laura Kov{\'{a}}cs},
    pages = {39:1--39:17},
    publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
    series = {LIPIcs},
    title = {Strategy Complexity of Parity Objectives in Countable {MDP}s},
    volume = {171},
    year = {2020}
}

See doi.org ...