Combinatorial Auctions, an Example of Algorithm Theory in Real Life
- 461 Downloads
In this article, we discuss combinatorial auctions, an interesting inter-disciplinary research field in Computer Science and Economics. In particular, we will (a) describe a set of real-world cases, (b) how to solve the associated computational problems, and (c) discuss the impact of the probability distributions chosen for benchmarking.
KeywordsCombinatorial Auction Binary Search Tree Algorithm Theory Winner Determination Winner Determination Problem
Unable to display preview. Download preview PDF.
- 2.A. Andersson, M. Tenhunen, and F. Ygge. Integer programming for combinatorial auction winner determination: Extended version. Technical report, Department of Information Technology, Uppsala University, July 2000. (Available from http://www.it.uu.se).
- 3.K. Asrat and A. Andersson. Caching in multi-unit combinatorial auctions. In Proceedings of AAMAS, 2002.Google Scholar
- 4.E. Balas. An additive algorithm for solving linear programs with zero-one variables. The Journal of the Operations Research Society of America, pages 517–546, 1965.Google Scholar
- 6.Y. Fujishima, K. Leyton-Brown, and Y. Shoham. Taming the computational complexity of combinatorial auctions: Optimal and approximate approaches. In Proceeding of the Sixteenth International Joint Conference on Artificial Intelligence, IJCAI’99, pages 548–553, August 1999. (Available from http://robotics.stanford.edu/~kevinlb).
- 9.A. Mas-Colell, M. Whinston, and J. R. Green. Microeconomic Theory. Oxford University Press, 1995.Google Scholar
- 11.N. Nisan. Bidding and allocation in combinatorial auctions. Working paper. Presented at the 1999 NWU Microeconomics Workshop. (Available from http://www.cs.huji.ac.il/ noam/), 1999.
- 12.D. Parkes. iBundle: An efficient ascending price bundle auction. In Proceedings of the First International Conference on Electronic Commerce, pages 148–157. ACM Press, Box 11405, New York, NY, November 1999. (Available from http://www.cis.upenn.edu/~dparkes).
- 15.T. W. Sandholm. An algorithm for optimal winner determination in combinatorial auctions. In Proceeding of the Sixteenth International Joint Conference on Artificial Intelligence, IJ-CAI’99, pages 542–547, August 1999. (Available from http://ўw.cs.wustl.edu/r~sandholm).
- 16.P. Wurman. Market Structure and Multidimensional Auction Design for Computational Economies. PhD thesis, Department of Computer Science, University of Michigan, 1999. (Available from http://ўw.csc.ncsu.edu/faculty/wurman).