Skip to main content

The Agent-Based Double Auction Markets: 15 Years On

  • Conference paper

Part of the book series: Agent-Based Social Systems ((ABSS,volume 7))

Abstract

Novelties discovering as a source of constant change is the essence of economics. However, most economic models do not have the kind of novelties-discovering agents required for constant changes. This silence was broken by Andrews and Prager 15 years ago when they placed GP (genetic programming)-driven agents in the double auction market. The work was, however, neither economically well interpreted nor complete; hence the silence remains in economics. In this article, we revisit their model and systematically conduct a series of simulations to better document the results. Our simulations show that human-written programs, including some reputable ones, are eventually outperformed by GP. The significance of this finding is not that GP is alchemy. Instead, it shows that novelties-discovering agents can be introduced into economic models, and their appearance inevitably presents threats to other agents who then have to react accordingly. Hence, a potentially indefinite cycle of change is triggered.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Notes

  1. 1.

    See [22], p. 28–30.

  2. 2.

    Genetic algorithms and learning classifier systems can be other alternatives. However, to the best of our knowledge, most agent-based economic applications of genetic algorithms do not manifest this capability, and, for some reason not exactly known, there are almost no agent-based economic applications of learning classifier systems.

  3. 3.

    The reason why we choose the agent-based double auction market as the main pursuit of this paper is because this is one of the few economic models in which human agents, programmed agents and autonomous agents have been involved. See Sect. 2 for the details.

  4. 4.

    As we shall see below, zero-intelligence agents or slightly modified zero-intelligence agents cannot compete with some well-thought human-written programs.

  5. 5.

    The first DA tournaments were held by the Santa Fe Institute in 1990. A share of $10,000 was offered to the writers of algorithms that could perform well in a double auction competition. The tournament attracted around 25 different and well thought-out strategies.

  6. 6.

    Submitted by Todd Kaplan, then a student at the University of Minnesota. See Sect. 3.2.

  7. 7.

    More details will be given in Sect. 3.3. In brief, all randomly generated programs can be regarded as samples from the span of some bases. These bases, as listed in Table 1, are all from human-written programs.

  8. 8.

    Please refer to [20] for the random token-generation process.

  9. 9.

    Named by or after their original designers, these strategies were modified to accommodate our discrete double auction mechanism in various ways. They were modified according to their original design concepts as much as possible. As a result, they might not be 100% the same as their original forms.

  10. 10.

    We choose 0.1 because [24]’s simulations shows that the market efficiency will be maximized when traders all have 0.1 markup rates.

  11. 11.

    The elements in the terminal and function sets are extracted from the Skeleton, Kaplan, and Ringuette strategies, which are human-designed trading rules and are proved to be quite efficient in gaining profits. Please refer to [19, 20] for the structure and the performance of these strategies.

  12. 12.

    For a more detailed explanation about how GP can be used to construct trading strategies in double auction markets, i.e., how strategies are generated and renovated with crossover and mutation, please refer to [4].

  13. 13.

    The fitness value of GP traders is defined as the achievement of the individual efficiency, which will be explained later in Sect. 4.

  14. 14.

    To avoid the flaw that a strategy is deserted simply because it is not selected, we set N as twice the size of the population, so that theoretically each strategy has the chance to be selected twice.

  15. 15.

    The tournament size and the mutation rate are two important parameters which may influence GP traders’ performance. On the one hand, the larger the tournament size, the earlier that the convergence of strategies can be expected. On the other hand, the larger the mutation rate, the more diverse the genotypes of the strategies are. When facing a dynamic problem such as making bids/asks in a double auction market, the impact of different tournament sizes together with different mutation rates on GP performance can only be accessed with a comprehensive experimentation of different combinations. Generally speaking, in many studies the size of the tournament ranges from 2 to 5, while the mutation rate ranges from 1 to 10%.

  16. 16.

    As mentioned in Sect. 1, we can use GP to model the learning process of an expert possessing intelligence based on, say, a 10-year experience and 50,000 “chunks”. In this article, each GP trader has to develop strategies to be used in the markets. These strategies consist of building blocks comprising market variables, and therefore can be viewed as combinations of “chunks”. Since we cannot predict how many chunks our GP traders will use, we did not parameterize this variable. Instead, the size of the population of strategies is utilized to characterize this capacity. In a similar vein, we did not model the “10-year experience” directly. 7,000 trading days are available for our GP traders to make their strategies as good as possible.

  17. 17.

    In our results, the best strategy of GP traders with a population size of 100 in the 34th generation is the selling strategy–Max(PMinBid, PAvg, PAvgAsk, LT), a rather simple rule which adjusts to the market situations by simply choosing whichever is bigger among several types of market and private information. For a more thorough investigation of the kinds of strategies our GP traders are capable of evolving, please see [7].

  18. 18.

    However, the correlation between the population size and the generations needed to defeat other strategies may not prevail in all circumstances. A GP trader in our double auction tournament is a specific-purpose machine which seeks to discover efficient trading strategies. In such a specific problem where the number of potentially efficient strategies is finite, employing too many strategies (say, 10,000 strategies) may not be coupled with a corresponding increase in the learning speed. In fact, a closer look at our data suggests a decreasing correlation between the population size and the generations needed to defeat the rivals when the population sizes become larger and larger.

References

  1. Andrews M, Prager R (1994) Genetic programming for the acquisition of double auction market strategies. In: Kinnear KE Jr (ed) Advances in genetic programming. MIT Press, Cambridge, MA, pp 355–368

    Google Scholar 

  2. Chan NT, LeBaron B, Lo AW, Poggio T (1999) Agent-based models of financial markets: a comparison with experimental markets. MIT artificial markets project, Paper No. 124, September 5, 1999. Available via CiteSeer http://citeseer.ist.psu.edu/chan99agentbased.html. Cited 18 June 2008

  3. Chen S-H (2000) Toward an agent-based computational modeling of bargaining strategies in double auction markets with genetic programming. In: Leung KS, Chan L-W, Meng H (eds) Intelligent data engineering and automated learning-IDEAL 2000: data mining, financial engineering, and intelligent agents. Lecture notes in computer science 1983. Springer, pp 517–531

    Chapter  Google Scholar 

  4. Chen S-H, Chie B-T, Tai C-C (2001) Evolving bargaining strategies with genetic programming: an overview of AIE-DA Ver. 2, Part 2. In: Verma B, Ohuchi A (eds) Proceedings of fourth international conference on computational intelligence and multimedia applications (ICCIMA 2001). IEEE Computer Society Press, pp 55–60

    Google Scholar 

  5. Chen S-H, Tai C-C (2003) Trading restrictions, price dynamics and allocative efficiency in double auction markets: an analysis based on agent-based modeling and simulations. Adv Complex Syst 6(3):283–302

    Article  MATH  Google Scholar 

  6. Chen S-H, Kuo T-W, Hsu K-M (2008) Genetic programming and financial trading: how much about “what we know”? In: Zopounidis C, Doumpos M, Pardalos P (eds) Handbook of financial engineering, Chapter 8Springer

  7. Chen S-H, Zeng R-J, Yu T (2008) Co-evolving trading strategies to analyze bounded rationality in double auction markets. In: Riolo R, Soule T, Worzel B (eds) Genetic programming theory and practice VI. Springer, New York, pp 195–213

    Google Scholar 

  8. Chen S-H, Zeng R-J, Yu T (2009) Micro-behaviors: case studies based on agent-based double auction markets. In: Kambayashi Y (ed) Multi-agent applications with evolutionary computation and biologically inspired technologies: intelligent techniques for ubiquity and optimization. IGI Global

    Google Scholar 

  9. Cliff D, Bruten J (1997) Zero is not enough: on the lower limit of agent intelligence for continuous double auction markets. Technical Report no. HPL-97-141, Hewlett-Packard Laboratories. Available via CiteSeer http://citeseer.ist.psu.edu/cliff97zero.html. Cited 18 June 2008

  10. Dawid H (1999) On the convergence of genetic learning in a double auction market. J Econ Dynam Contr 23:1544–1567

    Article  MathSciNet  Google Scholar 

  11. Easley D, Ledyard J (1993) Theories of price formation and exchange in double oral auctions. In: Friedman D, Rust J (eds) The double auction market-institutions, theories, and evidence. Addison Wesley, Redwood City, CA, pp 63–97

    Google Scholar 

  12. Friedman D (1991) A simple testable model of double auction markets. J Econ Behav Organ 15:47–70

    Article  Google Scholar 

  13. Frydman R, Goldberg M (2007) Imperfect knowledge economics: exchange rates and risk. Princeton University Press, Princeton

    MATH  Google Scholar 

  14. Gjerstad S, Dickhaut J (1998) Price formation in double auctions. Game Econ Behav 22:1–29

    Article  MathSciNet  MATH  Google Scholar 

  15. Gode D, Sunder S (1993) Allocative efficiency of markets with zero-intelligence traders: market as a partial substitute for individual rationality. J Polit Econ 101:119–137

    Article  Google Scholar 

  16. Hayek FA (1945) The use of knowledge in society. Am Econ Rev 54:519–530

    Google Scholar 

  17. Holland J (1975) Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor

    Google Scholar 

  18. Marshall A (1924) Principles of economics. MacMillan, New York

    Google Scholar 

  19. Rust J, Miller J, Palmer R (1993) Behavior of trading automata in a computerized double auction market. In: Friedman D, Rust J (eds) Double auction markets: theory, institutions, and laboratory evidence. Addison Wesley, Redwood City, CA

    Google Scholar 

  20. Rust J, Miller J, Palmer R (1994) Characterizing effective trading strategies: insights from a computerized double auction tournament. J Econ Dynam Contr 18:61–96

    Article  Google Scholar 

  21. Simon H (1965) The architecture of complexity. Gen Syst 10:63–76

    Google Scholar 

  22. Simon H, Egidi M, Viale R, Marris R (1992) Economics, bounded rationality and the cognitive revolution. Edward Elgar Publishing, Cheltenham

    Google Scholar 

  23. Smith V (1991) Bidding and auctioning institutions: experimental results. In: Smith V (ed) Papers in experimental economics. Cambridge University Press, Cambridge, pp 106–127

    Chapter  Google Scholar 

  24. Zhan W, Friedman D (2007) Markups in double auction markets. J Econ Dynam Contr 31:2984–3005

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

The authors are grateful to the two anonymous referees for their suggestions in regard to the former version of this paper submitted to the WCSS 2008 post-conference proceedings. National Science Council Research Grant No. NSC 95-2415-H-004-002-MY3 and National Chengchi University Top University Program No. 98H432 are also gratefully acknowledged.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Shu-Heng Chen .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer

About this paper

Cite this paper

Chen, SH., Tai, CC. (2010). The Agent-Based Double Auction Markets: 15 Years On. In: Takadama, K., Cioffi-Revilla, C., Deffuant, G. (eds) Simulating Interacting Agents and Social Phenomena. Agent-Based Social Systems, vol 7. Springer, Tokyo. https://doi.org/10.1007/978-4-431-99781-8_9

Download citation

  • DOI: https://doi.org/10.1007/978-4-431-99781-8_9

  • Publisher Name: Springer, Tokyo

  • Print ISBN: 978-4-431-99780-1

  • Online ISBN: 978-4-431-99781-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics