analyze best-response correspondence

This study addresses the existence of pure-strategy Nash equilibria in finite non-cooperative games, overcoming the limitation of Nash’s theorem, which guarantees only mixed-strategy equilibria. By analyzing structural properties of best-response correspondences and integrating order-theoretic structures with constructive existence proofs, the authors develop a unified analytical framework. They introduce several generalized classes of games—including extensions of one-sided competition games and games defined via aggregate payoff maximizers over ordered sets—thereby unifying and extending existing sufficient conditions for equilibrium existence. The work highlights the pivotal roles of acyclicity and aggregativity in ensuring pure-strategy equilibria, establishing their existence across a broad range of finite games and providing a theoretical foundation for equilibrium computation and mechanism design.

This work provides a unified categorical characterization of solution concepts in strategic games, such as Nash equilibria and Pareto-efficient outcomes. By constructing a category of games whose morphisms are mappings between player sets and strategy profiles, and by introducing presheaves valued in the category of sets that assign to each game its solution set, the study formally captures these solution concepts using tools from category theory. It establishes, for the first time, the precise order-theoretic conditions under which such presheaves are well-defined: the Nash equilibrium presheaf is valid when strategy mappings are either order-reflecting or order-embedding and morphisms are relational; the Pareto-efficient presheaf requires strategy mappings to be order-embedding. This framework offers a cohesive categorical semantics for game-theoretic solutions.

In discontinuous games, Nash equilibria may fail to exist, best responses may be undefined, and the long-run behavior of oscillatory dynamics remains difficult to characterize. Method: This paper introduces “equilibrium cycles”—a novel set-valued equilibrium concept—unifying three axiomatic requirements: external stability, internal instability, and minimality. It generalizes minimal curb sets to discontinuous games and establishes a rigorous correspondence between equilibrium cycles and strongly connected sink components of the best-response graph. Contribution/Results: We prove that every finite game admits at least one equilibrium cycle. The solution is robust, computationally tractable, and precisely captures the long-run outcomes of oscillatory dynamics. To our knowledge, this is the first set-valued equilibrium framework for discontinuous games that simultaneously guarantees existence and provides a dynamic interpretation.

This paper investigates the equilibrium properties of *obvious strategy profiles* in large-scale finite games. Addressing the existence and implementability of approximate symmetric equilibria as the number of players tends to infinity, we propose a fully decentralized, coordination-free constructive method. Under continuity and asymptotic regularity assumptions, we prove that the empirical strategy distributions induced by obvious strategy profiles converge weakly to symmetric approximate Nash equilibria. Moreover, their random pure-strategy realizations constitute pure-strategy approximate Nash equilibria with probability approaching one. This work establishes, for the first time, *dual convergence*: (i) weak convergence of strategy distributions and (ii) high-probability convergence of pure-strategy realizations. The resulting framework yields scalable, robust, and asymptotically optimal equilibrium solutions for large games—circumventing both explicit coordination mechanisms and prohibitive computational complexity inherent in traditional approaches.

This paper investigates the convergence of best-response (BR) dynamics in simultaneous-move convex quadratic games over lattices, addressing challenging settings with nonlinear objective functions and unbounded feasible sets. We establish a global convergence criterion based on the singular values of the interaction matrix: BR iterations remain globally bounded if all singular values are less than one; divergence occurs for infinitely many initial points if any singular value exceeds one; and almost-everywhere divergence arises when all singular values exceed one. This yields the first tight singular-value condition guaranteeing BR non-divergence. Furthermore, we introduce the notion of “traps”—finite subgames that confine divergent trajectories—and construct mixed Nash equilibria thereof as relaxation solutions to the original problem. Our results provide a unified spectral characterization of BR convergence and divergence, integrating convex optimization, game theory, and singular value analysis, thereby establishing a theoretical foundation for algorithmic reliability in discrete nonlinear games.

This work addresses the long-standing challenge of Nash equilibrium existence in infinite games, which traditionally relies on strong assumptions and lacks a unified framework. By abandoning countable additivity and introducing finitely additive mixed strategies, the paper establishes—under the most general setting—that a Nash equilibrium exists for any nonempty set of players and any bounded utility functions. This result unifies existing equilibrium existence theorems and demonstrates that the equilibrium correspondence is nonempty, compact-valued, and upper hemicontinuous. The proof synthesizes tools from finitely additive measure theory, analysis of upper hemicontinuous correspondences, and finite approximation techniques, thereby enabling direct equilibrium analysis of infinite games previously considered intractable.

This paper addresses the lack of a pure choice-theoretic foundation for Nash equilibrium. We propose the first axiomatic characterization framework for Nash equilibrium based solely on abstract choice functions. Our approach introduces two novel axioms—*contraction consistency* and *expansion consistency*—inspired by classical choice-theoretic principles, supplemented by two additional intuitive axioms. Together, these fully characterize the Nash equilibrium correspondence across arbitrary strategy sets (finite or infinite) and encompass both pure-strategy and mixed-strategy equilibria. Crucially, the framework dispenses with standard assumptions such as utility representation, rationalizability of preferences, or continuity, thereby delivering a genuinely choice-theoretic definition of Nash equilibrium. The resulting characterization unifies diverse game structures—including finite, infinite, and continuous games—enhancing the generality, interpretability, and formal rigor of the equilibrium concept. This work establishes a new paradigm for interdisciplinary research at the interface of game theory and decision theory.

This study provides a strategic foundation for information representation in games of incomplete information, addressing the fundamental question of what informational structures suffice for players to compute optimal responses. By introducing the notion of a strategic quotient space and constructing a minimal Strategic Type Space (STS), the work unifies the modeling of beliefs and levels of rationalizability. It establishes, for the first time, the existence and essential uniqueness of the STS and reveals that this space possesses a recursive structure amenable to finite automata representation. Integrating tools from game theory, rationalizability theory, belief modeling, and automata theory, the paper develops a concise yet comprehensive framework for reasoning about information, thereby laying a new theoretical foundation for the analysis of games with incomplete information.

Computing Nash (or generalized Nash) equilibria in dynamic games is highly challenging due to coupled optimality conditions, nested optimization structures, and numerical ill-conditioning. This work proposes a data-driven, structured decomposition approach that circumvents these difficulties by offline construction of each agent’s best-response mapping, which is then embedded as a feasibility constraint. This formulation eliminates nested optimization and derivative coupling while preserving equilibrium consistency—without requiring explicit modeling of all objectives and constraints or approximation via policy prediction. By integrating best-response embedding, structured optimization reformulation, and large-scale Monte Carlo validation, the method significantly improves computational efficiency and constraint satisfaction in a two-player open-loop autonomous racing game, yielding high-quality approximate equilibrium solutions.

This work addresses the problem of constructing compact optimal strategy profiles—comprising a small set of representative strategies—that efficiently approximate the opponent’s strategy space in large two-player zero-sum games, avoiding domain-specific heuristics or methods lacking theoretical guarantees. We establish the first formal theoretical framework for this problem, prove its NP-hardness, and demonstrate that common heuristics—including uniform sampling and support-set expansion—can be severely suboptimal under specific game structures. Our method introduces an evaluation and analysis framework grounded in Nash equilibrium support verification and incremental construction, integrating game-theoretic analysis, computational complexity proofs, and empirical comparisons to derive tight theoretical bounds on strategy profile quality. To foster reproducibility and future research, we release open-source code and standardized benchmark datasets.