A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Towards a universal test suite for combinatorial auction algorithms
2000
Proceedings of the 2nd ACM conference on Electronic commerce - EC '00
General combinatorial auctions-auctions in which bidders place unrestricted bids for bundles of goods-are the subject of increasing study. Much of this work has focused on algorithms for finding an optimal or approximately optimal set of winning bids. Comparatively little attention has been paid to methodical evaluation and comparison of these algorithms. In particular, there has not been a systematic discussion of appropriate data sets that can serve as universally accepted and well motivated
doi:10.1145/352871.352879
dblp:conf/sigecom/Leyton-BrownPS00
fatcat:45knbw3qdzgaxj4sqzugn2aabq