#### Filter Results:

- Full text PDF available (18)

#### Publication Year

2006

2018

- This year (1)
- Last 5 years (4)
- Last 10 years (18)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Michael Ummels, Dominik Wojtczak
- CONCUR
- 2011

We study the computational complexity of Nash equilibria in concurrent games with limit-average objectives. In particular, we prove that the existence of a Nash equilibrium in randomised strategiesâ€¦ (More)

- Michael Ummels
- 2008

We survey and discuss several solution concepts for infinite turn-based multiplayer games with qualitative (i.e. win-lose) objectives of the players. These games generalise in a natural way theâ€¦ (More)

We study nondeterministic strategies in parity games with the aim of computing a most permissive winning strategy. Following earlier work, we measure permissiveness in terms of the averageâ€¦ (More)

- Patricia Bouyer, Romain Brenguier, Nicolas Markey, Michael Ummels
- Logical Methods in Computer Science
- 2015

We study pure-strategy Nash equilibria in multi-player concurrent deterministic games, for a variety of preference relations. We provide a novel construction, called the suspect game, whichâ€¦ (More)

- Michael Ummels, Christel Baier
- FoSSaCS
- 2013

Probabilistic model checking mainly concentrates on techniques for reasoning about the probabilities of certain path properties or expected values of certain random variables. For the quantitativeâ€¦ (More)

- JÃ¶rg Olschewski, Michael Ummels
- MFCS
- 2010

We study several problems related to finding reset words in deterministic finite automata. In particular, we establish that the problem of deciding whether a shortest reset word has length k isâ€¦ (More)

We study stochastic two-player games where the goal of one player is to achieve precisely a given expected value of the objective function, while the goal of the opponent is the opposite. Potentialâ€¦ (More)

- Patricia Bouyer, Romain Brenguier, Nicolas Markey, Michael Ummels
- FoSSaCS
- 2012

We consider concurrent games played on graphs, in which each player has several qualitative (e.g. reachability or BÃ¼chi) objectives, and a preorder on these objectives (for instance the countingâ€¦ (More)

- Patricia Bouyer, Romain Brenguier, Nicolas Markey, Michael Ummels
- FSTTCS
- 2011

We study the problem of computing pure-strategy Nash equilibria in multiplayer concurrent games with BÃ¼chi-definable objectives. First, when the objectives are BÃ¼chi conditions on the game, we proveâ€¦ (More)

- Michael Ummels, Dominik Wojtczak
- Logical Methods in Computer Science
- 2009

We analyse the computational complexity of finding Nash equilibria in stochastic multiplayer games with Ï‰-regular objectives. We show that restricting the search space to equilibria whose payoffsâ€¦ (More)