Behavior of Trading Automata in a Computerized Double Auction Market

This paper reports the results of a series of tournaments held at the Santa Fe Institute beginning in March, 1990 in which computer programs played the roles of buyers and sellers in a simplified synchronized double auction market. We show that despite the decentralized nature of the trading process and traders' incomplete information about supply and demand, transaction price trajectories for a heterogeneous collection of computer programs typically converged to the competitive equilibrium, resulting in allocations that were nearly 100% efficient. We also show that a very simple trading strategy is a higWy effective and robust performer in these markets. A simple rule-of-thumb was able to outperform more complex algoritllms that used statistically-based predictions of future transaction prices, explicit optimizing principles, and sophisticated "learning algorithms". Acknowledgements: This paper is forthcoming in Tile Double Auction Ma.rket: Institutions, Tlleories and Evidence D. Friedman, J. Geanakoplos, D. Lane and J. Rust (eds.) Addison Wesley, 1992. We are grateful for the generosity of the Santa Fe Institute and its Economics program for providing the facilities, salary, administrative, and computational support that made this research possible. John Rust is grateful to the Alfred Sloan Foundation for providing tournament prize money, and National Science Foundation grants SES-8721 199 for computer hardware, and SES-901oo46 for funding of matching human experiments at the Experimental Science Laboratory at the University of Arizona (Vernon Smith, Co-PI). International Business Machines provided funding for tournament organizational expenses. John Miller would like to acknowledge an equipment grant from Sun Microsystems. The general idea of the computerized double auction toumament emerged from discussions in a March 1988 meeting at the Sante Fe Institute, including Phil Anderson, Ken Arrow, Brian Arthur, John Holland, Tim Kehoe, Richard Palmer, John Rust, Tom Sargent, and Eugenia Singer. We also acknowledge helpful discussions with Robert Axelrod, Charles Plott, Vernon Smith, and Shyam Sunder, and extend our tllanks to particular individuals whose expertise made this tournament possible, including Michael Angerman, Marcella Austin, Ronda Butler-Villa, Steven Pope, Ginger Richardson, Dan Schneidewend, Andi Sutherland, George Tsibouris, and Della Ulibarri. We are grateful for helpful comments from Dan Friedman and seminar participants at the Universities of Oslo and Stockholm, and the London School of Economics. Finally we would like to thank all participants of tlle DA tournament for tlleir willingness to commit time and effort in developing an ingenious collection of trading programs.

[1]  J. Ledyard,et al.  Theories of price formation and exchange in double oral auctions , 1986 .

[2]  Dhananjay K. Gode,et al.  Allocative Efficiency of Markets with Zero-Intelligence Traders: Market as a Partial Substitute for Individual Rationality , 1993, Journal of Political Economy.

[3]  Robert H. Wilson Incentive Efficiency of Double Auctions , 1985 .

[4]  D. Friedman A simple testable model of double auction markets , 1991 .

[5]  Tim Bollerslev,et al.  Some Effects of Restricting the Electronic Order Book in an Automated Trade Execution System , 2018 .

[6]  Steven R. Williams,et al.  Bilateral trade with the sealed bid k-double auction: Existence and efficiency , 1989 .

[7]  John O. Ledyard,et al.  The scope of the hypothesis of Bayesian equilibrium , 1986 .

[8]  Kumpati S. Narendra,et al.  Adaptive and Learning Systems , 1986 .

[9]  Anders Krogh,et al.  Introduction to the theory of neural computation , 1994, The advanced book program.

[10]  F. Hayek The economic nature of the firm: The use of knowledge in society , 1945 .

[11]  A. Rubinstein Finite automata play the repeated prisoner's dilemma , 1986 .

[12]  J. Kagel,et al.  Buyer’s Bid Double Auctions: Preliminary Experimental Results , 2018 .

[13]  M. Satterthwaite,et al.  Efficient Mechanisms for Bilateral Trading , 1983 .

[14]  Steven R. Williams,et al.  The Rate of Convergence to Efficiency in the Buyer's Bid Double Auction as the Market Becomes Large , 1989 .

[15]  Vernon L. Smith,et al.  Competitive Market Institutions: Double Auctions vs. Sealed Bid-Offer Auctions , 1982 .

[16]  Roger B. Myerson,et al.  Optimal Auction Design , 1981, Math. Oper. Res..

[17]  W. Hamilton,et al.  The Evolution of Cooperation , 1984 .

[18]  D. J. Roberts,et al.  THE INCENTIVES FOR PRICE-TAKING BEHAVIOR IN LARGE EXCHANGE ECONOMIES , 1976 .

[19]  Ellen R. McGrattan,et al.  Money as a medium of exchange in an economy with artificially intelligent agents , 1990 .

[20]  Aldo Rustichini Convergence to Price-Taking Behavior in a Simple Market , 1990 .

[21]  Richard Wheeler,et al.  Decentralized learning in finite Markov chains , 1985, 1985 24th IEEE Conference on Decision and Control.

[22]  R. Selten,et al.  Duopoly Strategies Programmed by Experienced Players , 1997 .

[23]  Robert B. Wilson On Equilibria of Bid-Ask Markets , 1987 .

[24]  Manuel Blum,et al.  A Machine-Independent Theory of the Complexity of Recursive Functions , 1967, JACM.

[25]  Steven R. Williams Existence and Convergence of Equilibria in the Buyer's Bid Double Auction , 1991 .