Meta-Bayesian Nash Equilibrium: Existence via Kakutani's Fixed Point Theorem
Abstract
We extend the concept of meta-Nash equilibrium, introduced by Eshaghi Gordji and Bagha [2026] for complete-information games, to environments with incomplete information. We define a meta-Bayesian Nash equilibrium as a profile of type-dependent mixed meta-strategies together with an environmental move such that no player type can profitably deviate and the environment cannot improve its expected payoff. For each transformed game, meta-payoffs are determined by the unique Bayesian Nash equilibrium of that game. Using Kakutani's fixed point theorem, we establish existence under finiteness assumptions on type spaces, meta-actions, and transformations, together with the assumption that each transformed game admits a unique Bayesian Nash equilibrium. Several illustrative examples, including adaptive subsidy competition, cybersecurity protocol selection, and platform rule formation, demonstrate that private information at the meta-level plays an essential role in endogenous game transformation. The framework contains both classical Bayesian games and complete-information meta-games as special cases.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.