Abstract
In this paper, we study the problem of maximizing welfare in combinatorial auctions with k duplicates of each item, where bidders are subadditive. We present two approximation algorithms for k-duplicates combinatorial auctions with subadditive bidders. First, we give a factorO(√m) approximation algorithm for k-duplicates combinatorial auctions with subadditive valuations using value queries. This algorithm is also incentive compatible. Secondly, we give a factor-O(log m) approximation algorithm for k-duplicates combinatorial auctions with subadditive valuations using demand queries. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Chen, W., & Meng, J. (2007). Approximation algorithms for k-duplicates combinatorial auctions with subadditive bidders. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4616 LNCS, pp. 163–170). Springer Verlag. https://doi.org/10.1007/978-3-540-73556-4_19
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
