Secure Equilibrium with Constraints

• The paper introduces a precise characterization of secure equilibrium with constraints, reducing the problem to nested winning-region computations in multi-player ω-regular games.
• It establishes decidability and provides exact complexity bounds for Büchi, co-Büchi, parity, and Muller objectives through constructive algorithmic procedures.
• The framework refines Nash equilibrium by incorporating retaliation-safe strategies that prevent unilateral deviations, ensuring the prescribed winners–losers pattern is achieved.

Searching arXiv for the named paper and closely related secure-equilibrium literature to ground the article in cited papers. Secure equilibrium with constraints is the decision-theoretic and algorithmic problem of determining whether a multi-player non-zero-sum turn-based game on a finite directed graph admits a secure equilibrium realizing a prescribed payoff profile. In the qualitative setting studied for $\omega$-regular objectives, the constraint is a Boolean vector $v \in \{0,1\}^n$ specifying which players must win and which must lose, and the equilibrium concept refines Nash equilibrium by ruling out unilateral deviations that either improve the deviator’s own payoff or, when the deviator’s payoff is unchanged, decrease another player’s payoff. The 2025 characterization of this problem gives a reduction to winning-region computations and establishes decidability and precise complexity bounds for Büchi, co-Büchi, parity, and Muller objectives (Mizuno et al., 2 Sep 2025).

1. Formal setting and equilibrium notion

An $n$-player game arena is defined as $A = (S, (S_i)_{i \in [1,n]}, E)$, where $S$ is a finite set of states, $S = \biguplus_{i=1}^{n} S_i$, each $S_i$ is the set of states controlled by player $i$, and $E \subseteq S \times S$ is the transition relation. A play is an infinite sequence $\rho = s_0 s_1 \ldots \in S^\omega$ such that $v \in \{0,1\}^n$0 for all $v \in \{0,1\}^n$1. Each player $v \in \{0,1\}^n$2 is assigned a winning objective $v \in \{0,1\}^n$3. The objective classes explicitly considered include Büchi, co-Büchi, parity, Streett, Rabin, and Muller objectives (Mizuno et al., 2 Sep 2025).

A strategy for player $v \in \{0,1\}^n$4 is a function $v \in \{0,1\}^n$5 selecting the next state at positions controlled by $v \in \{0,1\}^n$6. For a strategy profile $v \in \{0,1\}^n$7 and start state $v \in \{0,1\}^n$8, there is a unique induced play $v \in \{0,1\}^n$9. The payoff profile under objectives $n$0 is

$n$1

Secure equilibrium is defined through a player-specific preorder on Boolean payoff vectors. For payoff profiles $n$2, player $n$3 prefers $n$4 to $n$5 when

$n$6

Thus player $n$7 first maximizes her own payoff and, if her own component is unchanged, prefers outcomes in which another player’s payoff is decreased and no other payoff is increased. A strategy profile $n$8 is a secure equilibrium at state $n$9 if, for every player $A = (S, (S_i)_{i \in [1,n]}, E)$0, there is no alternative strategy $A = (S, (S_i)_{i \in [1,n]}, E)$1 such that

$A = (S, (S_i)_{i \in [1,n]}, E)$2

This refines Nash equilibrium by also protecting against unilateral deviations that harm others, not only against deviations that improve the deviator’s own value (Mizuno et al., 2 Sep 2025).

2. The constrained existence problem

The central decision problem asks whether a secure equilibrium exists with a specified Boolean payoff vector. Formally, given a game $A = (S, (S_i)_{i \in [1,n]}, E)$3, a starting state $A = (S, (S_i)_{i \in [1,n]}, E)$4, and a payoff profile $A = (S, (S_i)_{i \in [1,n]}, E)$5, the question is whether there exists a secure equilibrium $A = (S, (S_i)_{i \in [1,n]}, E)$6 at $A = (S, (S_i)_{i \in [1,n]}, E)$7 such that

$A = (S, (S_i)_{i \in [1,n]}, E)$8

The payoff profile $A = (S, (S_i)_{i \in [1,n]}, E)$9 acts as the constraint: $S$0 specifies that player $S$1 must win, and $S$2 specifies that player $S$3 must lose (Mizuno et al., 2 Sep 2025).

This formulation differs from unconstrained equilibrium existence. The unconstrained question asks only whether some secure equilibrium exists; the constrained question fixes the equilibrium outcome class in advance. In the 2025 treatment, this is the setting in which decidability and complexity are analyzed systematically for multi-player games with qualitative $S$4-regular objectives, and it is identified as the first general characterization and complexity analysis for the constrained, payoff-specified case (Mizuno et al., 2 Sep 2025).

The constrained formulation is especially natural in Boolean games because the payoff vector directly encodes a winners-versus-losers pattern. A plausible implication is that the specification $S$5 serves as a compact contract over admissible equilibrium outcomes: the analysis is not merely about strategic stability, but about strategic stability under a designated qualitative outcome profile.

3. Characterization by retaliation-safe regions

The main technical reduction is expressed through winning regions. For a constraint $S$6, let

$S$7

$S$8

and let $S$9 be the full player set. The set $S = \biguplus_{i=1}^{n} S_i$0 of safe states is defined so that, for each player $S = \biguplus_{i=1}^{n} S_i$1, the other players can cooperate to prevent $S = \biguplus_{i=1}^{n} S_i$2 from improving beyond the prescribed payoff profile: $S = \biguplus_{i=1}^{n} S_i$3 Here, $S = \biguplus_{i=1}^{n} S_i$4 denotes the set of states from which players in $S = \biguplus_{i=1}^{n} S_i$5 can cooperate to ensure objective $S = \biguplus_{i=1}^{n} S_i$6 (Mizuno et al., 2 Sep 2025).

The final winning region for constrained secure equilibrium is then

$S = \biguplus_{i=1}^{n} S_i$7

where $S = \biguplus_{i=1}^{n} S_i$8 is the winning region for all players in the sub-arena restricted to $S = \biguplus_{i=1}^{n} S_i$9. The key characterization theorem states: $S_i$0 This theorem reduces the constrained secure-equilibrium existence problem to nested winning-region computations in finite games (Mizuno et al., 2 Sep 2025).

Conceptually, $S_i$1 captures retaliation capability. If a player deviates, the remaining players must be able to react so that the deviator cannot obtain a lexicographically preferred outcome relative to $S_i$2. This suggests that secure equilibrium with constraints is governed by a two-level structure: first identify states from which all unilateral deviations can be disciplined, then determine whether the prescribed winners can jointly realize $S_i$3 while staying inside that retaliation-safe sub-arena.

4. Decidability and complexity landscape

The complexity results depend sharply on the objective class. The paper pinpoints the following upper and lower bounds for the constrained existence problem (Mizuno et al., 2 Sep 2025).

Objectives	Upper bound	Lower bound
Büchi	co-NP	P-hard
Co-Büchi	NP	P-hard
Parity	PSPACE	NP-hard, co-NP-hard

For Büchi objectives, the constrained secure-equilibrium existence problem is in co-NP. For co-Büchi objectives, it is in NP. For Muller objectives, including parity, it is in PSPACE. Lower bounds show P-hardness already for Büchi and co-Büchi games, even for two players. For parity objectives, the problem is both NP-hard and co-NP-hard, depending on the constraint instance considered (Mizuno et al., 2 Sep 2025).

The algorithmic idea has two stages. First, for the fixed constraint $S_i$4, one computes $S_i$5 by solving several two-player zero-sum games with objectives from the relevant class. Second, one computes a one-player winning region for the conjunction of winning objectives in the sub-arena $S_i$6. The relevant auxiliary winning-region computations have known complexities: Streett in co-NP, Rabin in NP, and Muller/parity in PSPACE (Mizuno et al., 2 Sep 2025).

Two special hardness results sharpen the picture. For payoff constraint $S_i$7 with parity objectives, the problem is co-NP-hard. In addition, the existence of doomsday equilibria with payoff $S_i$8 for two-player Büchi games is P-hard. These reductions contribute to the claim that the overall results are tight up to the completeness status of the underlying objective classes (Mizuno et al., 2 Sep 2025).

5. Relation to earlier secure-equilibrium research

Secure equilibrium predates the constrained multi-player Boolean treatment. In two-player weighted games on finite graphs, the notion was extended from the Boolean setting to a quantitative setting by replacing Boolean payoff comparison with lexicographic comparison over numerical payoff vectors. For player $S_i$9, for example,

$i$0

and symmetrically for player $i$1 (Bruyère et al., 2014).

In that weighted setting, secure equilibria always exist for payoff functions in $i$2. Finite-memory secure equilibria can be synthesized, with memory size at most $i$3 for $i$4, $i$5, $i$6, and discounted sum, and at most $i$7 for $i$8 and $i$9. For the constrained existence problem in weighted games, decidability is established for mean-payoff, liminf, limsup, inf, and sup; discounted sum remains open. Complexity is in $E \subseteq S \times S$0 for mean-payoff and in $E \subseteq S \times S$1 for liminf, limsup, inf, and sup (Bruyère et al., 2014).

The relationship between the 2014 weighted analysis and the 2025 multi-player qualitative analysis is structural rather than identical. The weighted work is two-player and quantitative, whereas the later work is multi-player and qualitative. Both, however, use zero-sum subproblems as a central device: the weighted framework relies on associated lexicographic payoff games, while the qualitative constrained framework relies on winning regions that encode retaliation against unilateral deviation. A plausible implication is that “security” in both lines of work is operationalized through enforceable punishment or deterrence conditions, even though the ambient payoff models differ.

6. Constraint semantics, neighboring frameworks, and common confusions

A recurring source of confusion is the meaning of “constraints.” In constrained secure equilibrium for qualitative multi-player games, the constraint is a payoff profile $E \subseteq S \times S$2 specifying which players must win or lose (Mizuno et al., 2 Sep 2025). This differs from continuous generalized Nash formulations in which constraints are coupled feasibility conditions on strategy profiles. In continuous games with mixed strategies, for example, the principal constraints studied are chance constraints of the form

$E \subseteq S \times S$3

requiring that a safety event occur with at least a prescribed probability under the mixed strategy profile. Those constraints are motivated by safe and acceptable robot interactions and are handled numerically via KKT/MCP reformulations with smoothed indicators (Krusniak et al., 2024).

It also differs from strategic-constraint models in normal-form games, where the restriction concerns the players’ admissible strategy choices or deviations. Examples include disjoint supports, partition Nash, $E \subseteq S \times S$4-far Nash, major Nash, and constrained or social equilibrium, where a player may deviate only to strategies in a constraint correspondence $E \subseteq S \times S$5. In that line of work, the computational complexity can increase sharply, and nonconvex constraints can destroy guaranteed existence (Kapron et al., 2023).

Another common misconception is to identify secure equilibrium with Nash equilibrium. Secure equilibrium is strictly finer in the sense used here: every secure equilibrium is a Nash equilibrium, but not vice versa, because secure equilibrium blocks deviations that preserve the deviator’s own value while worsening another player’s value [(Mizuno et al., 2 Sep 2025); (Bruyère et al., 2014)]. This additional lexicographic sensitivity is the defining feature of the concept.

More broadly, the comparative literature shows that “equilibrium with constraints” is not a single formal category. In the secure-equilibrium setting, the constraint is an outcome specification; in continuous mixed-strategy games, it can be a chance-constrained safety condition; in strategic-constraint normal-form games, it can be a restriction on supports or deviations. This suggests that the phrase “with constraints” should be interpreted only relative to the formal object being constrained: payoffs, admissible actions, or probabilistic feasibility.

7. Significance and open directions

The 2025 characterization establishes decidability and precise complexity for when a secure equilibrium with a specified winners-and-losers profile exists in multi-player games with qualitative $E \subseteq S \times S$6-regular objectives. Its crux is the reduction to classic two-player game winning-region computation, instantiated for each retaliation scenario induced by a possible deviation (Mizuno et al., 2 Sep 2025).

This result is significant for at least three reasons. First, it moves beyond unconstrained existence by handling a payoff-specified problem that is closer to verification and synthesis tasks in which desired outcomes are fixed in advance. Second, it provides a uniform characterization across several standard objective classes. Third, it yields constructive algorithmic procedures rather than only abstract decidability statements, since the winning-region computations themselves are constructive (Mizuno et al., 2 Sep 2025).

At the same time, the surrounding literature indicates clear boundaries. In weighted two-player games, constrained existence is decidable for several quantitative measures but remains open for discounted sum (Bruyère et al., 2014). In other equilibrium-with-constraints frameworks, modest changes in the semantics of the constraints can shift problems from total-search settings to NP-hard or PPAD-hard regimes, and existence may fail altogether (Kapron et al., 2023). A plausible implication is that future work on secure equilibrium with constraints will continue to hinge on which object the constraint targets and on whether retaliation or admissibility can still be reduced to tractable zero-sum subroutines.