2000 character limit reached
Absorbing Blackwell Games
Published 24 Aug 2022 in math.OC and math.PR | (2208.11425v1)
Abstract: It was shown in Flesch and Solan (2022) with a rather involved proof that all two-player stochastic games with finite state and action spaces and shift-invariant payoffs admit an $\epsilon$-equilibrium, for every $\epsilon>0$. Their proof also holds for two-player absorbing games with tail-measurable payoffs. In this paper we provide a simpler proof for the existence of $\epsilon$-equilibrium in two-player absorbing games with tail-measurable payoffs, by combining recent mathematical tools for such payoff functions with classical tools for absorbing games.
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.