1 |
E. Zurel and N. Nisan, 'An efficient approximate allocation algorithm for combinatorial auctions,' In ACM Conference on Electronic Commerce, pp. 125-136, 2001
DOI
|
2 |
M. H. Rothkopf, A. Pekec, And R. M. Harstad, 'Computationally manageable combinatorial auctions,' Management Science, Vol.44, No.8, pp. 1131-1147, 1995
DOI
ScienceOn
|
3 |
Y. Fujishima, K. Leyton-Brown, And Y. Shoham, 'Taming the computational complexity of combinatorial auctions: Optimal and approximate approaches,' In Proceedimgs of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI), pp. 548-553, 1999
|
4 |
N. Nisan, 'Bidding and allocation in combinatorial auctions,' In ACM Conference on Electronic Commerce, pp. 1-12, 2000
DOI
|
5 |
S. de Vries, R. Vohra, 'Combinatoral auctions: A Survey,' Draft, 2000
|
6 |
T. Sandholm, S. Suri, A. Gilpin, and D. Levine, 'CABOB: A fast optimal algorithm for combinatorial auctions,' In Proceedings of the Seventeenth International Joint Conference an Artificial Intelligence (IJCAI), pp. 1102-1108, 2001
|
7 |
S. J. Rassenti, V. L. Smith, and R. L. Bulfin, 'A combinatorial auction mechanism for airport time slot allocation,' Bell Journal of Economics, 13, pp. 402-417, 1982
DOI
|
8 |
A. Andersson, M. Tenhunen, and F. Ygge, 'Integer programming for combinatorial auction winner determination,' In Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS), pp. 39-46, 2000
DOI
|
9 |
R. Gonen and D. Lehmann, 'Linear Programming helps solving large multi-unit combinatorial auctions,' Electronic Market Design Workshop, July 11-13, 2001
|