2026-07-21T14:13:45Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:4380 2024-03-06T10:34:59Z ddc:004 open_access

Jumping Automata for Uniform Strategies Maubert, Bastien Pinchinat, Sophie Games Imperfect information Uniform strategies Jumping automata The concept of uniform strategies has recently been proposed as a relevant notion in game theory for computer science. It relies on properties involving sets of plays in two-player turn-based arenas equipped with a binary relation between plays. Among the two notions of fully-uniform and strictly-uniform strategies, we focus on the latter, less explored. We present a language that extends CTL^* with a quantifier over all related plays, which enables to express a rich class of uniformity constraints on strategies. We show that the existence of a uniform strategy is equivalent to the language non-emptiness of a jumping tree automaton. While the existence of a uniform strategy is undecidable for rational binary relations, restricting to ecognizable relations yields a 2EXPTIME-complete complexity, and still captures a class of two-player imperfect-information games with epistemic temporal objectives. This result relies on a translation from jumping tree automata with recognizable relations to two-way tree automata. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Bastien Maubert and Sophie Pinchinat 2013 Is Part Of LIPIcs, Volume 24, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.FSTTCS.2013.287 urn:nbn:de:0030-drops-43801 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.287 eng https://creativecommons.org/licenses/by/3.0/legalcode