LJ Schvartzman and MP Wellman
Production and Operations Management, to appear.
Copyright (c) 2006, Schvartzman & Wellman
We study multi-unit double auctions accepting bids with indivisibility constraints. Modeling the auction problem as a Multiple Choice Knapsack Problem and using dynamic programming, we show that incremental computations during bid processing can speed the handling of key auction operations such as clearing and quoting. We propose different price-quote policies and study their influence on the efficiency of market-based allocation. Using a reconfigurable manufacturing scenario where agents trade large quantities of multiple goods, we demonstrate potential benefits of supporting indivisibility constraints in bidding. These benefits are highly sensitive to the form of price quote provided, indicating interesting tradeoffs in communication and allocation efficiency.
A shorter version of this paper was originally presented at the AAMAS-05 Workshop on Agent-Mediated Electronic Commerce, 2005.