Bayesian Quadratic Network Game Filters
From MaRDI portal
Publication:4579166
Abstract: A repeated network game where agents have quadratic utilities that depend on information externalities -- an unknown underlying state -- as well as payoff externalities -- the actions of all other agents in the network -- is considered. Agents play Bayesian Nash Equilibrium strategies with respect to their beliefs on the state of the world and the actions of all other nodes in the network. These beliefs are refined over subsequent stages based on the observed actions of neighboring peers. This paper introduces the Quadratic Network Game (QNG) filter that agents can run locally to update their beliefs, select corresponding optimal actions, and eventually learn a sufficient statistic of the network's state. The QNG filter is demonstrated on a Cournot market competition game and a coordination game to implement navigation of an autonomous team.
Recommendations
- Bayesian learning in normal form games
- Bayesian learning in repeated normal form games
- Bayesian learning in repeated games
- Approximate equilibria for Bayesian games
- Bayesian Networks and Games of Deterrence
- scientific article; zbMATH DE number 733409
- scientific article; zbMATH DE number 1189219
- Modeling, analysis, and dynamics of Bayesian games via matrix-based method
- A game theoretic approach to robust filtering
This page was built for publication: Bayesian Quadratic Network Game Filters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4579166)