Michael Ummels

Available identifiers

zbMath Open ummels.michaelMaRDI QIDQ2892778

List of research outcomes

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	2015-08-25	Paper
Computing quantiles in Markov reward models	2013-03-18	Paper
Playing stochastic games precisely	2012-09-25	Paper
Nash equilibria in concurrent games with Büchi objectives	2012-08-31	Paper
Concurrent games with ordered objectives	2012-06-22	Paper
The complexity of Nash equilibria in stochastic multiplayer games	2012-04-02	Paper
Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited	2011-10-07	Paper
The Complexity of Nash Equilibria in Limit-Average Games	2011-09-02	Paper
The complexity of finding reset words in finite automata	2010-09-03	Paper
Decision Problems for Nash Equilibria in Stochastic Games	2009-11-12	Paper
The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games	2009-07-14	Paper
Rational Behaviour and Strategy Construction in Infinite Multiplayer Games	2008-04-17	Paper
The Complexity of Nash Equilibria in Infinite Multiplayer Games	2008-04-11	Paper

Research outcomes over time

This page was built for person: Michael Ummels