IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2605.16926.html

Meta-Bayesian Nash Equilibrium: Existence via Kakutani's Fixed Point Theorem

Author

Listed:
  • Madjid Eshaghi Gordji
  • Esmaiel Abounoori
  • Mohamadali Berahman

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.

Suggested Citation

  • Madjid Eshaghi Gordji & Esmaiel Abounoori & Mohamadali Berahman, 2026. "Meta-Bayesian Nash Equilibrium: Existence via Kakutani's Fixed Point Theorem," Papers 2605.16926, arXiv.org.
  • Handle: RePEc:arx:papers:2605.16926
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2605.16926
    File Function: Latest version
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:2605.16926. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.