1. Banks, J., Ledyard, J., and D. Porter, Allocating uncertain and unresponsive resources: an experimental approach. Rand Journal of Economics, 20, 1–25 (2000).
2. Davenport, A.J. and J.R. Kalagnanam, Price Negotiations for Procurement of Direct Inputs, in Mathematics of the Internet: Auctions and Markets, Vol. 127, B. Dietrich and R. Vohra, Springer Verlag, New York.
3. Elmaghraby W. and P. Keskinocak, Technology for transportation bidding at The Home Depot. Teaching Case, Georgia Institute of Technology (2000).
4. Fujishima, Y., Leyton-Brown, K., and Y. Shoham, Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches, in Proceedings of IJCAI-99, 548–553 (1999).
5. Kelly, F. and R. Steinberg, A combinatorial auction with multiple winners for universal service. Management Science, 46(4), 586–596 (2000).