Solving sequential mixed auctions with integer programming

Authors:
Boris Mikhaylov;Jesus Cerquides;Juan A. Rodriguez-Aguilar
Affiliations:
Artificial Intelligence Research Institute, Spanish National Research Council, CSIC;Artificial Intelligence Research Institute, Spanish National Research Council, CSIC;Artificial Intelligence Research Institute, Spanish National Research Council, CSIC
Venue:
CAEPIA'11 Proceedings of the 14th international conference on Advances in artificial intelligence: spanish association for artificial intelligence
Year:
2011

Citing 4
Cited 0

Combinatorial Auctions

Combinatorial Auctions
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
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Mixed multi-unit combinatorial auctions (MMUCAs) offer a high potential to be employed for the automated assembly of supply chains of agents. However, in order for mixed auctions to be effectively applied to supply chain formation, we must ensure computational tractability and reduce bidders' uncertainty.With this aim, we introduce Sequential Mixed Auctions (SMAs), a novel auction model conceived to help bidders collaboratively discover supply chain structures. Thus, an SMA allows bidders progressively build a supply chain structure through successive auction rounds.