A Decision-Theoretic Algorithm for Bundle Purchasing in Multiple Open Ascending-Price Auction

Download
  1. (PDF, 267 KB)
AuthorSearch for: ; Search for:
TypeArticle
ConferenceThe 17th Conference of the Canadian Society for Computational Studies of Intelligence (AI 2004), May 17-19, 2004., London, Ontario, Canada
AbstractThis 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.
Publication date
LanguageEnglish
AffiliationNRC Institute for Information Technology; National Research Council Canada
Peer reviewedNo
NRC number47144
NPARC number8914321
Export citationExport as RIS
Report a correctionReport a correction
Record identifierb9b9b16b-ac2f-4ae3-93dc-21cbd53b3d0a
Record created2009-04-22
Record modified2016-05-09
Bookmark and share
  • Share this page with Facebook (Opens in a new window)
  • Share this page with Twitter (Opens in a new window)
  • Share this page with Google+ (Opens in a new window)
  • Share this page with Delicious (Opens in a new window)