An efficient approximate allocation algorithm for combinatorial auctions

Proceedings of the ACM Conference on Electronic Commerce

Volumn , Issue , 2001, Pages 125-136

  Zurel, Edo ^a   Nisan, Noam ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMBINATORIAL MATHEMATICS; HEURISTIC METHODS; LINEAR PROGRAMMING; RESOURCE ALLOCATION;

APPROXIMATE ALLOCATION ALGORITHM; COMBINATORIAL AUCTIONS;

ALGORITHMS;

EID: 0242708862     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/501158.501172     Document Type: Conference Paper

References (14)

1. A. Andersson, M. Tenhunen, and F. Ygge. Integer programming for combinatorial auction winner determination. In ICMAS, 2000.
2. Y. Bartal, J. Byers, and D. Raz. Global Optimization Using Local Information with Applications to Flow Control. In Proc. of the 38th Ann. IEEE Symp. on Foundations of Computer Science, 1997.
3. Y. Fujishima, K. Leyton-Brown, and Y. Shoham. Taming the computational complexity of combinatorial auctions: Optimal and approximate approaches. In Proceedings of IJCAI'99, Stockholm, Sweden, July 1999. Morgan Kaufmann.
4. D. Lehmann, L.I. O'Callaghan, and Y. Shoham. Truth revelation in rapid, approximately efficient combinatorial auctions. In 1st ACM conference on electronic commerce, 1999.
5. K. Leyton-Brown, M. Pearson, and Y. Shohan. Towards a Universal Test Suite for Combinatorial Auction Algorithms. EC, 2000.
6. M. Luby and N. Nisan. A Parallel Approximation Algorithm for Positive Linear Programming. In Proc. Of 25th ACM Symposium on Theory of Computing, pp. 448-457, 1993.
7. N. Nisan. Bidding and Allocation in Combinatorial Auctions. In EC, 2000.
8. N. Nisan. The Communication Complexity of Combinatorial Auctions. Available from http://www.cs.huji.ac.il/~noam/ccaucecon.pdf, 2001.
9. S. Plotkin, D. Shmoys, and E. Tardos. Fast Approximation Algorithms for Fractional Packing and Covering Problems. Stanford Technical Report No. STAN-CS-92-1419, 1992.
10. M.H. Rothkhof, A. Pekec̃, and R.M. Harstad. Computationally Manageable Combinatorial Auctions. Management Science, 44(8):1131-1147, 1998.
11. T. Sandholm. An algorithm for optimal winner determination in combinatorial auctions. In IJCAI-99, 1999.
12. T.W. Sandholm. Limitations of the vickrey auction in computational multiagent systems. In Proceedings of the Second International Conference on Multiagent Systems (ICMAS-96), pages 299-306, Keihanna Plaza, Kyoto, Japan, December 1996.
13. M. Tennenholtz. Some tractable combinatorial auctions. In Proceedings of AAAI, 2000.
14. R. Vohra and S. de Vries. Combinatorial auctions: A survey, 2000.