Toward Comprehensive Real-Time Bidder Support in Iterative Combinatorial Auctions

References

• Ausubel L., Milgrom P. Ascending auctions with package bidding. Frontiers Theoret. Econom. (2002) 1(1). Available from The Berkeley Electronic Press. http://www.bepress.com/bejte/frontiers/vol1/iss1/art1/Google Scholar
• Ausubel L., Cramton P., Milgrom P., Cramton P., Shoham Y., Steinberg R. The clock-proxy auction: A practical combinatorial auction design. Combinatorial Auctions (2006) (MIT Press, Boston, MA) . ch. 5. Forthcoming www.cramton.umd.edu/papers2000-2004/ausubel-cramton-milgrom-the-clockproxy-auction.pdfGoogle Scholar
• Banks J. S., Ledyard J. O., Porter D. Allocating uncertain and unresponsive resources: An experimental approach. RAND J. Econom. (1989) 20(1):1–25Crossref, Google Scholar
• Bitner J., Ehrlich G., Reingold E. Efficient generation of the binary reflected gray code and its applications. Comm. ACM (1976) 19(9):517–521Crossref, Google Scholar
• Brewer P. J., Plott C. R. A binary conflict ascending price (BICAP) mechanism for the decentralized allocation of the right to use railroad tracks. Internat. J. Indust. Organ. (1996) 14(6):857–886Crossref, Google Scholar
• de Vries S., Vohra R. Combinatorial auctions: A survey. INFORMS J. Comput. (2003) 15(3):284–309Link, Google Scholar
• Hevner A., March S., Park J., Ram S. Design science in information systems research. MIS Quart. (2004) 21(1):75–105Crossref, Google Scholar
• Hudson B., Sandholm T. Effectiveness of preference elicitation in combinatorial auctions. (2002) . AAMAS-02 Workshop on Agent-Mediated Electronic Commerce. http://www-2.cs.cmu.edu/~sandholm/elicitation.CMU-CS-02-124.pdfGoogle Scholar
• Kelly F., Steinberg R. A combinatorial auction with multiple winners for universal service. Management Sci. (2000) 46(4):586–596Link, Google Scholar
• Korf R. E. Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence (1985) 27(1):97–109Crossref, Google Scholar
• Leyton-Brown K., Pearson M., Shoham Y. Towards a universal test suite for combinatorial auction algorithms. Proc. ACM Conf. Electronic Commerce (2000) (ACM Press, New York) Crossref, Google Scholar
• Nisan N. Bidding and allocation in combinatorial auctions. Proc. ACM Conf. Electronic Commerce (2000) (ACM Press, New York) . http://www.cs.huji.ac.il/~noam/auctions.pdfCrossref, Google Scholar
• Parkes D. C. iBundle: An efficient ascending price bundle auction. Proc. ACM Conf. Electronic Commerce (1999) (ACM Press, New York) 148–157Crossref, Google Scholar
• Pekec A., Rothkopf M. H. Combinatorial auction design. Management Sci. (2003) 49(11):1485–1503Link, Google Scholar
• Rothkopf M. H., Pekec A., Harstad R. M. Computationally manageable combinatorial auctions. Management Sci. (1998) 44(8):1131–1147Link, Google Scholar
• Sandholm T. An algorithm for optimal winner determination in combinatorial auctions. Proc. IJCAI-99 (1999) (Morgan Kaufman, Stockholm, Sweden) 542–547Google Scholar
• Sandholm T. Algorithm for optimal winner determination in combinatorial auctions. Artificial Intelligence (2002) 135:1–54Crossref, Google Scholar
• Tennenholtz M. Some tractable combinatorial auctions. Proc. 17th National Conf. Artificial Intelligence (2000) (AAAI Press, Austin, TX) 98–103Google Scholar
• Xia M., Stallaert J., Whinston A. Solving the combinatorial double auction problem. Eur. J. Oper. Res. (2005) 164:239–251Crossref, Google Scholar