@InProceedings{leyton-brown00a,
  author =	 {Kevin Leyton-Brown and Mark Pearson and Yoav Shoham},
  title =	 {Towards a universal test suite for combinatorial
                  auction algorithms},
  googleid = 	 {yuJWudCToFIJ:scholar.google.com/},
  booktitle =	 {Proceedings of the 2nd ACM conference on Electronic
                  commerce},
  year =	 2000,
  isbn =	 1581132727,
  pages =	 {66--76},
  location =	 {Minneapolis, Minnesota, United States},
  doi =		 {10.1145/352871.352879},
  publisher =	 {{ACM} Press},
  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.},
  keywords =     {multiagent combinatorial auctions},
  note = 	 {\url{http://cats.stanford.edu}},
  url = 	 {http://jmvidal.cse.sc.edu/library/leyton-brown00a.pdf},
  cluster = 	 {5953921232055755466},
}