Por favor, use este identificador para citar o enlazar a este item:
http://hdl.handle.net/10261/160351COMPARTIR / EXPORTAR:
 SHARE
 CORE
BASE
|
|
| Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL | DATACITE | |
| Título: | Empirical hardness for mixed auctions |
Autor: | Almajano, Pablo; Cerquides, Jesús CSIC ORCID ; Rodríguez-Aguilar, Juan Antonio CSIC ORCID CVN | Palabras clave: | Mixed multi-unit combinatorial auction Machine learning |
Fecha de publicación: | 2010 | Editor: | Springer Nature | Citación: | Current Topics in Artificial Intelligence, 13th Conference of the Spanish Association for Artificial Intelligence, CAEPIA 2009, Selected Papers. LNAI 5988: 161- 170 (2010) | Resumen: | Mixed 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. | URI: | http://hdl.handle.net/10261/160351 | DOI: | 10.1007/978-3-642-14264-2_17 | Identificadores: | doi: 10.1007/978-3-642-14264-2_17 issn: 0302-9743 |
| Aparece en las colecciones: | (IIIA) Comunicaciones congresos |
Ficheros en este ítem:
| Fichero | Descripción | Tamaño | Formato | |
|---|---|---|---|---|
| accesoRestringido.pdf | 15,38 kB | Adobe PDF |  Visualizar/Abrir |
CORE Recommender
SCOPUSTM
Citations
2
checked on 25-abr-2024
Page view(s)
227
checked on 22-abr-2024
Download(s)
78
checked on 22-abr-2024
Google ScholarTM
Check
Altmetric
Altmetric
NOTA: Los ítems de Digital.CSIC están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.