On Hypergraphical Bayesian Games - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

On Hypergraphical Bayesian Games

Résumé

This paper defines the framework of hypergraphical Bayesian games, which allows to concisely specify Bayesian games with local interactions. This framework generalizes both normal-form Bayesian games and hypergraphical games (including polymatrix games). Establishing a generalization of Howson and Rosenthal's Theorem, we show that hypergraphical Bayesian games can be transformed, in polynomial time, into equivalent complete-information hypergraphical games. This result has several consequences. It involves that finding an ε -Nash equilibrium in a hypergraphical Bayesian game or an exact mixed Nash equilibrium in a polymatrix Bayesian game is PPAD-complete, while checking the existence of a pure Nash equilibrium defines a NP-complete problem. It also allows to make use of existing solution algorithms for hypergraphical games to solve hypergraphical and standard normal form Bayesian games.
Fichier non déposé

Dates et versions

hal-04269862 , version 1 (03-11-2023)

Identifiants

Citer

Hélène Fargier, Paul Jourdan, Régis Sabbadin. On Hypergraphical Bayesian Games. 34th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2022), IEEE, Oct 2022, Macao, China. pp.1374-1381, ⟨10.1109/ICTAI56018.2022.00208⟩. ⟨hal-04269862⟩
15 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More