In this paper we survey the various notions of anonymity and symmetry for finite strategic-form games that are present in the 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 numerous 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.
Author(s): Nicholas Ham
Publisher: arXiv
Year: 0
Language: English
Pages: 17
Tags: Game Theory, Symmetric Games, Game Automorphisms. MSC: 91A05, 91A06, 91A10, 91A30, 91A70, 91B16
1 Introduction......Page 1
2 Background......Page 2
3.2 Game Invariants......Page 3
3.3 Notions of Anonymity......Page 4
3.4 Notions of Fairness......Page 5
4 Morphisms Between Games......Page 6
4.1 Game Bijections......Page 7
4.3 Bijections Acting on Strategy Profiles......Page 8
4.4 Strategy Triviality and Matchings......Page 9
5.1 Notions of Fairness......Page 11
5.3 Parameterised Symmetric Games......Page 12
5.4 Examples......Page 13
6 Acknowledgements......Page 16
