Toward an agent-based computational modeling of bargaining strategies in double auction markets with genetic programming

12Citations
Citations of this article
27Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Using genetic programming, this paper proposes an agent-based computational modeling of double auction (DA) markets in the sense that a DA market is modeled as an evolving market of autonomous interacting traders (automated software agents). The specific DA market on which our modeling is based is the Santa Fe DA market ([12], [13]), which in structure, is a discrete-time version of the Arizona continuous-time experimental DA market ([14], [15]).

Cite

CITATION STYLE

APA

Chen, S. H. (2000). Toward an agent-based computational modeling of bargaining strategies in double auction markets with genetic programming. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1983, pp. 517–531). Springer Verlag. https://doi.org/10.1007/3-540-44491-2_76

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free