2000 character limit reached
Constant payoff in absorbing games
Published 4 Mar 2020 in math.OC and math.PR | (2003.02663v1)
Abstract: In this paper, we solve the constant-payoff conjecture formulated by Sorin, Venel and Vigeral (2010), for absorbing games with an arbitrary evaluation of the stage rewards. That is, the existence of a pair of asymptotically optimal strategies, indexed by the evaluation of the stage rewards, so that the average rewards are constant on any fraction of the game. That the constant-payoff conjecture holds for stochastic games with an arbitrary evaluation is still open.
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.