Notions of Anonymity, Fairness and Symmetry for Finite Strategic-Form Games

Nicholas Ham

Notions of Anonymity, Fairness and Symmetry for Finite Strategic-Form Games

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1311.4766 v5 pith:DJV5MXW7 submitted 2013-11-18 math.CO cs.GT

Nicholas Ham This is my paper · ORCID

classification math.COcs.GT

keywords notionssymmetrygamesanonymityfairnessfinitegamestrategic-form

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

read the original 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

Aggregate Fictitious Play for Learning in Anonymous Polymatrix Games (Extended Version)
cs.GT 2025-08 conditional novelty 6.0 of 10

In anonymous polymatrix games, fictitious play can be run on aggregate action counts without changing agents' best responses or losing convergence to Nash equilibrium.

Pith tools