2002
DOI: 10.1111/j.1468-0262.2002.00440.x
|View full text |Cite
|
Sign up to set email alerts
|

On the Global Convergence of Stochastic Fictitious Play

Abstract: We establish global convergence results for stochastic fictitious play for four classes of games: games with an interior ESS, zero sum games, potential games, and supermodular games. We do so by appealing to techniques from stochastic approximation theory, which relate the limit behavior of a stochastic process to the limit behavior of a differential equation defined by the expected motion of the process. The key result in our analysis of supermodular games is that the relevant differential equation defines a … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

8
282
0
1

Year Published

2006
2006
2017
2017

Publication Types

Select...
6
2
2

Relationship

1
9

Authors

Journals

citations
Cited by 219 publications
(291 citation statements)
references
References 35 publications
8
282
0
1
Order By: Relevance
“…A large body of the research on evolutionary game dynamics has focused on identifying classes of games and dynamics that ensure convergence to point-attractors such as the Nash equilibrium (Hofbauer and Weibull (1996), Hofbauer and Sandholm (2002), Sandholm (2005)). …”
Section: Introductionmentioning
confidence: 99%
“…A large body of the research on evolutionary game dynamics has focused on identifying classes of games and dynamics that ensure convergence to point-attractors such as the Nash equilibrium (Hofbauer and Weibull (1996), Hofbauer and Sandholm (2002), Sandholm (2005)). …”
Section: Introductionmentioning
confidence: 99%
“…If i gets a revision opportunity, he draws an action from the distribution b ε i (·|x) ∈ ∆(S i ). The mapping b ε i : X → ∆(S i ) is called the choice function Hofbauer and Sandholm (2002) of player i. Choice functions are basic objects in game 26 Hence, we think of the mappings σ and γ as the projection mappings onto their relevant factors.…”
Section: Co-evolution Of Network and Playmentioning
confidence: 99%
“…Given the different time-varying filter parameters in (21) and (22), the algorithm inherently a two-time-scale dynamics with average utility estimate dynamics (fast dynamics) and probability distribution dynamics (slow dynamics).…”
Section: Remarkmentioning
confidence: 99%