2000 character limit reached
Equilibria in Repeated Games with Countably Many Players and Tail-Measurable Payoffs (2106.03975v1)
Published 7 Jun 2021 in math.OC and cs.GT
Abstract: We prove that every repeated game with countably many players, finite action sets, and tail-measurable payoffs admits an $\epsilon$-equilibrium, for every $\epsilon > 0$.