Por favor, use este identificador para citar o enlazar a este item:
http://hdl.handle.net/10261/138277
COMPARTIR / EXPORTAR:
SHARE CORE BASE | |
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL | DATACITE | |
Título: | Solving Sequential Mixed Auctions with Integer Programming. |
Autor: | Mikhaylov, Boris; Cerquides, Jesús CSIC ORCID ; Rodríguez-Aguilar, Juan Antonio CSIC ORCID CVN | Palabras clave: | Multi-unit combinatorial auctions Computational tractability Supply chain structures Supply chain formation Automated assembly High potential Auction model |
Fecha de publicación: | 2011 | Editor: | Springer Nature | Citación: | Lecture Notes in Computer Science 7023/2011: 42- 53 (2011) | Resumen: | 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. | URI: | http://hdl.handle.net/10261/138277 | DOI: | 10.1007/978-3-642-25274-7_5 | Identificadores: | doi: 10.1007/978-3-642-25274-7_5 issn: 0302-9743 |
Aparece en las colecciones: | (IIIA) Artículos |
Ficheros en este ítem:
Fichero | Descripción | Tamaño | Formato | |
---|---|---|---|---|
accesoRestringido.pdf | 15,38 kB | Adobe PDF | Visualizar/Abrir |
CORE Recommender
SCOPUSTM
Citations
4
checked on 03-abr-2024
Page view(s)
213
checked on 18-abr-2024
Download(s)
129
checked on 18-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.