A mixed multi-unit combinatorial auctions test suite

Authors:
Andrea Giovannucci;Jesus Cerquides;Ulle Endriss;Meritxell Vinyals;Juan A. Rodriguez;Bruno Rosell
Affiliations:
Pompeu Fabra University;University of Barcelona;University of Amsterdam;IIIIA-CSIC;IIIIA-CSIC;IIIIA-CSIC
Venue:
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Year:
2009

Citing 5
Cited 2

Computationally-efficient winner determination for mixed multi-unit combinatorial auctions

Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
A test suite for the evaluation of mixed multi-unit combinatorial auctions

Journal of Algorithms
Decentralized supply chain formation: a market protocol and competitive equilibrium analysis

Journal of Artificial Intelligence Research
Bidding languages and winner determination for mixed multi-unit combinatorial auctions

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Engineering open environments with electronic institutions

Engineering Applications of Artificial Intelligence

ABC4MAS: Assembling Business Collaborations for MAS

WI-IAT '11 Proceedings of the 2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Volume 02
The complexity of mixed multi-unit combinatorial auctions: Tractability under structural and qualitative restrictions

Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

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.