
Subgameperfect Equilibria in Meanpayoff Games
In this paper, we provide an effective characterization of all the subga...
read it

Complexity of fixed point counting problems in Boolean Networks
A Boolean network (BN) with n components is a discrete dynamical system ...
read it

Constrained existence problem for weak subgame perfect equilibria with omegaregular Boolean objectives
We study multiplayer turnbased games played on a finite directed graph ...
read it

Constrained Existence Problem for Weak Subgame Perfect Equilibria with ωRegular Boolean Objectives
We study multiplayer turnbased games played on a finite directed graph ...
read it

Constrained existence problem for weak subgame perfect equilibria with omegaregular Boolean objectives (full version)
We study multiplayer turnbased games played on a finite directed graph ...
read it

Deciding Polynomial Termination Complexity for VASS Programs
We show that for every fixed k≥ 3, the problem whether the termination/c...
read it

Tarski's Theorem, Supermodular Games, and the Complexity of Equilibria
The use of monotonicity and Tarski's theorem in existence proofs of equi...
read it
On the Complexity of SPEs in Parity Games
We study the complexity of problems related to subgameperfect equilibria (SPEs) in infinite duration non zerosum multiplayer games played on finite graphs with parity objectives. We present new complexity results that close gaps in the literature. Our techniques are based on a recent characterization of SPEs in prefixindependent games that is grounded on the notions of requirements and negotiation, and according to which the plays supported by SPEs are exactly the plays consistent with the requirement that is the least fixed point of the negotiation function. The new results are as follows. First, checking that a given requirement is a fixed point of the negotiation function is an NPcomplete problem. Second, we show that the SPE constrained existence problem is NPcomplete, this problem was previously known to be ExpTimeeasy and NPhard. Third, the SPE constrained existence problem is fixedparameter tractable when the number of players and of colors are parameters. Fourth, deciding whether some requirement is the least fixed point of the negotiation function is complete for the second level of the Boolean hierarchy. Finally, the SPEverification problem – that is, the problem of deciding whether there exists a play supported by a SPE that satisfies some LTL formula – is PSpacecomplete, this problem was known to be ExpTimeeasy and PSpacehard.
READ FULL TEXT
Comments
There are no comments yet.