32 citations · 149 across the 42 of their papers we have counts for
4 papers · 1 filter
Approximating the Minimal Lookahead Needed to Win Infinite Games
Martin Zimmermann
We present an exponential-time algorithm approximating the minimal lookahead necessary to win an -regular delay game.
Optimal Strategies in Weighted Limit Games
Aniello Murano, Sasha Rubin, Martin Zimmermann
We prove the existence and computability of optimal strategies in weighted limit games, zero-sum infinite-duration games with a Büchi-style winning condition requiring to produce i…
Optimal Strategies in Weighted Limit Games (full version)
Aniello Murano, Sasha Rubin, Martin Zimmermann
We prove the existence and computability of optimal strategies in weighted limit games, zero-sum infinite-duration games with a Büchi-style winning condition requiring to produce i…
Good-for-games -Pushdown Automata
Karoliina Lehtinen, Martin Zimmermann
We introduce good-for-games -pushdown automata (-GFG-PDA). These are automata whose nondeterminism can be resolved based on the input processed so far. Good-for-gameness enab…