The Complexity of Synthesizing Uniform Strategies - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

The Complexity of Synthesizing Uniform Strategies

Bastien Maubert
  • Function : Author
  • PersonId : 911207
Laura Bozzelli
  • Function : Author
  • PersonId : 911812


We investigate uniformity properties of strategies. These properties involve sets of plays in order to express useful constraints on strategies that are not \mu-calculus definable. Typically, we can state that a strategy is observation-based. We propose a formal language to specify uniformity properties, interpreted over two-player turn-based arenas equipped with a binary relation between plays. This way, we capture e.g. games with winning conditions expressible in epistemic temporal logic, whose underlying equivalence relation between plays reflects the observational capabilities of agents (for example, synchronous perfect recall). Our framework naturally generalizes many other situations from the literature. We establish that the problem of synthesizing strategies under uniformity constraints based on regular binary relations between plays is non-elementary complete.

Dates and versions

hal-01098745 , version 1 (29-12-2014)



Bastien Maubert, Sophie Pinchinat, Laura Bozzelli. The Complexity of Synthesizing Uniform Strategies. 1st International Workshop on Strategic Reasoning, {SR} 2013, Mar 2013, Rome, Italy. pp.8, ⟨10.4204/EPTCS.112.17⟩. ⟨hal-01098745⟩
133 View
0 Download



Gmail Facebook X LinkedIn More