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
Proceedings of the IEEE International Conference on Systems, Man and Cybernetics
Paper
Adaptive strategies for price markdown in a multi-unit descending price auction: A comparative study
Abstract
In a descending price multi-unit Dutch auction over the Internet, auctioneer gradually decrements per unit price of the item during the course of the auction. We investigate the problem of finding a decrementing price sequence that maximizes auctioneer’s total expected revenue using single-agent Reinforcement Learning. We contrast actual-return (Monte-Carlo based) learning methods with one step Q-learning and also with other adaptive strategies and report extensive comparative performance study. In our experimental design, we model bidders’ strategies in a unique way using various bid functions that capture realistic strategic behavior of bidders in such auction games. Monte-Carlo control algorithm developed here offers consistent performance and yields high average returns in all the experiments.