2000 character limit reached
Equilibria in Repeated Games with Countably Many Players and Tail-Measurable Payoffs
Published 7 Jun 2021 in math.OC and cs.GT | (2106.03975v1)
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$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.