42 citations · 185 across the 35 of their papers we have counts for
4 papers · 1 filter
Good-for-MDPs Automata for Probabilistic Analysis and Reinforcement Learning
Ernst Moritz Hahn, Mateo Perez, Fabio Somenzi +3
We characterize the class of nondeterministic -automata that can be used for the analysis of finite Markov decision processes (MDPs). We call these automata `good-for-MDPs' (GFM…
Coordination Games on Weighted Directed Graphs
Krzysztof R. Apt, Sunil Simon, Dominik Wojtczak
We study strategic games on weighted directed graphs, in which the payoff of a player is defined as the sum of the weights on the edges from players who chose the same strategy, au…
Open Problems in a Logic of Gossips
Krzysztof R. Apt, Dominik Wojtczak
Gossip protocols are programs used in a setting in which each agent holds a secret and the aim is to reach a situation in which all agents know all secrets. Such protocols rely on…
Improving the complexity of Parys' recursive algorithm
Karoliina Lehtinen, Sven Schewe, Dominik Wojtczak
Parys has recently proposed a quasi-polynomial version of Zielonka's recursive algorithm for solving parity games. In this brief note we suggest a variation of his algorithm that i…