Articles with public access mandates - Michael UmmelsLearn more
Available somewhere: 8
The complexity of Nash equilibria in infinite multiplayer games
M Ummels
International Conference on Foundations of Software Science and …, 2008
Mandates: German Research Foundation
Pure Nash Equilibria in Concurrent Deterministic Games
P Bouyer, R Brenguier, N Markey, M Ummels
arXiv preprint arXiv:1503.06826, 2015
Mandates: European Commission
Computing quantiles in Markov reward models
M Ummels, C Baier
International Conference on Foundations of Software Science and …, 2013
Mandates: German Research Foundation
The complexity of Nash equilibria in stochastic multiplayer games
M Ummels, D Wojtczak
Logical Methods in Computer Science 7 (3), 2011
Mandates: German Research Foundation
Playing stochastic games precisely
T Chen, V Forejt, M Kwiatkowska, A Simaitis, A Trivedi, M Ummels
International Conference on Concurrency Theory, 348-363, 2012
Mandates: German Research Foundation
The complexity of Nash equilibria in simple stochastic multiplayer games
M Ummels, D Wojtczak
International Colloquium on Automata, Languages, and Programming, 297-308, 2009
Mandates: German Research Foundation
Decision problems for Nash equilibria in stochastic games
M Ummels, D Wojtczak
International Workshop on Computer Science Logic, 515-529, 2009
Mandates: German Research Foundation
The Complexity of Quantitative Information Flow in Recursive Programs
R Chadha, M Ummels
IARCS Annual Conference on Foundations of Software Technology and …, 2012
Mandates: German Research Foundation
Publication and funding information is determined automatically by a computer program