Abstract
The problem of optimal winner determination in combinatorial auctions consists of finding the set of bids that maximize the revenue for the sellers. Various solutions exist for solving this problem but they are all centralized. That is, they assume that all bids are sent to a centralized auctioneer who then determines the winning set of bids. In this paper we introduce the problem of distributed winner determination in combinatorial auctions which eliminates the centralized auctioneer. We present a set of distributed search-based algorithms for solving this problem and study their relative tradeoffs. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Narumanchi, M. V., & Vidal, J. M. (2006). Algorithms for distributed winner determination in combinatorial auctions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3937 LNAI, pp. 43–56). Springer Verlag. https://doi.org/10.1007/11888727_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
