English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/138277
logo share SHARE logo core CORE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:


Solving Sequential Mixed Auctions with Integer Programming.

AuthorsMikhaylov, Boris; Cerquides, Jesús ; Rodríguez-Aguilar, Juan Antonio
KeywordsMulti-unit combinatorial auctions
Computational tractability
Supply chain structures
Supply chain formation
Automated assembly
High potential
Auction model
Issue Date2011
CitationLecture Notes in Computer Science 7023/2011: 42- 53 (2011)
AbstractMixed 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.
Identifiersdoi: 10.1007/978-3-642-25274-7_5
issn: 0302-9743
Appears in Collections:(IIIA) Artículos
Files in This Item:
File Description SizeFormat 
accesoRestringido.pdf15,38 kBAdobe PDFThumbnail
Show full item record
Review this work

WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.