Abstract
This paper explores the idea of constructing theoretical economic agents that behave like actual human agents and using them in neoclassical economic models. It does this in a repeated-choice setting by postulating “artificial agents” who use a learning algorithm calibrated against human learning data from psychological experiments. The resulting calibrated algorithm appears to replicate human learning behavior to a high degree and reproduces several “stylized facts” of learning. It can therefore be used to replace the idealized, perfectly rational agents in appropriate neoclassical models with “calibrated agents” that represent actual human behavior. The paper discusses the possibilities of using the algorithm to represent human learning in normal-form stage games and in more general neoclassical models in economics. It explores the likelihood of convergence to long-run optimality and to Nash behavior, and the “characteristic learning time” implicit in human adaptation in the economy.
Similar content being viewed by others
References
Arthur WB (1989) Nash-Discovering Automata for Finite Action Games. Mimeo, Stanta Fe Institute
Arthur WB, Ermoliev YuM, Kaniovski YuM (1987a) Nonlinear Urn Processes: Asymptotic Behavior and Applications. WP-87-85, IIASA, Laxenburg, Austria
Arthur WB, Ermoliev YuM, Kaniovski YuM (1987b) Urn Schemes and Adaptive Processes of Growth. Kibernetika 23:49–58
Arthur WB, Holland JH, Palmer R (1993) Adaptive Behavior in the Stock Market. Santa Fe Institute (in press)
Bailey JT, Mazur JE (1990) Choice Behavior in Transition: Development of Preference for the Higher Probability of Reinforcement. J. Exp Analysis Behav 53:409–422
Bray MM (1982) Learning, Estimation, and the Stability of Rational Expectations. J Econ Theory 26:318–339
Bush RR, Mosteller F (1955) Stochastic Models for Learning. Wiley, New York
Fudenberg D, Kreps DM (1988) Learning, Experimentation, and Equilibrium in Games, MIT Press, Cambridge, MA
Gardner RA (1957) Probability-Learning with Two and Three Choices. Am J Psychol 70:174–185
Goldberg D (1989) Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley Reading, Mass.
Goodnow JJ (1955) Determinants of Choice-Distribution in Two-Choice Situations. Am J Psychol 68:106–116
Hebb DO (1949) The Organization of Behavior. Wiley, New York
Herrnstein R (1979) Derivatives of Matching. Psychol Rev 86:486–495
Herrnstein R, Vaughan W (1980) Melioration and Behavioral Allocation. In: Straddon JE (ed) The Allocation of Individual Behavior Academic Press, New York, pp 143–176
Herrnstein R, Prelec D, Loewenstein GF, Vaughan W (1990) Maximization and Melioration. Mimeo, Harvard
Holland JH (1986) Escaping Brittleness: The Possibilities of General Purpose Machine Learning Algorithms Applied to Parallel Rule-based Systems. In: Michalski R, Carbonell J, Mitchell T (eds) Machine Learning: An Artificial Intelligence Approach, vol 2. Kaufman, Los Altos, Ca.
Holland JH, Holyoak KJ, Nisbet RE, Thagard PR (1987) Induction: Process of Inference, Learning, and Discovery. MIT Press, Cambridge, MA
Hull CL (1943) Principles of Behavior. Appleton-Century Crofts, New York
Luce RD (1959) Individual Choice Behavior: A Theoretical Analysis.Wiley, New York
Lucas RE (1978) Asset Prices in an Exchange Economy. Econometrica 46:1429–1445
Marcet A, Sargent T (1989) Convergence of Least Squares Learning Mechanisms in Self-Referential Linear Stochastic Models. J Econ Theory 48:337–368
Marimon RE, McGrattan E, Sargent T (1989) Money as a Medium of Exchange in an Economy with Artificially Intelligent Agents. Santa Fe Institute, Paper 89-004
Milgrom P, Roberts J (1991) Adaptive and Sophisticated Learning in Repeated Normal Form Games. Games and Economic Behavior 3:82–100
Narendra K, Thathachar MAL (1989) Learning Automata: An Introduction. Prentice-Hall, Englewood Cliffs, NJ
Neimark ED, Estes WK (eds) (1967) Stimulus Sampling Theory. Holden-Day, San Francisco, CA
nevelson MB, Hasminskii RZ (1976) Stochastic Approximation and Recursive Estimation, vol 47 American Math. Soc. Providence, RI
Pemantle R (1988) Nonconvergence to Unstable Points in Urn Models and Stochastic Approximations. Mimeo, Statistics Department, U.C. Berkeley
Restle F, Greeno JG (1970) Introduction to Mathematical Psychology. Addison-Wesley, Reading, MA
Rothschild M (1974) A Two-Armed Bandit Theory of Market Pricing. J Econ Theory 9:185–202
Sternberg S (1963) Stochastic Learning Theory. In: Handbook of Mathematical Psychology. Luce RD, Bush RR, Galanter E (eds) Wiley, New York
Tolman EC (1932) Purposive Behavior in Animals and Men. Appleton-Crofts, New York
Tsetlin ML (1973) Automaton Theory and Modeling of Biological Systems. Academic Press, New York
Tsypkin YaZ (1973) Foundations of the Theory of Learning Systems. Academic Press, New York
Turing AM (1956) Can a Machine Think? In: Newman JR, (ed) The World of Mathematics. Simon and Schuster, New York, pp 2009–2123
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Arthur, W.B. On designing economic agents that behave like human agents. J Evol Econ 3, 1–22 (1993). https://doi.org/10.1007/BF01199986
Issue Date:
DOI: https://doi.org/10.1007/BF01199986