two-player games on graphs; strategy complexity; regular languages; finite-memory strategies; NP-completeness
Abstract :
[en] 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 one of the two players is that eventually the sequence of colors along the play belongs to some regular language of 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.
These results are based on joint work with Patricia Bouyer, Nathanaël Fijalkow, and Mickael Randour.
Research center :
CREMMI - Modélisation mathématique et informatique
Disciplines :
Mathematics Computer science
Author, co-author :
Vandenhove, Pierre ; Université de Mons - UMONS > Faculté des Sciences > Service de Mathématiques effectives ; Université Paris-Saclay [FR] > Laboratoire Méthodes Formelles (LMF)
