Pages that link to "Item:Q2757620"

The following pages link to The maxmin of recursive games with incomplete information on one side (Q2757620):

Displaying 15 items.

• Recursive games: uniform value, Tauberian theorem and the Mertens conjecture ``\(\mathrm{Maxmin}=\lim v_n=\lim v_\lambda\)'' (Q267087) (← links)
• Zero-sum repeated games: counterexamples to the existence of the asymptotic value and the conjecture \({\max}{\min}=\lim v_{n}\) (Q282504) (← links)
• A zero-sum stochastic game with compact action sets and no asymptotic value (Q367429) (← links)
• Repeated games with public uncertain duration process (Q532706) (← links)
• Zero-sum repeated games: recent advances and new links with differential games (Q545660) (← links)
• Infinite sequential games with perfect but incomplete information (Q548061) (← links)
• Zero-sum stochastic games with partial information (Q704755) (← links)
• Two-player stochastic games. II: The case of recursive games (Q1594890) (← links)
• The speed of sequential asymptotic learning (Q1693201) (← links)
• Uniform value in recursive games. (Q1872365) (← links)
• Finite- and Infinite-Horizon Shapley Games with Nonsymmetric Partial Observation (Q3462237) (← links)
• (Q3802922) (← links)
• ``Big Match'' with lack of information on one side. III (Q3976304) (← links)
• Definable Zero-Sum Stochastic Games (Q5245020) (← links)
• Value‐based distance between information structures (Q6059548) (← links)