DeepAI
Log In Sign Up

Constrained existence problem for weak subgame perfect equilibria with omega-regular Boolean objectives (full version)

06/14/2018
by   Thomas Brihaye, et al.
0

We study multiplayer turn-based games played on a finite directed graph such that each player aims at satisfying an omega-regular Boolean objective. Instead of the well-known notions of Nash equilibrium (NE) and subgame perfect equilibrium (SPE), we focus on the recent notion of weak subgame perfect equilibrium (weak SPE), a refinement of SPE. In this setting, players who deviate can only use the subclass of strategies that differ from the original one on a finite number of histories. We are interested in the constrained existence problem for weak SPEs. We provide a complete characterization of the computational complexity of this problem: it is P-complete for Explicit Muller objectives, NP-complete for Co-Büchi, Parity, Muller, Rabin, and Streett objectives, and PSPACE-complete for Reachability and Safety objectives (we only prove NP-membership for Büchi objectives). We also show that the constrained existence problem is fixed parameter tractable and is polynomial when the number of players is fixed. All these results are based on a fine analysis of a fixpoint algorithm that computes the set of possible payoff profiles underlying weak SPEs.

READ FULL TEXT
06/14/2018

Constrained existence problem for weak subgame perfect equilibria with omega-regular Boolean objectives

We study multiplayer turn-based games played on a finite directed graph ...
09/10/2018

Constrained Existence Problem for Weak Subgame Perfect Equilibria with ω-Regular Boolean Objectives

We study multiplayer turn-based games played on a finite directed graph ...
06/18/2020

On Subgame Perfect Equilibria in Turn-Based Reachability Timed Games

We study multiplayer turn-based timed games with reachability objectives...
05/02/2019

The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games (full version)

We study multiplayer quantitative reachability games played on a finite ...
07/15/2021

On the Complexity of SPEs in Parity Games

We study the complexity of problems related to subgame-perfect equilibri...
08/13/2020

Equilibria for Games with Combined Qualitative and Quantitative Objectives

The overall aim of our research is to develop techniques to reason about...
03/16/2022

Subgame-perfect Equilibria in Mean-payoff Games (journal version)

In this paper, we provide an effective characterization of all the subga...