The Complexity of Pure Strategy Relevant Equilibria in Concurrent Games

We study rational synthesis problems for concurrent games with -regular objectives.Our model of rationality considers only pure strategy Nash equilibria that satisfy either a social welfare or Pareto optimality condition with respect to an -regular objective for each agent.This extends earlier work on equilibria in concurrent games, without consideration about their quality.Our results show that the existence of Nash equilibria satisfying social welfare conditions can be computed as efficiently as the constrained Nash equilibrium existence problem.On the other hand, the existence of Nash equilibria satisfying the Pareto optimality condition possibly involves a higher upper bound, except in the case of Bchi and Muller games, for which all three problems are in the classes P and PSPACE-complete, respectively.