Log In Sign Up

Half-Positional Objectives Recognized by Deterministic Büchi Automata

by   Patricia Bouyer, et al.

A central question in the theory of two-player games over graphs is to understand which objectives are half-positional, that is, which are the objectives for which the protagonist does not need memory to implement winning strategies. Objectives for which both players do not need memory have already been characterized (both in finite and infinite graphs). However, less is known about half-positional objectives. In particular, no characterization of half-positionality is known for the central class of omega-regular objectives. In this paper, we characterize objectives recognizable by deterministic Büchi automata (a class of omega-regular objectives) that are half-positional, in both finite and infinite graphs. Our characterization consists of three natural conditions linked to the language-theoretic notion of right congruence. Furthermore, this characterization yields a polynomial-time algorithm to decide half-positionality of an objective recognized by a given deterministic Büchi automaton.


page 7

page 10

page 11

page 15

page 17

page 21

page 32

page 34


Characterizing Omega-Regularity through Finite-Memory Determinacy of Games on Infinite Graphs

We consider zero-sum games on infinite graphs, with objectives specified...

Towards Generalised Half-Duplex Systems

FIFO automata are finite state machines communicating through FIFO queue...

How to Play Optimally for Regular Objectives?

This paper studies two-player zero-sum games played on graphs and makes ...

Games Where You Can Play Optimally with Finite Memory

For decades, two-player (antagonistic) games on graphs have been a frame...

Fractal dimensions of k-automatic sets

This paper seeks to build on the extensive connections that have arisen ...

New Algorithms for Combinations of Objectives using Separating Automata

The notion of separating automata was introduced by Bojanczyk and Czerwi...

Constrained Existence Problem for Weak Subgame Perfect Equilibria with ω-Regular Boolean Objectives

We study multiplayer turn-based games played on a finite directed graph ...