Bayesian games with nested information
Royi Jacobovic, John Yehuda Levy, Eilon Solan
TL;DR
This paper studies Bayesian games with nested information and proves the existence of a Bayesian 0-equilibrium when action spaces are finite, payoffs are bounded, and type spaces are Polish. It introduces two main techniques: a finite- belief-hierarchy approximation to obtain Bayesian ε-equilibria, and a Measurable Choice-based construction to pass to an exact equilibrium while preserving measurability across all players. The results extend prior ε-equilibrium findings by eliminating the need for density absolute continuity in the information structure and by handling arbitrarily many players under nested information. The approach leverages a careful synthesis of δ-approximation, finite information structures, selection theorems (Kuratowski–Ryll-Nardzewski, Meertens), and Aumann integration to build a convergent, measurable equilibrium. The findings have implications for hierarchical information settings and provide a framework for exact equilibrium existence in broader classes of Bayesian games with structured information.
Abstract
A Bayesian game is said to have nested information if the players are ordered, and each player knows the types of all players that follow her in that order. We prove that all multiplayer Bayesian games with finite actions spaces, bounded payoffs,Polish type spaces, and nested information admit a Bayesian equilibrium.
