English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/160351
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:

Empirical hardness for mixed auctions

AuthorsAlmajano, Pablo; Cerquides, Jesús ; Rodríguez-Aguilar, Juan Antonio
KeywordsMixed multi-unit combinatorial auction
Machine learning
Issue Date2010
CitationCurrent Topics in Artificial Intelligence, 13th Conference of the Spanish Association for Artificial Intelligence, CAEPIA 2009, Selected Papers. LNAI 5988: 161- 170 (2010)
AbstractMixed Multi-Unit Combinatorial Auctions (MMUCAs) offer a high potential to be employed for the automated assembly of supply chains of agents. However, little is known about the factors making a winner determination problem (WDP) instance hard to solve. In this paper we empirically study the hardness of MMUCAs: (i) to build a model that predicts the time required to solve a WDP instance (because time can be an important constraint during an auction-based negotiation); and (ii) to assess the factors that make a WDP instance hard to solve. © 2010 Springer-Verlag Berlin Heidelberg.
Identifiersdoi: 10.1007/978-3-642-14264-2_17
issn: 0302-9743
Appears in Collections:(IIIA) Comunicaciones congresos
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.