GNEP in Banach Space Equilibrium Analysis

• GNEP in Banach space is defined as an equilibrium system where each agent’s strategies and constraints depend on other agents in infinite-dimensional settings.
• Variational reformulations using quasi-variational inequalities and KKM methods enable existence proofs under conditions like lower semicontinuity and graph convexity.
• Applications in optimal control and PDE-constrained optimization illustrate the practical impact of these techniques on multi-agent system analysis.

A generalized Nash equilibrium problem (GNEP) in Banach space arises when several agents (players) compete in a system where both the objective functions and the feasible sets for each agent depend on the strategies chosen by all players. The infinite-dimensional setting notably arises in optimal control, PDE-constrained optimization, and game-theoretic models in functional spaces. Banach-space GNEPs generalize classical finite-dimensional GNEPs by incorporating strategies and constraints in arbitrarily complex, infinite-dimensional vector spaces, and require specialized analytic and variational tools for study.

1. Formal Definition and Variational Formulation

Given a finite set of players $A = \{1,2,\ldots,N\}$, each player $v$ is equipped with a real Banach space $X_v$ and a closed, convex, nonempty private constraint set $C_v \subset X_v$. The product space $X := X_1 \times \cdots \times X_N$ and admissible set $C := C_1 \times \cdots \times C_N$ structure the joint feasible profile $x = (x_1, \ldots, x_N) \in C$. Each player's available strategies are further restricted by a set-valued constraint function $K_v: C \to 2^{C_v}$, potentially depending on all rivals' choices, and preferences are encoded either

• by cost functionals $f_v: X \to \mathbb{R}$,
• or by preference correspondences $P_v: C \to 2^{C_v}$ specifying strict-preference sets.

A profile $v$0 solves the GNEP if for each $v$1,

• $v$2,
• $v$3 is at least as preferred as any $v$4.

Convex GNEPs require that the feasible sets $v$5 are convex and cost functionals $v$6 are convex for each fixed $v$7.

Variational analysis recasts the equilibrium search as a quasi-variational inequality (QVI) problem: find $v$8 and $v$9 such that

$X_v$0

for a constructed principal operator $X_v$1 capturing the normal cone structure of the preferences or gradients (Sultana et al., 2024).

2. Constraint Structures and Regularity Conditions

The analytic properties of the constraint maps $X_v$2 are fundamentally important for existence and uniqueness results.

• Lower semicontinuity (LSC): A set-valued map $X_v$3 is lower semicontinuous at $X_v$4 if for every $X_v$5 and neighborhood $X_v$6 of $X_v$7, there is a neighborhood $X_v$8 of $X_v$9 such that $C_v \subset X_v$0 for $C_v \subset X_v$1. LSC of $C_v \subset X_v$2 underpins upper semicontinuity of best-response maps, and is standard in Kakutani-type fixed-point proofs. However, LSC can be difficult to verify in infinite-dimensional function spaces (Bongarti et al., 14 Dec 2025).
• Graph convexity: $C_v \subset X_v$3 is graph-convex if the set $C_v \subset X_v$4 is convex in $C_v \subset X_v$5. Graph convexity is purely geometric and easier to check in situations such as PDE state-constrained games.
• KKM property: $C_v \subset X_v$6 is a KKM-map if for any finite set $C_v \subset X_v$7, $C_v \subset X_v$8. The KKM property enables the application of the Knaster-Kuratowski-Mazurkiewicz lemma, leading to intersection results for constraint maps without relying on semicontinuity.

The following table summarizes these notions:

Property	Definition	Utility in GNEP Existence
Lower semicontinuity	For all $C_v \subset X_v$9, open $X := X_1 \times \cdots \times X_N$0 of $X := X_1 \times \cdots \times X_N$1, $X := X_1 \times \cdots \times X_N$2 neighborhood $X := X_1 \times \cdots \times X_N$3 s.t. $X := X_1 \times \cdots \times X_N$4 for $X := X_1 \times \cdots \times X_N$5	Enables fixed-point existence via Kakutani
Graph-convexity	Graph of $X := X_1 \times \cdots \times X_N$6 is convex in $X := X_1 \times \cdots \times X_N$7	Suits PDE/open convex games
KKM property	Convex hull of any finite subset is covered by values	Fixed-point alternative to LSC

3. Existence Theorems: Analytic and Geometric Criteria

Existence of GNEs in Banach spaces can be established under several sets of hypotheses:

• Classical (LSC): Compactness, convexity, LSC of $X := X_1 \times \cdots \times X_N$8, and continuity plus convexity of $X := X_1 \times \cdots \times X_N$9 yield existence of GNEs via an upper semicontinuous best-response correspondence and Kakutani’s theorem (Bongarti et al., 14 Dec 2025).
• Graph-convexity: If $C := C_1 \times \cdots \times C_N$0 are convex-valued, have closed graph, and are graph-convex, existence follows from arguments based on the Nikaido–Isoda–Fan function, convexity of feasible profiles, and fixed-point methods.
• KKM-based: If $C := C_1 \times \cdots \times C_N$1 is KKM with closed convex values and each $C := C_1 \times \cdots \times C_N$2 is convex, compact, then a GNE exists via the KKM lemma.

For games whose equilibrium structure is captured by preference correspondences, similar existence results are established if $C := C_1 \times \cdots \times C_N$3 are LSC and $C := C_1 \times \cdots \times C_N$4 have open graph, convex values, and appropriate irreflexivity/closedness properties (Bongarti et al., 14 Dec 2025).

4. Variational Analytic Characterizations

GNEPs are reformulated as QVIs via the construction of a principal operator:

• For each player $C := C_1 \times \cdots \times C_N$5, the normal-cone operator to preferences $C := C_1 \times \cdots \times C_N$6 is defined by

$C := C_1 \times \cdots \times C_N$7

and the total operator $C := C_1 \times \cdots \times C_N$8 is built from selections with norm-weak* upper semicontinuity, convexity, and weak* compactness (Sultana et al., 2024).

• The equilibrium profile $C := C_1 \times \cdots \times C_N$9 solves the QVI if it belongs to the product constraint $x = (x_1, \ldots, x_N) \in C$0 and, for some $x = (x_1, \ldots, x_N) \in C$1, satisfies the variational inequality against all feasible $x = (x_1, \ldots, x_N) \in C$2.
• For convex $x = (x_1, \ldots, x_N) \in C$3 with numerical representation, these reduce to the KKT-based VI system underpinning classical GNEP theory (Facchinei–Kanzow).

5. Uniqueness and Diagonal Strict Monotonicity

Uniqueness of variational equilibria is ensured under diagonal strict monotonicity conditions, extending Rosen’s finite-dimensional theory:

• For given positive weights $x = (x_1, \ldots, x_N) \in C$4 and Gâteaux-differentiable $x = (x_1, \ldots, x_N) \in C$5, the pseudogradient operator $x = (x_1, \ldots, x_N) \in C$6 is constructed as

$x = (x_1, \ldots, x_N) \in C$7

Diagonal strict monotonicity requires

$x = (x_1, \ldots, x_N) \in C$8

This yields uniqueness of the variational equilibrium in the shared constraint case, and allows controlled selection of equilibria via manipulation of the multipliers $x = (x_1, \ldots, x_N) \in C$9 (termed "multiplier bias") (Bongarti et al., 14 Dec 2025).

6. Geometric Preference-Based Approach

The use of strict-preference correspondences $K_v: C \to 2^{C_v}$0—rather than cost functionals—permits a geometric, order-theoretic framing of equilibrium theory:

• Each $K_v: C \to 2^{C_v}$1 satisfies open-graph, convexity, and topological closedness properties.
• The geometric generalized Nash equilibrium is $K_v: C \to 2^{C_v}$2 such that $K_v: C \to 2^{C_v}$3 for all $K_v: C \to 2^{C_v}$4.
• Existence results parallel the analytic case, provided $K_v: C \to 2^{C_v}$5 is LSC and $K_v: C \to 2^{C_v}$6 is compact. Variational and fixed-point arguments adapt to the purely combinatorial structure afforded by the KKM property or convexity of the graph (Bongarti et al., 14 Dec 2025).

7. Special Cases and Applications

• In finite dimensions, selections for the principal operator $K_v: C \to 2^{C_v}$7 recover classical VI operators.
• If preference correspondences admit a utility representation and are complete and transitive, QVI formulations coincide with the classical variational inequality characterization (Sultana et al., 2024).
• Graph-convexity and KKM approaches are particularly advantageous in PDE-constrained or function-space games, where LSC is typically unavailable but convexity of feasible sets is immediate.
• The structural results unify earlier finite-dimensional existence theorems and clarify the analytic role of regularity versus geometry of set-valued maps in infinite-dimensional equilibrium analysis (Bongarti et al., 14 Dec 2025).

These frameworks collectively enable the rigorous study of multi-agent optimal control, PDE-constraint interaction, and other infinite-dimensional competition models under broad and weak regularity conditions.