A mixed multi-unit combinatorial auctions test suite

ABSTRACT

Supply Chain Formation (SCF) is the process of determining the participants in a supply chain, who will exchange what with whom, and the terms of the exchanges. Mixed multi-unit combinatorial auctions (MMUCAs) offer a high potential to solve SCF problems, and thus be employed for the automated assembly of supply chains of agents. In this paper we present MMUCATS, a test suite for MMUCAs that allows researchers to test, compare, and improve their winner determination algorithms for MMUCAs.

REFERENCES

• 1: J. L. Arcos, M. Esteva, P. Noriega, J. A. Rodriguez-Aguilar, and C. Sierra. Engineering open evironments with electronic institutions. EAAI, 18(2):191--204, 2005.
• 2: J. Cerquides, U. Endriss, A. Giovannucci, and J. A. Rodriguez-Aguilar. Bidding languages and winner determination for mixed multi-unit combinatorial auctions. In IJCAI, pages 1221--1226, 2007.
• 3: Andrea Giovannucci , Meritxell Vinyals , J. A. Rodriguez-Aguilar , Jesus Cerquides, Computationally-efficient winner determination for mixed multi-unit combinatorial auctions, Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems, May 12-16, 2008, Estoril, Portugal
• 4: K. Leyton-Brown and Y. Shoham. Combinatorial Auctions, chapter 18. A Test Suite for Combinatorial Auctions. MIT Press, 2006.
• 5: Meritxell Vinyals , Andrea Giovannucci , Jesús Cerquides , Pedro Meseguer , Juan A. Rodriguez-Aguilar, A test suite for the evaluation of mixed multi-unit combinatorial auctions, Journal of Algorithms, v.63 n.1-3, p.130-150, January, 2008 [doi>10.1016/j.jalgor.2008.02.008]
• 6: W. Walsh and M. Wellman. Decentralized supply chain formation: A market protocol and competitive equilibrium analysis. JAIR, 19:513--567, 2003.

INDEX TERMS

Primary Classification:
  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY

General Terms:
Algorithms, Economics, Experimentation

Keywords:
combinatorial auctions, supply chain management