Michael Ummels

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Solution concepts and algorithms for infinite multiplayer games	2018-01-03	Paper
The complexity of quantitative information flow in recursive programs	2017-01-26	Paper
Pure Nash equilibria in concurrent deterministic games Logical Methods in Computer Science	2015-08-25	Paper
Computing quantiles in Markov reward models Lecture Notes in Computer Science	2013-03-18	Paper
Playing stochastic games precisely Lecture Notes in Computer Science	2012-09-25	Paper
Nash equilibria in concurrent games with Büchi objectives	2012-08-31	Paper
Concurrent games with ordered objectives Foundations of Software Science and Computational Structures	2012-06-22	Paper
The complexity of Nash equilibria in stochastic multiplayer games Logical Methods in Computer Science	2012-04-02	Paper
Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited Automated Technology for Verification and Analysis	2011-10-07	Paper
The Complexity of Nash Equilibria in Limit-Average Games CONCUR 2011 – Concurrency Theory	2011-09-02	Paper
The complexity of finding reset words in finite automata Mathematical Foundations of Computer Science 2010	2010-09-03	Paper
Decision Problems for Nash Equilibria in Stochastic Games Computer Science Logic	2009-11-12	Paper
The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games Automata, Languages and Programming	2009-07-14	Paper
Rational Behaviour and Strategy Construction in Infinite Multiplayer Games FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science	2008-04-17	Paper
The Complexity of Nash Equilibria in Infinite Multiplayer Games Foundations of Software Science and Computational Structures	2008-04-11	Paper

Research outcomes over time

This page was built for person: Michael Ummels