Pure-Strategy Perfect Equilibrium

• Pure-strategy perfect equilibrium is a game theory concept defined by deterministic strategies that are optimal in every subgame and under slight perturbations.
• The equilibrium employs value recursion and dynamic programming to exclude non-credible mixed strategies, particularly in stochastic and extensive-form games.
• Practical applications include solving large extensive-form games and verifying trembling-hand perfection, although NP-hard issues arise in multi-player settings.

A pure-strategy perfect equilibrium is an equilibrium refinement in game theory characterized by profiles in which each player's strategy is deterministic (pure) and satisfies optimality within every conceivable subgame or in response to all vanishing perturbations of opponents' strategies. It excludes reliance on randomization except where warranted by the structure of the game, and enforces robust credibility of threats and choices throughout the entire game tree or strategic form.

1. Formal Definitions and Conceptual Frameworks

Three principal notions arise in the literature:

• Markov Perfect Equilibrium (MPE) in Continuous-Time Games In dynamic settings (e.g., war-of-attrition), a Markov pure strategy specifies closed exit regions $E_i \subseteq \mathcal{X}$, with exit occurring only upon hitting $E_i$, and a hazard function $\lambda_i : \mathcal{X} \to [0, \infty)$ vanishes identically, i.e., $\lambda_i \equiv 0$ (Georgiadis et al., 2021). The equilibrium requirement is

$V_i(x; a_i^*, a_{-i}^*) \geq V_i(x; a_i, a_{-i}^*)$

for every alternative $a_i$ and state $x$, with $V_i$ the expected discounted payoff given the Markov strategies.

• Trembling-Hand Perfect Equilibrium (THPE) in Strategic Form Games Given pure strategy profile $p = (p_1, \ldots, p_n)$ in $G = (N, \{S_i\}, \{u_i\})$, $E_i$0 is trembling-hand perfect if there exists a sequence of fully mixed strategy profiles $E_i$1 converging to $E_i$2 such that $E_i$3 is a best reply to $E_i$4 for all $E_i$5 and $E_i$6 (0812.0492). The defining property is:

$E_i$7

• Subgame-Perfect Equilibrium (SPE) via Value Recursion in Extensive-Form Games A pure-strategy profile is subgame-perfect if it induces Nash equilibrium play in every subgame. In pentaform (extensive-form) representation, equilibrium is characterized by value recursion over subroots, formalized as

$E_i$8

where each restriction $E_i$9 is Nash on piece-form $\lambda_i : \mathcal{X} \to [0, \infty)$0 (Streufert, 2023).

2. Existence and Structure in Dynamic and Strategic Games

2.1 Dynamic War-of-Attrition (Stochastic Payoff Diffusion)

Pure-strategy MPEs emerge in stochastic war-of-attrition with heterogeneous exit payoffs (i.e., $\lambda_i : \mathcal{X} \to [0, \infty)$1) and irreducible diffusion $\lambda_i : \mathcal{X} \to [0, \infty)$2, $\lambda_i : \mathcal{X} \to [0, \infty)$3. Each firm's optimal response is characterized by threshold rules:

• Define single-player stopping thresholds $\lambda_i : \mathcal{X} \to [0, \infty)$4 as solutions to the optimal stopping problem (Lemma 1), yielding $\lambda_i : \mathcal{X} \to [0, \infty)$5.
• Two MPE profiles:
  • Profile A: Firm $\lambda_i : \mathcal{X} \to [0, \infty)$6 exits once $\lambda_i : \mathcal{X} \to [0, \infty)$7; Firm $\lambda_i : \mathcal{X} \to [0, \infty)$8 never exits.
  • Profile B (when $\lambda_i : \mathcal{X} \to [0, \infty)$9 is small): Firm $\lambda_i \equiv 0$0 exits once $\lambda_i \equiv 0$1; Firm $\lambda_i \equiv 0$2 never exits.
• The equilibrium region is sharply delineated: for $\lambda_i \equiv 0$3, only A or B can occur (Georgiadis et al., 2021).

2.2 Elimination of Mixed Strategies

Under stochastic payoffs ($\lambda_i \equiv 0$4) and heterogeneous exit values, all mixed-strategy Markov equilibria are excluded. Lemma 2 demonstrates that common support and the need for indifference cannot be achieved when $\lambda_i \equiv 0$5 (Theorem 1). If payoffs are deterministic ($\lambda_i \equiv 0$6) or exit payoffs are homogeneous ($\lambda_i \equiv 0$7), classic mixed-strategy equilibria remain feasible.

3. Computation and Verification Complexity

3.1 Trembling-Hand Perfection: NP-Hardness

For strategic-form games with $\lambda_i \equiv 0$8 players and integer payoffs, deciding whether a given pure-strategy profile is trembling-hand perfect is shown to be NP-hard (0812.0492). The reduction originates from the three-player MINMAX problem and constructs an augmented game with an added absorbing strategy $\lambda_i \equiv 0$9:

• If the minmax value for Player 1 in the base game $V_i(x; a_i^*, a_{-i}^*) \geq V_i(x; a_i, a_{-i}^*)$0 is $V_i(x; a_i^*, a_{-i}^*) \geq V_i(x; a_i, a_{-i}^*)$1, then $V_i(x; a_i^*, a_{-i}^*) \geq V_i(x; a_i, a_{-i}^*)$2 is trembling-hand perfect.
• If the minmax value is $V_i(x; a_i^*, a_{-i}^*) \geq V_i(x; a_i, a_{-i}^*)$3, trembling-hand perfection fails for $V_i(x; a_i^*, a_{-i}^*) \geq V_i(x; a_i, a_{-i}^*)$4. No polynomial algorithm can certify perfection unless P=NP. For two-player games, trembling-hand perfection coincides with dominance and is computable via LP.

3.2 Dynamic Programming Approach for Extensive Games

The value-recursion characterization for pure-strategy subgame-perfect equilibria allows recursive computation over subroots ("piece-forms"). Provided upper- and lower-convergence of the utility function $V_i(x; a_i^*, a_{-i}^*) \geq V_i(x; a_i, a_{-i}^*)$5, admissibility and persistence of value functions ensure authenticity—meaning that the continuation value at each subroot matches the realized utility along the induced outcome (Streufert, 2023).

4. Mathematical Characterizations and Criteria

4.1 Hamilton–Jacobi–Bellman and Variational Inequality

In continuous-time dynamic games, candidate value functions $V_i(x; a_i^*, a_{-i}^*) \geq V_i(x; a_i, a_{-i}^*)$6 must solve the variational inequality: $V_i(x; a_i^*, a_{-i}^*) \geq V_i(x; a_i, a_{-i}^*)$7 with boundary conditions ("smooth-pasting") at thresholds $V_i(x; a_i^*, a_{-i}^*) \geq V_i(x; a_i, a_{-i}^*)$8: $V_i(x; a_i^*, a_{-i}^*) \geq V_i(x; a_i, a_{-i}^*)$9 These characterize optimal exit policies (and equilibrium regions).

4.2 One-Piece Unimprovability

Pure-strategy subgame-perfect equilibrium in pentaform games is equivalent to "one-piece unimprovability": for each subroot $a_i$0, player $a_i$1's realized utility $a_i$2 weakly dominates the utility attainable by any single-piece deviation at $a_i$3 (Streufert, 2023).

5. Comparative Cases and Limitations

• When exit options are homogeneous ($a_i$4) and/or payoffs are deterministic ($a_i$5), symmetric mixed-strategy equilibria can be constructed (hazard rates $a_i$6 explicitly specified).
• The jump from $a_i$7 to $a_i$8 players in THPE induces a sharp complexity transition.
• For proper equilibrium (Myerson), NP-hardness also applies in three-player settings (0812.0492). The two-player computational status remains unresolved.

6. Interpretive Remarks and Theoretical Significance

• Pure-strategy perfect equilibrium refines Nash equilibrium by demanding optimality in every subgame and excluding non-credible threats.
• In dynamic programming treatments, equilibrium existence and computation proceed via Bellman-like recursion over subgame decomposition (subroots/piece-forms), unifying dynamic programming and equilibrium theory.
• Trembling-hand perfection and subgame perfection are robust against vanishing perturbations and payoff changes at future nodes, provided technical conditions (upper/lower convergence).
• The absence of mixed-strategy equilibria in perturbed dynamic games with heterogeneous payoffs highlights the fragility of mixed-strategy constructions to stochasticity and payoff asymmetry (Georgiadis et al., 2021).

7. Practical Applications and Computational Implications

• Large extensive-form games can be solved by recursive value-function methods over subroots, extending backwards-induction to general imperfect-information and infinite-horizon settings.
• For verifying trembling-hand perfection in three-player games, only exponential-time algorithms exist subject to current complexity bounds.
• Existence proofs and computational schemes directly inherit methods from dynamic programming and optimal control theory, relating Bellman equations to equilibrium recursion.

A plausible implication is that refinements such as pure-strategy perfect equilibrium may be preferable in environments featuring payoff stochasticity and heterogeneity, as they yield credibly stable and computationally tractable solutions in settings where mixed strategies become degenerate or untestable.