• Journal of KIISE:Software and Applications
• /
• v.32 no.11
• /
• pp.1099-1110
• /
• 2005

As auctions become popular, developing good agent bidding strategies has been an important focus in agent-based electronic commerce research. Especially for the continuous double auctions where no single dominant strategy is known, the agent bidding strategy has practical significance. This paper introduces an adaptive agent strategy for the countinuous double auction. The central idea is to let the agent figure out at run time when the sophisticated strategy (called the p-strategy) is beneficial and when a simpler strategy is better. Balance between exploration and exploitation is achieved by using a heuristic exploration function that trades off the expected profits and the number of tries of each strategy. We have experimentally evaluated the performance of the adaptive strategy in a wide variety of environments. The experiment results indicate that the adaptive strategy outperforms the plain p-strategy when the p-strategy performs poorly, while it performs similar to the p-strategy when the p-strategy dominates the other simple strategies.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2001.01a
• /
• pp.78-82
• /
• 2001

Most of current Internet auction systems are simple server programs that partly automated the function of the conventional auction house. These system do not provide sufficient independence, distribution and parallelism between the functions of the conventional auction house. In there are automated by server program, but still users need to execute a repetitive task to monitor the dynamic progress of a certain auction, decide proper bid price, and submit the bid. Another problem is that they support only single as English auction and Dutch auction, but they do not support the double auctions are superior to the single auction with respect to speed., efficiency, and the fair distribution of profit. In this paper, we present design and implement of an agent-based continuous double auction system, called CoDABot, in order to mitigate the limitations of current auctions system. CoDABot supports continuous double auction, provides various bidding agent for users to select, and has been implemented into a multi-agent system that realize more independent, distributed, and parallel subsystems.

• Journal of KIISE:Computing Practices and Letters
• /
• v.7 no.6
• /
• pp.641-652
• /
• 2001

Most of current internet auction systems are single auction server program that partly automates the function of the conventional auction house. So these systems do not provide sufficient independence, distribution and parallelism between the functions of the conventional auction house. In these suction systems, only some of suction management facilities are automated by the server program, but still users need to execute a repetitive task to monitor the dynamic progress of a certain auction, decide the proper bid price, and submit the bid. Another problem is that they support only the single auctions such as English suction and Dutch auction, but they do not support the double auctions that are superior to the single auction in terms of speed, efficiency, and the fair distribution of profit. In this paper, we present are design and implement of an agent-based continuous double auction system, called CoDABot, in order to overcome the limitations of current auction systems. CoDABot supports the continuous double auction, provides various bidding agents for users to select, and has been implemented with a multi-agent system to realize more independent, and parallel subsystems.