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

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


Parallelisation and application of AD3 as a method for solving large scale combinatorial auctions

AuthorsCruz-Mencia, Francisco ; Cerquides, Jesús ; Espinosa, Antonio; Moure, Juan C.; Rodríguez-Aguilar, Juan Antonio
KeywordsCombinatorial auctions
Large-scale coordination
Large-scale optimisation
Linear programming
Issue Date2015
AbstractAuctions, and combinatorial auctions (CAs), have been successfully employed to solve coordination problems in a wide range of application domains. However, the scale of CAs that can be optimally solved is small because of the complexity of the winner determination problem (WDP), namely of finding the bids that maximise the auctioneer’s revenue. A way of approximating the solution of a WDP is to solve its linear programming relaxation. The recently proposed Alternate Direction Dual Decomposition algorithm (AD3) has been shown to ef- ficiently solve large-scale LP relaxations. Hence, in this paper we show how to encode the WDP so that it can be approximated by means of AD3. Moreover, we present PAR-AD3, the first parallel implementation of AD3. PAR-AD3 shows to be up to 12.4 times faster than CPLEX in a single-thread execution, and up to 23 times faster than parallel CPLEX in an 8-core architecture. Therefore PAR- AD3 becomes the algorithm of choice to solve large-scale WDP LP relaxations for hard instances. Furthermore, PAR-AD3 has potential when considering large- scale coordination problems that must be solved as optimisation problems.
Appears in Collections:(IIIA) Comunicaciones congresos
Files in This Item:
File Description SizeFormat 
LNCS9037_153-168.pdf700,94 kBAdobe PDFThumbnail
Show full item record
Review this work

Related articles:

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