Towards a universal test suite for combinatorial auction algorithms

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 benchmarks. In this paper we present a suite of distribution families for generating realistic, economically motivated combinatorial bids in five broad real-world domains. We hope that this work will yield many comments, criticisms and extensions, bringing the community closer to a universal combinatorial auction test suite.

• Type: Conference
• Year: 2000
• Where: SIGECOM
• Authors: Kevin Leyton-Brown, Mark Pearson, Yoav Shoham
• Keywords: Combinatorial, ECommerce, General Combinatorial Auctions—auctions, SIGECOM 2000, Unrestricted Bids