In anonymous polymatrix games, fictitious play can be run on aggregate action counts without changing agents' best responses or losing convergence to Nash equilibrium.
Notions of Anonymity, Fairness and Symmetry for Finite Strategic-Form Games
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
In this paper we survey various notions of anonymity and symmetry for finite strategic-form games present in relevant literature, and discuss notions of fairness; show that game bijections and game isomorphisms form groupoids; introduce matchings as a convenient characterisation of strategy triviality; and outline how to construct and partially order parameterised (symmetric) games with examples that range all combinations of surveyed symmetry notions, which when combined with other results in this paper gives the precise relationship between the various symmetry notions.
citation-role summary
background 1
citation-polarity summary
fields
cs.GT 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Aggregate Fictitious Play for Learning in Anonymous Polymatrix Games (Extended Version)
In anonymous polymatrix games, fictitious play can be run on aggregate action counts without changing agents' best responses or losing convergence to Nash equilibrium.