Approximation Algorithms for k-Duplicates Combinatorial Auctions with Subadditive Bidders

Wenbin Chen,Jiangtao Meng

doi:10.1007/978-3-540-73556-4_19

Approximation Algorithms for k-Duplicates Combinatorial Auctions with Subadditive Bidders

Wenbin Chen, Jiangtao Meng

https://doi.org/10.1007/978-3-540-73556-4_19

Copy DOI

Publication Date: Aug 14, 2007

Citations: 8

Affiliation: Nanjing University of Aeronautics and Astronautics

#Subadditive Valuations #Algorithms For Combinatorial Auctions + Show 4 more

Abstract
Full-Text PDF
Similar Papers

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 factor-O (√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.

Full Text