Yeah, even with unbounded computational power, Nash equilibria are communication-hard; i.e., you need exponentially many bits for an n-player game to converge t

Yeah, even with unbounded computational power, Nash equilibria are communication-hard; i.e., you need exponentially many bits for an n-player game to converge to an equilibrium, even when all players have unbounded computational power. See https://arxiv.org/pdf/1608.06580.pdf https://arxiv.org/pdf/1608.06580.pdf.