Similarity of Information in Games
Abstract
Algorithmic content targeting homogenizes information, with implications for strategic interactions. For example, this increased homogenization was arguably responsible for the run on the Silicon Valley Bank. We argue that existing measures of similarity are inappropriate for studying games -- especially coordination games -- because they do not discipline agents' conditional beliefs. We propose a class of stochastic orders, Concentration Along the Diagonal (CAD), built on agents' conditional beliefs. In canonical binary-action coordination games, greater CAD-similarity is both necessary and sufficient for strategic similarity -- agents adopt the same strategy. We further demonstrate CAD's applicability in congestion games, collective action, and second-price auctions.
Keywords
Cite
@article{arxiv.2603.28190,
title = {Similarity of Information in Games},
author = {Deepal Basak and Joyee Deb and Aditya Kuvalekar},
journal= {arXiv preprint arXiv:2603.28190},
year = {2026}
}