Time to absorption in discounted reinforcement models
暂无分享,去创建一个
[1] Henrik Renlund,et al. Reinforced Random Walk , 2005 .
[2] R. Pemantle,et al. Network formation by reinforcement learning: the long and medium run , 2004, Math. Soc. Sci..
[3] V. Limic. Attracting edge property for a class of reinforced random walks , 2003 .
[4] P. Bonacich,et al. Asymptotics of a matrix valued Markov chain arising in sociology , 2003 .
[5] M. Weigt,et al. On the properties of small-world network models , 1999, cond-mat/9903411.
[6] Duncan J. Watts,et al. Collective dynamics of ‘small-world’ networks , 1998, Nature.
[7] Amir Dembo,et al. Large Deviations Techniques and Applications , 1998 .
[8] Michael W. Macy,et al. The weakness of strong ties: Collective action failure in a highly cohesive group* , 1996 .
[9] M. Benaïm. A Dynamical System Approach to Stochastic Approximations , 1996 .
[10] L. Anderlini,et al. Learning on a Torus , 1996 .
[11] M. Hirsch,et al. Dynamics of Morse-Smale urn processes , 1995, Ergodic Theory and Dynamical Systems.
[12] A. Roth,et al. Learning in Extensive-Form Games: Experimental Data and Simple Dynamic Models in the Intermediate Term* , 1995 .
[13] Glenn Ellison. Learning, Local Interaction, and Coordination , 1993 .
[14] David M. Kreps,et al. Learning Mixed Equilibria , 1993 .
[15] Chris D. Godsil,et al. ALGEBRAIC COMBINATORICS , 2013 .
[16] R. Pemantle,et al. Nonconvergence to Unstable Points in Urn Models and Stochastic Approximations , 1990 .
[17] E. Bannai,et al. Algebraic Combinatorics I: Association Schemes , 1984 .
[18] S. Lakshmivarahan,et al. Learning Algorithms Theory and Applications , 1981 .
[19] J M Smith,et al. Evolution and the theory of games , 1976 .
[20] Radu Theodorescu,et al. Random processes and learning , 1969 .
[21] D. Freedman. Bernard Friedman's Urn , 1965 .
[22] Frederick Mosteller,et al. Stochastic Models for Learning , 1956 .
[23] B. Friedman,et al. A simple urn model , 1949 .
[24] G. Pólya,et al. Über die Statistik verketteter Vorgänge , 1923 .