Abstract
This paper studies the behavior of the genetic algorithm in coordination games with strategic uncertainty that are characterized by the multiplicity of equilibria. The main objectives are to examine whether the genetic algorithm adaptation leads to coordination and what the long run properties of the dynamics are. The genetic algorithm behavior is compared to the evidence from the experiments with human subjects. The adaptation of genetic algorithm players results in coordination on an equilibrium. Which equilibrium is selected depends on the group size. The analysis of the long-run properties of the dynamics show that, as a result of the continuing effects of the genetic drift, the genetic algorithm can reach any of the equilibria of the game regardless of the group size. Simulations with large group treatments spend most of the time in Pareto-inferior equilibria, while simulations with small group treatments spend most of the time in Pareto-superior equilibria of the game.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arifovic, J., 1994, ‘Genetic algorithm learning and the Cobweb model’, Journal of Economic Dynamics and Control 18, 3–28.
Arifovic, J., 1995, ‘Genetic algorithms and inflationary economies’, Journal of Monetary Economics 36, 219–243.
Arifovic, J., 1996, ‘The behavior of the exchange rate in the genetic algorithm and experimental economies’, Journal of Political Economy 104, 510–541.
Bryant, J., 1983, ‘A simple rational expectations Keynes-type model’, Quarterly Journal of Economics 98, 525–528.
Cooper, R. and A. John, 1988, ‘Coordinating coordination failures in Keynesian models’, Quarterly Journal of Economics 103, 441–463.
Cooper, R., D. De Jong, R. Forsythe, and Th. Ross, 1990, ‘Selection criteria in coordination games’, American Economic Review 80, 218–233.
Crawford, V., 1991, ‘An ‘evolutionary’ interpretation of Van Huyck, Battalio, and Beil’s experimental results on coordination’, Games and Economic Behavior 3, 25–59.
Crawford, V., 1995, ‘Adaptive dynamics in coordination games’, Econometrica 63, 103–143.
Holland, J.H., 1975, Adaptation in Natural and Artificial Systems, Ann Arbor, MI: The University of Michigan Press.
Katz, M. and C. Shapiro, 1985, ‘Network externalities, competition and compatibility’, American Economic Review 75, 424–440.
Kiyotaki, N., 1988, ‘Implications of multiple expectation equilibria under monopolistic competition’, Quarterly Journal of Economics 103, 695–714.
Kandori, M., G. Mailath, and R. Rob, 1993, ‘Learning, mutation, and long run equilibria in games’, Econometrica 61, 29–56.
Roth, A., 1995, ‘Introduction to experimental economics’, in J. Kagel and A. Roth (Eds), Handbook of Experimental Economics, Princeton, NJ: Princeton University Press, pp. 3109.
Sargent, T.J., 1993, Bounded Rationality in Macroeconomics, Oxford: Oxford University Press.
Van Huyck, J., R Battalio, and R. Beil, 1990, ‘Tacit coordination games, strategic uncertainty, and coordination failure’, American Economic Review 80, 234–248.
Young, H.P., 1993, ‘The evolution of conventions’, Econometrica 61, 57–84.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Arifovic, J. (1997). Strategic Uncertainty and the Genetic Algorithm Adaptation. In: Amman, H., Rustem, B., Whinston, A. (eds) Computational Approaches to Economic Problems. Advances in Computational Economics, vol 6. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-2644-2_15
Download citation
DOI: https://doi.org/10.1007/978-1-4757-2644-2_15
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4770-3
Online ISBN: 978-1-4757-2644-2
eBook Packages: Springer Book Archive