10 citations · 17 across the 14 of their papers we have counts for
4 papers · 2 filters
Positionality in and a completeness result
Pierre Ohlmann, Michał Skrzypczak
We study the existence of positional strategies for the protagonist in infinite duration games over arbitrary game graphs. We prove that prefix-independent objectives in wh…
Positionality of mean-payoff games on infinite graphs
Pierre Ohlmann
This short note establishes positionality of mean-payoff games over infinite game graphs by constructing a well-founded monotone universal graph.
Canonical decompositions in monadically stable and bounded shrubdepth graph classes
Pierre Ohlmann, Michał Pilipczul, Szymon Toruńczyk +1
We use model-theoretic tools originating from stability theory to derive a result we call the Finitary Substitute Lemma, which intuitively says the following. Suppose we work in a…
Flipper games for monadically stable graph classes
Jakub Gajarský, Nikolas Mählmann, Rose McCarty +6
A class of graphs is monadically stable if for any unary expansion of , one cannot interpret, in first-order logic, arbitrarily l…