An improved approximation algorithm for combinatorial auctions with submodular bidders

@inproceedings{Dobzinski2006AnIA,
  title={An improved approximation algorithm for combinatorial auctions with submodular bidders},
  author={Shahar Dobzinski and Michael Schapira},
  booktitle={SODA},
  year={2006}
}
We explore the allocation problem in combinatorial auctions with submodular bidders. We provide an e/e-1 approximation algorithm for this problem. Moreover, our algorithm applies to the more general class of XOS bidders. By presenting a matching unconditional lower bound in the communication model, we prove that the upper bound is tight for the XOS class.Our algorithm improves upon the previously known 2-approximation algorithm. In fact, we also exhibit another algorithm which obtains an… CONTINUE READING
Highly Influential
This paper has highly influenced 13 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 181 citations. REVIEW CITATIONS

1 Figure or Table

Topics

Statistics

01020'05'06'07'08'09'10'11'12'13'14'15'16'17'18
Citations per Year

181 Citations

Semantic Scholar estimates that this publication has 181 citations based on the available data.

See our FAQ for additional information.