Michael Ummels
Postdoctoral Researcher
Research Interests
- Formal verification
- Game theory
- Automata theory
Selected Publications
- Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited (with P. Bouyer, N. Markey and J. Olschewski). In Proceedings of the 9th International Symposium on Automated Technology for Verification and Analysis, ATVA 2011, vol. 6996 of LNCS, pp. 135–149. Springer-Verlag, 2011.
- The Complexity of Nash Equilibria in Stochastic Multiplayer Games (with D. Wojtczak). Logical Methods in Computer Science, 7(3). 2011.
- The Complexity of Nash Equilibria in Limit-Average Games (with D. Wojtczak). In Proceedings of the 22nd International Conference on Concurrency Theory, CONCUR 2011, vol. 6901 of LNCS, pp. 482–496. Springer-Verlag, 2011.
- Stochastic Multiplayer Games: Theory and Algorithms. PhD Thesis, RWTH Aachen University, 2010.
- The Complexity of Finding Reset Words in Finite Automata (with J. Olschewski). In Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS 2010, vol. 6281 of LNCS, pp. 568–579. Springer-Verlag, 2010.
- Decision Problems for Nash Equilibria in Stochastic Games (with D. Wojtczak). In Proceedings of the 18th Annual Conference of the European Association for Computer Science Logic, CSL '09, vol. 5771 of LNCS, pp. 515–530. Springer-Verlag, 2009.
- The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games (with D. Wojtczak). In Proceedings of the 36th International Colloquium on Automata, Languages and Programming, ICALP 2009, vol. 5556 of LNCS, pp. 297–308. Springer-Verlag, 2009.
- Solution Concepts and Algorithms for Infinite Multiplayer Games (with E. Grädel). In New Perspectives on Games and Interaction, vol. 4 of Texts in Logic and Games, pp. 151–178. Amsterdam University Press, 2008.
- The Complexity of Nash Equilibria in Infinite Multiplayer Games. In Proceedings of the 11th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2008, vol. 4962 of LNCS, pp. 20–34. Springer-Verlag, 2008.
- Rational Behaviour and Strategy Construction in Infinite Multiplayer Games. In Proceedings of the 26th International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2006, vol. 4337 of LNCS, pp. 212–223. Springer-Verlag, 2006.
More publications
My papers on arXiv/CoRR
My papers on DBLP
Selected Talks
- Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited, ATVA 2011, Taipei, Taiwan.
- The Complexity of Nash Equilibria in Limit-Average Games, CONCUR 2011, Aachen, Germany.
- The Complexity of Finding Reset Words in Finite Automata, LIAFA seminar on automata theory, Paris, France.
- Decision Problems for Nash Equilibria in Stochastic Games, CSL 2009, Coimbra, Portugal.
- The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games, ICALP 2009, Rhodes, Greece.
- The Complexity of Nash Equilibria in Infinite Multiplayer Games, FOSSACS 2008, Budapest, Hungary.
- Rational Behaviour and Strategy Construction in Infinite Multiplayer Games, FSTTCS 2006, Kolkata, India.
Software
- fdsymbol — A math symbol font.
- fedraserif — LaTeX support for the Fedra Serif Pro font family.
- ccicons — LaTeX support for Creative Commons icons.
