DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación
Contribución de congreso (ConferenceOutput)
Paving the way for Large-Scale Combinatorial Auctions
The Winner Determination Problem (WDP) in Combinatorial Auctions comes up in a wide range of applications. Linear Programming (LP) relaxations are a standard method for approximating combinatorial optimisation problems. In this paper we propose how to encode the WDP so that it can be approximated with AD3. Moreover, we contribute with PAR-AD3, the first parallel implementation of AD3. We show that while AD3 is up to 4.6 times faster than CPLEX in a single-thread execution, PAR-AD3 is up to 23 times faster than parallel CPLEX in an 8-core architecture. Copyright © 2015, International Foundation for Autonomous Agents and Multiagent Systems (www.ifaamas.org). All rights reserved., This research has been supported by MICINN-Spain under contracts TIN2011-28689-C02-01, TIN2013-45732-C4-4-P and TIN2012-38876-C02-01., Peer reviewed