Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
139 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Uniform Value for Recursive Games with Compact Actions (1604.03610v1)

Published 12 Apr 2016 in math.OC

Abstract: Mertens, Neyman and Rosenberg [MOR, 2009] used the Mertens and Neyman theorem [IJGT, 1981] to prove the existence of uniform value for absorbing games with finite state space and compact action sets. We provide an analogous proof for another class of stochastic games, recursive games with finite state space and compact action sets. Moreover, both players have stationary epsilon-optimal strategies.

Summary

We haven't generated a summary for this paper yet.