Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Generating k-best solutions to auction winner determination problems

Generating k-best solutions to auction winner determination problems Auction participants cannot always articulate their requirements and preferences. Sometimes, for instance, the buyer in a procurement auction cannot quantify the value of non-price solution attributes or delineate between hard and soft constraints. This precludes formulating the winner determination problem (WDP) as an optimization problem. Existing decision-support aids for such situations extend an optimization framework. We present an approach that frames the decision problem as one of exploration rather than optimization. Our method relies on an algorithm that generates k -best solutions to auction WDPs. Our algorithm can incorporate hard constraints into the generation process and can scale to practical procurement auctions. We show how to extract useful guidance from k -best WDP solutions, and we evaluate our method using real bids submitted by real suppliers in an HP material parts procurement auction. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM SIGecom Exchanges Association for Computing Machinery

Generating k-best solutions to auction winner determination problems

ACM SIGecom Exchanges , Volume 6 (1) – Jun 1, 2006

Loading next page...
 
/lp/association-for-computing-machinery/generating-k-best-solutions-to-auction-winner-determination-problems-bTXrjSQFzM
Publisher
Association for Computing Machinery
Copyright
Copyright © 2006 by ACM Inc.
ISSN
1551-9031
DOI
10.1145/1150735.1150739
Publisher site
See Article on Publisher Site

Abstract

Auction participants cannot always articulate their requirements and preferences. Sometimes, for instance, the buyer in a procurement auction cannot quantify the value of non-price solution attributes or delineate between hard and soft constraints. This precludes formulating the winner determination problem (WDP) as an optimization problem. Existing decision-support aids for such situations extend an optimization framework. We present an approach that frames the decision problem as one of exploration rather than optimization. Our method relies on an algorithm that generates k -best solutions to auction WDPs. Our algorithm can incorporate hard constraints into the generation process and can scale to practical procurement auctions. We show how to extract useful guidance from k -best WDP solutions, and we evaluate our method using real bids submitted by real suppliers in an HP material parts procurement auction.

Journal

ACM SIGecom ExchangesAssociation for Computing Machinery

Published: Jun 1, 2006

There are no references for this article.