Showing 2024Show all
3 papers · 1 filter
cs.CC2024
A positional -complete objective
Antonio Casares, Pierre Ohlmann, Pierre Vandenhove
We study zero-sum, turn-based games on graphs. In this note, we show the existence of a game objective that is -complete for the Borel hierarchy and that is positiona…
cs.LO2024
Rank-decreasing transductions
Mikołaj Bojańczyk, Pierre Ohlmann
We propose to study transformations on graphs, and more generally structures, by looking at how the cut-rank (as introduced by Oum) of subsets is affected when going from the input…
cs.FL2024
Positional -regular languages
Antonio Casares, Pierre Ohlmann
In the context of two-player games over graphs, a language is called positional if, in all games using as winning objective, the protagonist can play optimally using positi…