A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
A genetic algorithm has been developed to solve bidding strategies in a dynamic multi-unit auction: the Ausubel auction, with independent private values and without dropout information. The genetic algorithm aims to maximize each bidder's payoff. To this end two experimental environments have been tested with decreasing and increasing marginal utilities. The bidding strategies are analyzed, along with their effects on revenue and efficiency. With decreasing marginal utilities the computationaldoi:10.1109/cec.2006.1688630 dblp:conf/cec/MochonQSI06 fatcat:mg4w3lpdwnfadpjycheezvtrj4