Computing Perfect Bayesian Equilibria, with Application to Empirical Game-Theoretic Analysis

2026-02-16

AI Summary

This work addresses the computational challenge of efficiently computing Perfect Bayesian Equilibria (PBE) in extensive-form games with incomplete information. It proposes a scalable algorithm that, for the first time, integrates the Alchourrón-Gärdenfors-Makinson (AGM) belief revision theory with the Counterfactual Regret Minimization (CFR) framework, ensuring consistency between strategies and belief systems while strictly adhering to Bonanno’s (2011) definition of PBE. The method achieves time complexity comparable to classical CFR in zero-sum games while guaranteeing correctness, and significantly improves both equilibrium quality and solution efficiency in medium- to large-scale non-zero-sum games. When integrated as a meta-solver into the TE-PSRO framework, it outperforms existing Nash equilibrium–based approaches in empirical game-theoretic analysis.

Technology Category

• Game Theory and Economic Paradigms: Imperfect Information
• Multiagent Systems: Mechanism Design
• Search and Optimization: Adversarial Search

Application Category

• Economics, Online Markets and Human Computation: Incentives in network design for Web infrastructures and ecosystems
• Graph Algorithms and Modeling for the Web: Algorithms and analysis for incomplete, noisy, or partially observed Web-related graphs
• Search and Retrieval-Augmented AI: Web learning to rank, online learning, and counterfactual learning for ranking

Abstract

Perfect Bayesian Equilibrium (PBE) is a refinement of the Nash equilibrium for imperfect-information extensive-form games (EFGs) that enforces consistency between the two components of a solution: agents' strategy profile describing their decisions at information sets and the belief system quantifying their uncertainty over histories within an information set. We present a scalable approach for computing a PBE of an arbitrary two-player EFG. We adopt the definition of PBE enunciated by Bonanno in 2011 using a consistency concept based on the theory of belief revision due to Alchourrón, Gärdenfors, and Makinson. Our algorithm for finding a PBE is an adaptation of Counterfactual Regret Minimization (CFR) that minimizes the expected regret at each information set given a belief system, while maintaining the necessary consistency criteria. We prove that our algorithm is correct for two-player zero-sum games and has a reasonable slowdown in time-complexity relative to classical CFR given the additional computation needed for refinement. We also experimentally demonstrate the competent performance of PBE-CFR in terms of equilibrium quality and running time on medium-to-large non-zero-sum EFGs. Finally, we investigate the effectiveness of using PBE for strategy exploration in empirical game-theoretic analysis. Specifically, we compute PBE as a meta-strategy solver (MSS) in a tree-exploiting variant of Policy Space Response Oracles (TE-PSRO). Our experiments show that PBE as an MSS leads to higher-quality empirical EFG models with complex imperfect information structures compared to MSSs based on an unrefined Nash equilibrium.

Problem

• Perfect Bayesian Equilibrium
• Imperfect-Information Extensive-Form Games
• Strategy-Belief Consistency
• Empirical Game-Theoretic Analysis
• Equilibrium Computation

Innovation

• Perfect Bayesian Equilibrium
• Counterfactual Regret Minimization
• Belief Revision
• Empirical Game-Theoretic Analysis
• Meta-Strategy Solver