A risk-based bidding strategy for continuous double auctions
A risk-based bidding strategy for continuous double auctions
No Thumbnail Available
Date
2004-01-01
Authors
Vytelingum, Perukrishnen
Dash, Rajdeep K.
David, Esther
Jennings, Nicholas R.
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
We develop a novel bidding strategy that software agents can use to buy and sell goods in Continuous Double Auctions (CDAs). Our strategy involves the agent forming a bid or ask by assessing the degree of risk involved and making a prediction about the competitive equilibrium that is likely to be reached in the marketplace. We benchmark our strategy against two of the most common strategies for CDAs, namely the Zero-Intelligence and the Zero- Intelligence Plus strategies, and we show that our agents outperform these benchmarks. Specifically, our agents win in 100% of the simulations against the ZI agents and, on average, 75% of the games against the ZIP agents.
Description
Keywords
Citation
Frontiers in Artificial Intelligence and Applications. v.110