About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
ACM Conference on Electronic Commerce 2001
Conference paper
High-performance bidding agents for the continuous double auction
Abstract
We develop two bidding algorithms for real-time Continuous Double Auctions (CDAs) using a variety of market rules that offer what we believe to be the strongest known performance of any published bidding strategy. Our algorithms are based on extensions of the "ZIP" (Cliff, 1997) and "GD" (Gjerstad and Dickhaut, 1998) strategies: we have made essential modifications to these strategies which enable trading multiple units in real-time markets. We test these strategies against each other and against the sniping strategy of (Rust et al., 1992) and the baseline "Zero Intelligence" strategy of (Gode and Sunder, 1992), using both a discrete-time simulator and a genuine real-time multi-agent environment called MAGENTA (Das et al., 2001). Under various market rules and limit price distributions, our modified Gjerstad-Dickhaut ("MGD") strategy outperforms the original GD, and generally dominates the other strategies.