Mixed multi-unit combinatorial auctions for supply chain management

Authors:
Andrea Giovannucci;Juan A. Rodriguez-Aguilar;Meritxell Vinyals;Jesus Cerquides;Ulle Endriss
Affiliations:
IIIA-CSIC;IIIA-CSIC;IIIA-CSIC;WAI, University of Barcelona;Uninversity of Amsterdam
Venue:
ACM SIGecom Exchanges
Year:
2007

Citing 3
Cited 3

Combinatorial auctions for supply chain formation

Proceedings of the 2nd ACM conference on Electronic commerce
Winner determination for mixed multi-unit combinatorial auctions via petri nets

Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Bidding languages and winner determination for mixed multi-unit combinatorial auctions

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence

Incorporating Trust into Combinatorial Auctions: What Does Trust Cost?

WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 03
Charting the tractability frontier of mixed multi-unit combinatorial auctions

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Proof systems and transformation games

Annals of Mathematics and Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Mixed Multi-Unit Combinatorial Auctions (MMUCAs) allow agents to bid for bundles of goods to buy, goods to sell, and transformations of goods. In particular, MMUCAs offer a high potential to be employed for the automated assembly of supply chains of agents offering goods and services, and in general MMUCAs extend and generalise several types of combinatorial auctions. In this letter, we summarise our current research on MMUCAs and highlight lines for future research.