2024/10/03 by Casares, Antonio, Ohlmann, Pierre, Vandenhove, Pierre · 1 citation
#Computational Complexity (cs.CC) #Computer Science and Game Theory (cs.GT) #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Logic in Computer Science (cs.LO)
paper · doi:10.48550/arxiv.2410.14688
We study zero-sum turn-based games on graphs. In this note, we show the existence of a game objective that is \mathbfΠ03-complete for the Borel hierarchy and that is positional, i.e., for which positional strategies suffice for the first player to win over arenas of arbitrary cardinality. To the best of our knowledge, this is the first known such objective; all previously known positional objectives are in \mathbfΣ03. The objective in question is a qualitative variant of the well-studied total-payoff objective, where the goal is to maximise the sum of weights.