Sciweavers

Share
CAEPIA
2011
Springer

Solving Sequential Mixed Auctions with Integer Programming

7 years 10 months ago
Solving Sequential Mixed Auctions with Integer Programming
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.
Boris Mikhaylov, Jesús Cerquides, Juan A. R
Added 13 Dec 2011
Updated 13 Dec 2011
Type Journal
Year 2011
Where CAEPIA
Authors Boris Mikhaylov, Jesús Cerquides, Juan A. Rodríguez-Aguilar
Comments (0)
books