Repeated games with M-period bounded memory (pure strategies)

Journal of Mathematical Economics

Volumn 30, Issue 1, 1998, Pages 1-35

  Sabourian, Hamid ^a  

^a KING'S COLLEGE   (United Kingdom)

Author keywords

Bounded rationality; C72; C73; C79; Memory; Repeated games

Indexed keywords

EID: 0040092392     PISSN: 03044068     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-4068(97)00061-X     Document Type: Article

References (13)

1. Abreu, D., 1984. Infinitely repeated games with discounting: A general theory. Econometrica.
2. de Bruijn, N.G., 1946. A combinatorial problem. Koninklijke Nederlands Akademie van Wetenschappen, Proceedings 49 (Part 2), 758-764.
3. Fudenberg D., Maskin E. The folk theorem in repeated games with discounting or incomplete information. Econometrica. 54:1986;533-556.
4. Golomb, S., 1967. Shift Register Sequences. Holden-Day.
5. Good I.J. Normal recurring decimals. J. London Math. Soc. 21(Part 3):1946;169-172.
6. Hall Jr., M., 1968. Combinatorial Mathematics.
7. Kalai, E., 1990. Bounded rationality and strategic complexity in repeated games. In: Chiishi, T.I., Neyman, A., Tauman, Y. (Eds.), Game Theory and Applications. Academic Press.
8. Pearce, 1992.
9. Rubinstein A. Equilibrium in supergames with the overtaking criterion. J. Econ. Theory. 21:1979;1-9.
10. Sabourian, H., 1989. Repeated games: A Survey. In: Hahn, F.H. (Ed.), The Economics of Missing Markets, Information and Games. Oxford Univ. Press.
11. Sabourian, H., 1989. The folk theorem of repeated games with bounded (one-period) memory. Economic Theory Discussion Paper No. 143, Cambridge.
12. Sabourian, H., 1989. Repeated games with M-period bounded memory (pure strategies). Economic Theory Discussion Paper No. 144, Cambridge.
13. Swamy, M.N.S., Thulasiraman, K., 1981. Graphs: Theory and Algorithms. Wiley, New York.