In binary unbiased local coordination games, average disagreement ≤ ε implies the graph is (O(ε log(1/ε)), r)-amenable.
Annales de l’Institut Henri Poincar´ e, Probabilit´ es et Statistiques, 56(4), 2020
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Improved Amenability Bounds for Local Coordination Games
In binary unbiased local coordination games, average disagreement ≤ ε implies the graph is (O(ε log(1/ε)), r)-amenable.