The 17th Conference of the Canadian Society for Computational Studies of Intelligence (AI 2004), May 17-19, 2004, London, Ontario, Canada
This paper presents an algorithm for decision-making where the buyer needs to procure one of possibly many bundles of complementary products, and items are sold individually in multiple open ascending price (English) auctions. Auctions have fixed start and end times, and some may run concurrently. Expected utility of a bidding choice is computed by considering expected utility of choices at future decisions. The problem is modeled as a Markov decision process, and dynamic programming is used to determine the value of bidding/not bidding in each state. Three techniques for reducing the state space are given. Results show that a bidding agent using this algorithm achieves significantly higher utility on average when compared with one that does not consider the value of future choices.
The 17th Conference of the Canadian Society for Computational Studies of Intelligence (AI 2004) [Proceedings].