Before revision:  We also provide learning-based microfoundations for our cross-player tremble restrictions in a class of games using three different specifications of how agents handle the exploration/exploitation trade-off: expected utility maximization, Bayesian upper confidence bounds, and Thompson sampling.
After revision:  We show that rational learning and some near-optimal heuristics imply our compatibility restrictions in a class of games using three different specifications of how agents handle the exploration/exploitation trade-off: expected utility maximization, Bayesian upper confidence bounds, and Thompson sampling.