iAuctionMaker: a decision support tool for mixed bundling

This paper presents iAuctionMaker as a novel tool that serves as a decision support for e-sourcing professionals on their pursuing of auction optimisation. Given a set of items to auction, iAuctionMaker helps an auctioneer determine how to separate items into promising bundles that are likely to produce better outcomes than the bundle of items as a whole. Promising bundles are those that satisfy certain properties believed to be present in competitive sourcing scenarios. These properties are defined by e-sourcing professionals and capture their experience and knowledge in the domain. iAuctionMaker models this knowledge as constraints to be satisfied by any bundle, and implements an optimisation algorithm to find the bundles that maximize satisfaction. Experimental results are shown to demonstrate the applicability of the approach. Case studies are presented to demonstrate that iAuctionMaker improves current e-sourcing practices and provides an alternative to combinatorial scenarios whose complexity hinders their application in actual-world sourcing scenarios.

[1]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[2]  D. Parkes,et al.  Auctions, Bidding and Exchange Design , 2004 .

[3]  Eppen Gd,et al.  Bundling--new products, new markets, low risk. , 1991 .

[4]  Yannis Bakos,et al.  Bundling and Competition on the Internet , 1999 .

[5]  David C. Parkes,et al.  Optimal Auction Design for Agents with Hard Valuation Problems , 1999, Agent Mediated Electronic Commerce.

[6]  Subhash Suri,et al.  Side constraints and non-price attributes in markets , 2006, Games Econ. Behav..

[7]  Donald L. Kreher,et al.  Combinatorial algorithms: generation, enumeration, and search , 1998, SIGA.

[8]  Merle Crawford,et al.  Bundling—New products, new markets, low risk , 1992 .

[9]  Janet L. Yellen,et al.  Commodity Bundling and the Burden of Monopoly , 1976 .

[10]  Yannis Bakos,et al.  Bundling Information Goods: Pricing, Profits and Efficiency , 1998 .

[11]  David Levine,et al.  Winner determination in combinatorial auction generalizations , 2002, AAMAS '02.

[12]  A. Nijenhuis Combinatorial algorithms , 1975 .

[13]  Jeffrey O. Kephart,et al.  Competitive bundling of categorized information goods , 2000, EC '00.

[14]  A. Regan,et al.  Approximation Algorithms for the Bid Construction Problem in Combinatorial Auctions for the Procurement of Freight Transportation Contracts , 2003 .

[15]  Andrea Giovannucci,et al.  Towards automated procurement via agent-aware negotiation support , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..

[16]  J. Cerquides,et al.  Embedding Decision Support in E-Sourcing Tools: Quotes, A Case Study , 2003 .

[17]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[18]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .