Absorbing games with a clock and two bits of memory
暂无分享，去创建一个
[1] Kristoffer Arnsfelt Hansen,et al. The Big Match with a Clock and a Bit of Memory , 2018, EC.
[2] D. Blackwell,et al. THE BIG MATCH , 1968, Classics in Game Theory.
[3] Abraham Neyman. Stochastic games: Existence of the MinMax , 2003 .
[4] Sylvain Sorin,et al. Equilibria in Repeated Games of Incomplete Information the Deterministic Symmetric Case , 1997 .
[5] Elon Kohlberg,et al. The Asymptotic Theory of Stochastic Games , 1976, Math. Oper. Res..
[6] Ehud Lehrer,et al. A Uniform Tauberian Theorem in Dynamic Programming , 1992, Math. Oper. Res..
[7] Sylvain Sorin,et al. Equilibria in repeated games of incomplete information: The general symmetric case , 1998, Int. J. Game Theory.
[8] Kristoffer Arnsfelt Hansen,et al. The Big Match in Small Space - (Extended Abstract) , 2016, SAGT.
[9] Sylvain Sorin,et al. Repeated Games by Jean-François Mertens , 2015 .
[10] Dinah Rosenberg,et al. Absorbing Games with Compact Action Spaces , 2009, Math. Oper. Res..
[11] Dean Gillette,et al. 9. STOCHASTIC GAMES WITH ZERO STOP PROBABILITIES , 1958 .
[12] Elon Kohlberg,et al. Repeated Games of Incomplete Information: The Symmetric Case , 1974 .
[13] E. Kohlberg. Repeated Games with Absorbing States , 1974 .
[14] S. Sorin,et al. An operator approach to zero-sum repeated games , 2001 .
[15] A. Neyman,et al. Stochastic games , 1981 .
[16] H. W. Kuhn,et al. 11. Extensive Games and the Problem of Information , 1953 .