Log In Sign Up

How to Play Optimally for Regular Objectives?

by   Patricia Bouyer, et al.

This paper studies two-player zero-sum games played on graphs and makes contributions toward the following question: given an objective, how much memory is required to play optimally for that objective? We study regular objectives, where the goal of the first player is that eventually the sequence of colors along the play belongs to some regular language over finite words. We obtain different characterizations of the chromatic memory requirements for such objectives for both players, from which we derive complexity-theoretic statements: deciding whether there exist small memory structures sufficient to play optimally is NP-complete for both players. Some of our characterization results apply to a more general class of objectives: topologically closed and topologically open sets.


page 1

page 2

page 3

page 4


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

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

Playing (Almost-)Optimally in Concurrent Büchi and co-Büchi Games

We study two-player concurrent stochastic games on finite graphs, with B...

Arena-Independent Finite-Memory Determinacy in Stochastic Games

We study stochastic zero-sum games on graphs, which are prevalent tools ...

Half-Positional Objectives Recognized by Deterministic Büchi Automata

A central question in the theory of two-player games over graphs is to u...

Games Where You Can Play Optimally with Finite Memory

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

Constrained existence problem for weak subgame perfect equilibria with omega-regular Boolean objectives

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

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

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