48 citations · 205 across the 8 of their papers we have counts for
8 papers
Pure Nash Equilibria in Concurrent Deterministic Games
Patricia Bouyer, Romain Brenguier, Nicolas Markey +1
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 ga…
Computing Quantiles in Markov Reward Models
Michael Ummels, Christel Baier
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 Complexity of Nash Equilibria in Limit-Average Games
Michael Ummels, Dominik Wojtczak
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 rand…
The Complexity of Nash Equilibria in Stochastic Multiplayer Games
Michael Ummels, Dominik Wojtczak
We analyse the computational complexity of finding Nash equilibria in turn-based stochastic multiplayer games with omega-regular objectives. We show that restricting the search spa…
Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited
Patricia Bouyer, Nicolas Markey, Jörg Olschewski +1
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…
The Complexity of Finding Reset Words in Finite Automata
Jörg Olschewski, Michael Ummels
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 ha…