Smooth Fictitious Play in N× 2 Potential Games

11/30/2019
by   Brian Swenson, et al.
0

The paper shows that smooth fictitious play converges to a neighborhood of a pure-strategy Nash equilibrium with probability 1 in almost all N× 2 (N-player, two-action) potential games. The neighborhood of convergence may be made arbitrarily small by taking the smoothing parameter to zero. Simple proof techniques are furnished by considering regular potential games.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/19/2017

Fictitious Play in Potential Games

This work studies the convergence properties of continuous-time fictitio...
research
07/19/2017

Regular Potential Games

A fundamental problem with the Nash equilibrium concept is the existence...
research
01/27/2022

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

We investigate convergence of decentralized fictitious play (DFP) in nea...
research
02/14/2012

Filtered Fictitious Play for Perturbed Observation Potential Games and Decentralised POMDPs

Potential games and decentralised partially observable MDPs (Dec-POMDPs)...
research
11/19/2019

Fictitious Play: Convergence, Smoothness, and Optimism

We consider the dynamics of two-player zero-sum games, with the goal of ...
research
01/15/2013

Multi-agent learning using Fictitious Play and Extended Kalman Filter

Decentralised optimisation tasks are important components of multi-agent...
research
03/07/2023

Mastering Strategy Card Game (Legends of Code and Magic) via End-to-End Policy and Optimistic Smooth Fictitious Play

Deep Reinforcement Learning combined with Fictitious Play shows impressi...

Please sign up or login with your details

Forgot password? Click here to reset