Filtered Fictitious Play for Perturbed Observation Potential Games and Decentralised POMDPs

by   Archie C. Chapman, et al.

Potential games and decentralised partially observable MDPs (Dec-POMDPs) are two commonly used models of multi-agent interaction, for static optimisation and sequential decisionmaking settings, respectively. In this paper we introduce filtered fictitious play for solving repeated potential games in which each player's observations of others' actions are perturbed by random noise, and use this algorithm to construct an online learning method for solving Dec-POMDPs. Specifically, we prove that noise in observations prevents standard fictitious play from converging to Nash equilibrium in potential games, which also makes fictitious play impractical for solving Dec-POMDPs. To combat this, we derive filtered fictitious play, and provide conditions under which it converges to a Nash equilibrium in potential games with noisy observations. We then use filtered fictitious play to construct a solver for Dec-POMDPs, and demonstrate our new algorithm's performance in a box pushing problem. Our results show that we consistently outperform the state-of-the-art Dec-POMDP solver by an average of 100 observation function.



There are no comments yet.


page 1

page 2

page 3

page 4


Communication complexity of Nash equilibrium in potential games

We prove communication complexity lower bounds for (possibly mixed) Nash...

Multi-agent learning using Fictitious Play and Extended Kalman Filter

Decentralised optimisation tasks are important components of multi-agent...

Smooth Fictitious Play in N× 2 Potential Games

The paper shows that smooth fictitious play converges to a neighborhood ...

Decentralized Fictitious Play Converges Near a Nash Equilibrium in Near-Potential Games

We investigate convergence of decentralized fictitious play (DFP) in nea...

Scaling up Mean Field Games with Online Mirror Descent

We address scaling up equilibrium computation in Mean Field Games (MFGs)...

Solving Games with Functional Regret Estimation

We propose a novel online learning method for minimizing regret in large...

Automated Planning in Repeated Adversarial Games

Game theory's prescriptive power typically relies on full rationality an...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.