Mochón, AsunciónSáez Achaerandio, YagoQuintana, DavidIsasi, Pedro2009-04-202009-04-202007-09IEEE Congress on Evolutionary Computation, 2007. CEC 2007. p. 228-235978-1-4244-1339-3https://hdl.handle.net/10016/4018Congress on Evolutionary Computation. Singapore, 25-28 September 2007A genetic algorithm has been developed to solve bidding strategies in a dynamic multi-unit auction: the Ausubel auction. The genetic algorithm aims to maximize each bidder's payoff. To this end, a memory system about past experiences has been implemented. An extensive set of experiments have been carried out where different parameters of the genetic algorithm have been used in order to make a robust test bed. The present model has been studied for several environments that involve the presence or absence of synergies. For each environment, the bidding strategies, along with their effects on revenue and efficiency, are analyzed. No theoretical predictions have been developed yet for this auction format when values involve synergies; therefore, the aim of this work is to study the auction outcome where theoretical predictions are unknown. The results obtained with the genetic algorithm developed in this research reveal that without synergies, bidders tend to bid sincerely. Nevertheless, in the presence of synergies, when bidders have memory about their past results, they tend to shade their bids.application/pdfeng© IEEEconference paperInformática10.1109/CEC.2007.4424476open access228235IEEE Congress on Evolutionary Computation, 2007. CEC 2007