Adaptive agents for sequential english auctions with a fixed deadline
Refereed conference paper presented and published in conference proceedings


Times Cited
Altmetrics Information
.

Other information
AbstractIn this paper, we consider sequential English auctions with a fixed deadline. The protocol allows the specification of a deadline since in real world trading, it is often essential to conclude a transaction among agents under a fixed deadline. Although there are a lot of differences between continuous double auctions (CDAs) and the sequential English auction, it is possible to modify the agents designed for continuous double auctions and apply them to the sequential English auctions with a fixed deadline. We describe how to revise these adaptive agents, including ZI-C, ZIP, GD, and AA. The performance of these agents is evaluated by two sets of experiments. In the first set of experiments, it turns out that when it is very difficult for all the buyer agents to buy their goods, agents adopting the dominant strategy outperform the revised adaptive bidding strategies. In order to test whether the dominant strategy is always the best choice for difficult buying, we add AA strategy into the experiments. The experimental results demonstrate that AA agents perform better than the agents using the dominant strategy and other adaptive bidding strategies in general. © 2007 IEEE.
All Author(s) ListMa H., Leung H.-F.
Name of Conference9th IEEE International Conference on E-Commerce Technology; The 4th IEEE International Conference on Enterprise Computing, E-Commerce and E-Services, CEC/EEE 2007
Start Date of Conference23/07/2007
End Date of Conference26/07/2007
Place of ConferenceTokyo
Country/Region of ConferenceJapan
Year2007
Month12
Day1
Pages29 - 36
ISBN0769529135
LanguagesEnglish-United Kingdom

Last updated on 2020-28-03 at 00:17