Approximation algorithms for combinatorial auctions with complement-free bidders

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2005, Pages 610-618

  Dobzinski, Shahar ^a   Nisan, Noam ^a   Schapira, Michael ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

Combinatorial Auctions

Indexed keywords

APPROXIMATION ALGORITHMS; BIDDERS; COMBINATORIAL AUCTIONS;

APPROXIMATION THEORY; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING;

ALGORITHMS;

EID: 34848876979     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1060590.1060681     Document Type: Conference Paper

References (24)

1. Aaron Archer, Christos Papadimitriou, Kunal Talwar, and Eva Tardos. An approximate truthful mechanism for combinatorial auctions with single parameter agent. In Proceedings of the 14th Annual ACM Symposium on Discrete Algorithms (SODA), 2003.
2. Yair Bartal, Rica Gonen, and Noam Nisan. Incentive compatible multi unit combinatorial auctions. In TARK 03, 2003.
3. Alejandro Bertelsen and Daniel Lehmann. Substitutes valuations: M#-concavity. Working Paper.
4. Liad Blumrosen and Noam Nisan. On the computational power of iterative auctions I: Demand queries, 2005. Working paper.
5. Peter Cramton, Yoav Shoham, and Richard Steinberg (Editors). Combinatorial Auctions. MIT Press. Forthcoming., 2005. http://www.craniton.urnd.edu/papers2000-2004/ cramton-shoham-steinberg-combinatorial-auctions.pdf.
6. Shahar Dobzinski and Michael Schapira. Optimal upper and lower approximation bounds for k-duplicates combinatorial auctions, 2005. Working paper.
7. Uriel Feige. A threshold of In n for approximating set cover. Journal of the ACM, 45(4):634-652, 1998.
8. Martin Grötschel. Lászlo Lovász. and Alexander Schrijver. The ellipsoid method and its consequences in combinatorial optimization. IIASA Collab. Proceedings Ser. CP-81-S1, pages 511-546, 1981.
9. T. Groves. Incentives in teams. Econometrica, pages 617-631, 1973.
10. J. Håstad. Some optimal inapproximability results. In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pages 1-10, 1997.
11. Ron Holzman, Noa Kfir-Dahav, Dov Monderer, and Moshe Tennenholtz. Bundling equilibrium in combinatrial auctions. Games and Economic Behavior, 47:104-123, 2004.
12. Subhash Khot, Richard Lipton, Evangelos Markakis, and Aranyak Mehta. Inapproximability results for combinatorial auctions with subnioclular utility functions, 2005. Working paper.
13. Samir Khuller, Anna Moss, and Joseph (Seffi) Naor. The budgeted maximum coverage problem. Inf. Process. Lett., 70(1):39-45, 1999.
14. Benny Lehmann, Daniel Lehmann, and Noam Nisan. Combinatorial auctions with decreasing marginal utilities. In ACM conference on electronic commerce, 2001.
15. Daniel Lehmann, Liadan Ita O'Callaghan, and Yoav Shoham. Truth revelation in approximately efficient combinatorial auctions. In JACM 49(5), pages 577-602, Sept. 2002.
16. Noam Nisan. The communication complexity of approximate set packing and covering. In ICALP 2002.
17. Noam Nisan. RL ⊆ SC. In Proceedings of the twenty-fourth annual ACM symposium on Theory of computing, pages 619-623. ACM Press, 1992.
18. Noam Nisan. Chapter 9: Bidding Languages. In Peter Cramton and Yoav Shoham, and Richard Steinberg (Editors), Combinatorial Auctions. MIT Press. Forthcoming, 2005. Available from http://www.cs.huji.ac.il/~noam/mkts.html.
19. Noam Nisan and Amir Ronen. Computationally feasible vcg-based mechanisms. In ACM Conference on Electronic Commerce, 2000.
20. Noam Nisan and Ilya Segal. The communication requirements of efficient allocations and supporting lindahl prices, 2003. Working paper.
21. Tuomas Sandholm. Algorithm for optimal winner determination in combinatorial auctions. Artificial Intelligence, 135(1-2):1-54, 2002.
22. Alexander Schrijver. A combinatorial algorithm minimizing submodular functions in stronglypolynomial time. J. Comb. Theory Ser. B, 80(2):346-355, 2000.
23. D. Sivakumar. Algorithmic derandomization via complexity theory. In Proceedings of the 34th annual ACM Syinposiurn on Theory of Computing (STOC), 2002.
24. Robert Endre Tarjan. Data structures and network algorithms. Society for Industrial and Applied Mathematics, 1983.