An Approximate Algorithm for Resource Allocation Using Combinatorial Auctions

Combinatorial auctions (CAs), where users bid on combination of items, have emerged as a useful tool for resource allocation in distributed systems. However, two main difficulties exist to the adoption of CAs in time-constrained environments. The first difficulty involves the computational complexity of winner determination. The second difficulty entails the computational complexity of eliciting utility valuations for all possible combinations of resources to different tasks. To address both issues, we developed a new algorithm, seeded genetic algorithm (SGA) for finding high quality solutions quickly. SGA uses a novel representational schema that produces only feasible solutions. We compare the winner determination performance of our algorithm with Casanova, another local stochastic search procedure, on typically hard-to-solve bid distributions. We show that SGA converges to a better solution than Casanova for large problem sizes. However, for many bid distributions, exact winner determination using integer programming approaches is very fast, even for large problem sizes. In these cases, SGA can still provide significant time savings by eliminating the requirement for formulating all possible bids.

[1]  Amulya Garga,et al.  MASM: a market architecture for sensor management in distributed sensor networks , 2005, SPIE Defense + Commercial Sensing.

[2]  Y. Shoham,et al.  Truth revelation in rapid, approximately efficient combinatorial auctions , 2001 .

[3]  M. Rothkopf,et al.  Why Are Vickrey Auctions Rare? , 1990, Journal of Political Economy.

[4]  Holger H. Hoos,et al.  On the Run-time Behaviour of Stochastic Local Search Algorithms for SAT , 1999, AAAI/IAAI.

[5]  David Levine,et al.  CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions , 2005, Manag. Sci..

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

[7]  Tracy Mullen,et al.  Multi-agent systems for data-rich, information-poor environments , 2006 .

[8]  Michael P. Wellman,et al.  A Parametrization of the Auction Design Space , 2001, Games Econ. Behav..

[9]  T. Sandholm,et al.  Costly valuation computation in auctions , 2001 .

[10]  Daniel Grosu,et al.  Combinatorial auction-based protocols for resource allocation in grids , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

[11]  Arne Andersson,et al.  Integer programming for combinatorial auction winner determination , 2000, Proceedings Fourth International Conference on MultiAgent Systems.

[12]  Craig Boutilier,et al.  Solving Combinatorial Auctions Using Stochastic Local Search , 2000, AAAI/IAAI.

[13]  Ronald M. Harstad,et al.  Computationally Manageable Combinational Auctions , 1998 .

[14]  Barbara Dunin-Keplicz,et al.  Proceedings of the 2005 IEEE/WIC/ACM International Conference on Intelligent Agent Technology , 2005 .

[15]  Vincent Conitzer,et al.  Combinatorial Auctions with k-wise Dependent Valuations , 2005, AAAI.

[16]  David L. Hall,et al.  Customer-Driven Sensor Management , 2006, IEEE Intelligent Systems.

[17]  F. Ygge Optimal Auction Design for Agents with Hard Valuation Problems , .

[18]  Michael P. Wellman,et al.  Combinatorial auctions for supply chain formation , 2000, EC '00.