Towards a universal test suite for combinatorial auction algorithms

DMCA

Towards a universal test suite for combinatorial auction algorithms (2000)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Kevin Leyton-brown , Mark Pearson , Yoav Shoham

Venue:	In ACM Electronic Commerce
Citations:	162 - 11 self

BibTeX

@INPROCEEDINGS{Leyton-brown00towardsa,
    author = {Kevin Leyton-brown and Mark Pearson and Yoav Shoham},
    title = {Towards a universal test suite for combinatorial auction algorithms},
    booktitle = {In ACM Electronic Commerce},
    year = {2000},
    pages = {66--76}
}

OpenURL

Abstract

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.

Keyphrases

universal test suite combinatorial auction algorithm distribution family little attention motivated benchmark combinatorial bid general combinatorial auction auction broad real-world domain appropriate data set systematic discussion optimal set many comment methodical evaluation unrestricted bid universal combinatorial auction test suite

DMCA