English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

International audienceWe study two-player zero-sum recursive games with a countable state space and finiteaction spaces at each state. When the family of n-stage values {v_n;n >0} is totally boundedfor the uniform norm, we prove the existence of the uniform value. Together with a resultin Rosenberg and Vieille [12], we obtain a uniform Tauberian theorem for recursive game:(v_n) converges uniformly if and only if (v_λ) converges uniformly.We apply our main result to finite recursive games with signals (where players observeonly signals on the state and on past actions). When the maximizer is more informedthan the minimizer, we prove the Mertens conjecture Maxmin = lim v_n = lim v_λ.Finally, we deduce the existence of the uniform value in finite recursive games with symmetricinformation

international journal of game theory

Recursive games: uniform value, Tauberian theorem and the Mertens conjecture “ $$Maxmin=\lim v_n=\lim v_{\uplambda }$$ M a x m i n = lim v n = lim v λ ”