License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSTTCS.2013.287
URN: urn:nbn:de:0030-drops-43801
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2013/4380/
Go to the corresponding LIPIcs Volume Portal

Maubert, Bastien ; Pinchinat, Sophie

Jumping Automata for Uniform Strategies

pdf-format:
21.pdf (0.5 MB)

Abstract

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.

BibTeX - Entry

@InProceedings{maubert_et_al:LIPIcs:2013:4380,
  author =	{Bastien Maubert and Sophie Pinchinat},
  title =	{{Jumping Automata for Uniform Strategies}},
  booktitle =	{IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)},
  pages =	{287--298},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-64-4},
  ISSN =	{1868-8969},
  year =	{2013},
  volume =	{24},
  editor =	{Anil Seth and Nisheeth K. Vishnoi},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2013/4380},
  URN =		{urn:nbn:de:0030-drops-43801},
  doi =		{10.4230/LIPIcs.FSTTCS.2013.287},
  annote =	{Keywords: Games, Imperfect information, Uniform strategies, Jumping automata}
}

Keywords: Games, Imperfect information, Uniform strategies, Jumping automata
Collection: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)
Issue Date: 2013
Date of publication: 10.12.2013

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI