메뉴 건너뛰기
Games and Economic Behavior
Volumn 7, Issue 3, 1994, Pages 381-389
Computable Strategies for Repeated Prisoner′s Dilemma
Author keywords

[No Author keywords available]
Indexed keywords

EID: 0011514818     PISSN: 08998256     EISSN: 10902473     Source Type: Journal    
DOI: 10.1006/game.1994.1057     Document Type: Article
Times cited : (22)
References (11)
  • 1
    • 0011471586 scopus 로고
    • The Complexity of Computing a Best Response Automation in Repeated Games with Mixed Strategies
    • Ben-Porath, E. (1990). “The Complexity of Computing a Best Response Automation in Repeated Games with Mixed Strategies,” Games Econ. Behav. 2, 1-12.
    • (1990) Games Econ. Behav , vol.2 , pp. 1-12
    • Ben-Porath, E.1
  • 2
    • 0001432658 scopus 로고
    • Discounted Dynamic Programming
    • Blackwell, D. (1965). “Discounted Dynamic Programming,” Ann of Math. Statist. 36, 226-235.
    • (1965) Ann of Math. Statist , vol.36 , pp. 226-235
    • Blackwell, D.1
  • 3
    • 0000614213 scopus 로고
    • Bounded Complexity Justifies Cooperation in the Finitely Repeated Prisoners' Dilemma
    • Neyman, A. (1985). “Bounded Complexity Justifies Cooperation in the Finitely Repeated Prisoners' Dilemma,” Econ. Lett. 19, 227-229.
    • (1985) Econ. Lett , vol.19 , pp. 227-229
    • Neyman, A.1
  • 4
    • 0000350658 scopus 로고
    • Finite Combinatory Processes. Formulation I
    • Post, E. (1936). “Finite Combinatory Processes. Formulation I,” J. Symbolic Logic 1, 103-105.
    • (1936) J. Symbolic Logic , vol.1 , pp. 103-105
    • Post, E.1
  • 5
    • 0000703828 scopus 로고
    • Effective Computability of Winning Strategies
    • Rabin, M. (1957). “Effective Computability of Winning Strategies,” Ann. of Math. Stud. 39, 147-157.
    • (1957) Ann. of Math. Stud , vol.39 , pp. 147-157
    • Rabin, M.1
  • 6
    • 0001402950 scopus 로고
    • An Iterative Method of Solving a Game
    • Robinson, J. (1951). “An Iterative Method of Solving a Game,” Ann. of Math. 54, 296-301.
    • (1951) Ann. of Math , vol.54 , pp. 296-301
    • Robinson, J.1
  • 7
    • 46149134052 scopus 로고
    • Finite Automata Play the Repeated Prisoners Dilemma
    • Rubinstein, A. (1986). “Finite Automata Play the Repeated Prisoners’ Dilemma,” J. Econ. Theory 39, 83-96.
    • (1986) J. Econ. Theory , vol.39 , pp. 83-96
    • Rubinstein, A.1
  • 8
    • 38249039630 scopus 로고
    • On Continuous Reaction Function Equilibria in Duopoly Supergames with Mean Payoffs
    • Stanford, W. (1986). “On Continuous Reaction Function Equilibria in Duopoly Supergames with Mean Payoffs,” J. Econ. Theory 39, 233-250.
    • (1986) J. Econ. Theory , vol.39 , pp. 233-250
    • Stanford, W.1
  • 9
    • 38249004328 scopus 로고
    • Symmetric Paths and Evolution to Equilibrium in the Discounted Prisoners Dilemma,”
    • Stanford, W. (1989). “Symmetric Paths and Evolution to Equilibrium in the Discounted Prisoners’ Dilemma,” Econ. Lett. 31, 139-143.
    • (1989) Econ. Lett , vol.31 , pp. 139-143
    • Stanford, W.1
  • 10
    • 84960561455 scopus 로고
    • On Computable Numbers, with an Application to the Entscheidungs-problem
    • Turing, A. (1936). “On Computable Numbers, with an Application to the Entscheidungs-problem,” Proc. London Math. Soc. 242, 230-265.
    • (1936) Proc. London Math. Soc , vol.242 , pp. 230-265
    • Turing, A.1
  • 11
    • 0011261455 scopus 로고
    • Computability and T-definability
    • Turing, A. (1937). “Computability and T-definability,” J. Symbolic Logic 2, 153-163.
    • (1937) J. Symbolic Logic , vol.2 , pp. 153-163
    • Turing, A.1

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.