Existence of Multilateral Nash equilibria for families of games

This paper introduces two fundamentally new concepts to game theory: multilateral Nash equilibria and families of games. Starting with non-cooperative games, we show how these notions together seamlessly integrate into and naturally extend the classical theory, and simultaneously enable us to prove a powerful (multilateral) Nash equilibrium existence result with minimal assumptions on the game. Classically, a Nash equilibrium is a global strategy such that whichever player unilaterally deviates from the equilibrium, also reduces his own profit. For a k-lateral Nash equilibrium we now require that whichever group of k players collectively changes their strategies, also reduces all of the deviating players’ profits. In this way, we obtain a filtration of equilibria, where the higher-lateral equilibria are less frequent. Furthermore, we derive an existence criterion for multilateral Nash equilibria and demonstrate how it reflects the increasing rarity of higher-lateral equilibria. Additionally, we show that some classical games have higher-lateral Nash equilibria, which in every case reveal the structure of these games from a new point of view. A family of games is a parameterized collection of non-cooperative games, where the parameter affects every aspect of the game. Typically, we assume that this dependence is continuous, thereby introducing a new structure. That way, we can avoid analyzing the games one at a time, and instead treat the family as a whole. This allows the parameter to take a central role in our theory, and shifts our attention from seeking a special strategy to searching for a special game with preferred strategies. Our main result proves the existence of a multilateral equilibrium in a family of games, maintaining minimalistic assumptions on the games individually. Surprisingly, the clique covering number of the Kneser graph makes a central appearance.

💡 Research Summary

The paper introduces two novel concepts that broaden the scope of classical non‑cooperative game theory: k‑lateral (multilateral) Nash equilibria and families of games. A k‑lateral Nash equilibrium is a strategy profile in which no coalition of exactly k players can jointly deviate in a way that improves the payoff of any member of the coalition. For k = 1 this reduces to the standard Nash equilibrium; as k increases the equilibrium becomes increasingly robust, but also increasingly rare.

To study these equilibria the authors first extend the usual best‑reply correspondence to the multilateral setting and adapt the Nikaido‑Isoda function, obtaining existence criteria that generalize the classic fixed‑point theorems.

The second major contribution is the notion of a family of games: a parameter space B (typically a compact manifold) over which each player’s strategy set E_i(b) and payoff function θ_i(b,·) vary continuously. Each E_i is modeled as a fiber bundle over B, with convex fibers that sit inside a finite‑dimensional vector bundle V_i. This geometric structure allows the authors to apply topological tools to the whole family rather than to individual games.

The central existence result (Corollary 6.9) states that if B is a compact Fₚ‑orientable manifold and the product of the Fₚ‑Euler classes e(V_i) raised to the power ξ(N,k) (where ξ(N,k) is the clique covering number of the Kneser graph K(N,k)) does not vanish in the cohomology ring H⁎(B; Fₚ), then there exists at least one parameter b ∈ B such that the game E(b) possesses a k‑lateral Nash equilibrium. For k = 1 the Kneser graph is complete, ξ = 1, and the condition collapses to the classical Nash existence theorem. The appearance of the Kneser graph reflects the combinatorial structure of the multilateral best‑reply correspondence.

Two applications illustrate the theory. First, the authors treat the set of all finite N‑player games as a single family; they prove that within the 3‑player finite‑game family there are infinitely many games admitting a 2‑lateral equilibrium, demonstrating that multilateral equilibria are not merely pathological. Second, they extend the Arrow‑Debreu abstract economy by adding a governmental player and using Cournot price formation. Under sufficient production possibilities and resources, the state can ensure the existence of arbitrarily high‑lateral equilibria, meaning that no coalition of producers or consumers can profitably deviate—a powerful stability guarantee for economic policy.

Technically, the paper’s strength lies in marrying algebraic topology (Euler classes, cohomology with finite field coefficients) with game‑theoretic equilibrium analysis. This yields a global existence theorem that depends on the topology of the parameter space rather than on pointwise continuity or convexity alone. However, the results rely on fairly strong structural assumptions: convex fibers, smooth bundle structure, and the ability to compute or bound the clique covering number of K(N,k). Moreover, the existence theorem is non‑constructive; it guarantees a parameter value but provides no algorithm for locating it. Extending the framework to non‑convex or discrete strategy spaces, and developing computational methods for identifying suitable parameters, are natural directions for future work.

In summary, the paper offers a fresh perspective on coalition‑resistant equilibria, introduces a topologically rich setting for families of games, and proves a powerful existence result that connects game theory with combinatorial topology via the Kneser graph. Its insights open new avenues for studying stability in economics, networked systems, and multi‑agent environments where groups of agents may coordinate their actions.