Skip to main content

Advertisement

Log in

Particle Swarm Optimization Algorithm for Agent-Based Artificial Markets

  • Published:
Computational Economics Aims and scope Submit manuscript

Abstract

Particle swarm optimization (PSO) is adapted to simulate dynamic economic games. The robustness and speed of the PSO algorithm is compared to a genetic algorithm (GA) in a Cournot oligopsony market. Artificial agents with the PSO learning algorithm find the optimal strategies that are predicted by theory. PSO is simpler and more robust to changes in algorithm parameters than GA. PSO also converges faster and gives more precise answers than the GA method which was used by some previous economic studies.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Alkemade F., La Poutre H., Amman H. (2006) Robust evolutionary algorithm design for socio-economic simulation. Computational Economics 28: 355–370. doi:10.1007/s10614-006-9051-5

    Article  Google Scholar 

  • Arifovic J. (1994) Genetic algorithm learning and the cobweb-model. Journal of Economic Dynamics & Control 18: 3–28. doi:10.1016/0165-1889(94)90067-1

    Article  Google Scholar 

  • Arifovic J. (1996) The behavior of the exchange rate in the genetic algorithm and experimental economies. The Journal of Political Economy 104: 510–541. doi:10.1086/262032

    Article  Google Scholar 

  • Arifovic J., Maschek M. (2006) Revisiting individual evolutionary learning in the cobweb model—an illustration of the virtual spite-effect. Computational Economics 28: 333–354. doi:10.1007/s10614-006-9053-3

    Article  Google Scholar 

  • Axelrod R. (1987) The evolution of strategies in the iterated prisoner’s dilemma. In: Davis L. (eds) Genetic algorithms and simulated annealing. Pitman, London, pp 32–41

    Google Scholar 

  • Bullard J., Duffy J. (1999) Using genetic algorithms to model the evolution of heterogeneous beliefs. Computational Economics 13: 41–60. doi:10.1023/A:1008610307810

    Article  Google Scholar 

  • Chatterjee A., Siarry P. (2006) Nonlinear inertia weight variation for dynamic adaptation in particle swarm optimization. Computers & Operations Research 33: 859–871. doi:10.1016/j.cor.2004.08.012

    Article  Google Scholar 

  • Dawid H. (1999) On the convergence of genetic learning in a double auction market. Journal of Economic Dynamics & Control 23: 1545–1567. doi:10.1016/S0165-1889(98)00083-9

    Article  Google Scholar 

  • De Jong, K. A. (1975). An analysis of the behavior of a class of genetic adaptive systems. Ph.D. Dissertation, University of Michigan, Ann Arbor, Mich.

  • Eberhart, R. C., & Kennedy, J.(1995). A New optimizer using particle swarm theory. Proceedings of the sixth international symposium on micromachine and human science (pp. 39–43). Nagoya, Japan.

  • Erev I., Roth A. (1998) Predicting how people play games: reinforcement learning in experimental games with unique mixed strategy equilibria. The American Economic Review 88: 848–881

    Google Scholar 

  • Goldberg D.E. (1989) Genetic algorithms in search, optimization, and machine learning. Addison-Wesley, Massachusetts

    Google Scholar 

  • Hamm L., Brorsen B.W., Hagan M.T. (2007) Comparison of stochastic global optimization methods to estimate neural network weights. Neural Processing Letters 26: 145–158. doi:10.1007/s11063-007-9048-7

    Article  Google Scholar 

  • Hassan, R., Cohanim, B., De Weck, O., & Venter, G. (2005). A comparison of particle swarm optimization and the genetic algorithm. Proceedings of the 46th AIAA/ASME/ASCE/AHS/ASC structures, structural dynamics and materials conference, Austin, Texas, AIAA-2005-1897.

  • Kutschinski E., Uthmann T., Polani D. (2003) Learning competitive pricing strategies by multi-agent reinforcement learning. Journal of Economic Dynamics & Control 27: 2207–2218. doi:10.1016/S0165-1889(02)00122-7

    Article  Google Scholar 

  • Mouser C.R., Dunn S.A. (2005) Comparing genetic algorithms and particle swarm optimisation for an inverse problem exercise. Anizam Journal 46: C89–C101. doi:10.1007/3-540-27528-2

    Google Scholar 

  • Panda S., Padhy N.P. (2007) Comparison of particle swarm optimization and genetic algorithm for tcsc-based controller design. International Journal of Computer Science and Engineering 1: 1–49

    Google Scholar 

  • Riechmann T. (2001) Genetic algorithm learning and evolutionary games. Journal of Economic Dynamics & Control 25: 1019–1037. doi:10.1016/S0165-1889(00)00066-X

    Article  Google Scholar 

  • Vriend J.N. (2000) An illustration of the essential difference between individual and social learning, and its consequences for computational analyses. Journal of Economic Dynamics & Control 24: 1–19. doi:10.1016/S0165-1889(98)00068-2

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to B. Wade Brorsen.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhang, T., Brorsen, B.W. Particle Swarm Optimization Algorithm for Agent-Based Artificial Markets. Comput Econ 34, 399–417 (2009). https://doi.org/10.1007/s10614-009-9171-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10614-009-9171-9

Keywords

Navigation