A data set generation algorithm in combinatorial auctions

0Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The generation of realistic data sets in a Combinatorial Auction may be a challenging problem. Well-formed data sets are very useful in the evaluation of algorithms trying to solve the winner determination problem. In this paper a general data set generation scheme is presented, both from an algorithmic and economic point of view. As a case study, a possible auction setting is discussed where the goods on sale are connections between points in space. © 2005 IEEE.

Cite

CITATION STYLE

APA

Gallo, C. (2005). A data set generation algorithm in combinatorial auctions. In EUROCON 2005 - The International Conference on Computer as a Tool (Vol. I, pp. 744–747). IEEE Computer Society. https://doi.org/10.1109/eurcon.2005.1630038

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free