BOB: Improved winner determination in combinatorial auctions and generalizations

Artificial Intelligence

Volumn 145, Issue 1-2, 2003, Pages 33-58

  Sandholm, Tuomas ^a   Suri, Subhash ^b  

^a Carnegie Mellon University   (United States)

^b University of California   (United States)

Author keywords

Auction; Bidding with synergies; Combinatorial auction; Multi item auction; Multi object auction; Multiagent systems; Winner determination

Indexed keywords

ALGORITHMS; DATA STRUCTURES; OPTIMIZATION; PROBLEM SOLVING; RESOURCE ALLOCATION;

MULTI-OBJECT AUCTION;

MULTI AGENT SYSTEMS;

EID: 0037380350     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(03)00015-8     Document Type: Article

References (33)

1. Andersson A., Tenhunen M., Ygge F. Integer programming for combinatorial auction winner determination. Proc. Fourth International Conference on Multi-Agent Systems (ICMAS), Boston, MA. 2000;39-46.
2. Boutilier C., Goldszmidt M., Sabata B. Sequential auctions for the allocation of resources with complementarities. Proc. IJCAI-99, Stockholm, Sweden. 1999;527-534.
3. C. DeMartini, A. Kwasnica, J. Ledyard, D. Porter, A new and improved design for multi-object iterative auctions, Technical Report 1054, California Institute of Technology, Social Science, September 1999.
4. Edmonds J. Maximum matching and a polyhedron with 0, 1 vertices. J. Res. Nat. Bur. Standards B. 69:1965;125-130.
5. 2) algorithm for circular-arc graph recognition. Proc. Annual SIAM-ACM Symposium on Discrete Algorithms (SODA). 1993;128-137.
6. Fujishima Y., Leyton-Brown K., Shoham Y. Taming the computational complexity of combinatorial auctions: Optimal and approximate approaches. Proc. IJCAI-99, Stockholm, Sweden. 1999;548-553.
7. Gonen R., Lehmann D. Optimal solutions for multi-unit combinatorial auctions: Branch and bound heuristics. Proc. ACM Conference on Electronic Commerce (ACM-EC), Minneapolis, MN. 2000;13-20.
8. 1-ε. Acta Math. 182:1999;105-142.
9. Hoos H., Boutilier C. Solving combinatorial auctions using stochastic local search. Proc. AAAI-00, Austin, TX. 2000;22-29.
10. Kelly F., Steinberg R. A combinatorial auction with multiple winners for universal services. Management Sci. 46:(4):2000;586-596.
11. Korte N., Mohring R.H. An incremental linear-time algorithm for recognizing interval graphs. SIAM J. Comput. 18:(1):1989;68-81.
12. Lehmann D., O'Callaghan L.I., Shoham Y. Truth revelation in rapid, approximately efficient combinatorial auctions. J. ACM. 2003;. To appear. Early version appeared in ACMEC-99.
13. Leyton-Brown K., Tennenholtz M., Shoham Y. An algorithm for multi-unit combinatorial auctions. Proc. AAAI-00, Austin, TX. 2000.
14. McAfee R.P., McMillan J. Analyzing the airwaves auction. J. Economic Perspectives. 10:(1):1996;159-175.
15. McMillan J. Selling spectrum rights. J. Economic Perspectives. 8:(3):1994;145-162.
16. Myerson R., Satterthwaite M. Efficient mechanisms for bilateral exchange. J. Economic Theory. 28:1983;265-281.
17. Nisan N. Bidding and allocation in combinatorial auctions. Proc. ACM Conference on Electronic Commerce (ACM-EC), Minneapolis, MN. 2000;1-12.
18. Rassenti S.J., Smith V.L., Bulfin R.L. A combinatorial auction mechanism for airport time slot allocation. Bell J. Economics. 13:1982;402-417.
19. Rothkopf M.H., Pekeč A., Harstad R.M. Computationally manageable combinatorial auctions. Management Sci. 44:(8):1998;1131-1147.
20. Russell S., Norvig P. Artificial Intelligence: A Modern Approach. 1995;Prentice Hall, Englewood Cliffs, NJ.
21. Sandholm T. An implementation of the contract net protocol based on marginal cost calculations. Proc. AAAI-93, Washington, DC. 1993;256-262.
22. Sandholm T. Issues in computational Vickrey auctions. Internat. J. Electronic Commerce. 4:(3):2000;107-129. Special Issue on Applying Intelligent Agents for Electronic Commerce. A short, early version appeared at the Second International Conference on Multi-Agent Systems (ICMAS), 1996, pp. 299-306.
23. Sandholm T. Issues in computational Vickrey auctions. Internat. J. Electronic Commerce. 4:(3):2000;107-129. Special Issue on Applying Intelligent Agents for Electronic Commerce. A short, early version appeared at the Second International Conference on Multi-Agent Systems (ICMAS), 1996, pp. 299-306.
24. Sandholm T. Algorithm for optimal winner determination in combinatorial auctions. Artificial Intelligence. 135:2002;1-54. First appeared as an invited talk at the First International Conference on Information and Computation Economies, Charleston, SC, October 25-28, 1998. Extended version appeared as Washington Univ., Dept. of Computer Science, Technical Report WUCS-99-01, January 28th, 1999. Conference version appeared at the International Joint Conference on Artificial Intelligence (IJCAI), Stockholm, Sweden, 1999, pp. 542-547.
25. Sandholm T. Algorithm for optimal winner determination in combinatorial auctions. Artificial Intelligence. 135:2002;1-54. First appeared as an invited talk at the First International Conference on Information and Computation Economies, Charleston, SC, October 25-28, 1998. Extended version appeared as Washington Univ., Dept. of Computer Science, Technical Report WUCS-99-01, January 28th, 1999. Conference version appeared at the International Joint Conference on Artificial Intelligence (IJCAI), Stockholm, Sweden, 1999, pp. 542-547.
26. Sandholm T. eMediator: A next generation electronic commerce server. Computational Intelligence. 18:(4):2002;656-676. Early versions appeared in the Conference on Autonomous Agents (AGENTS-00), 2000, pp. 73-96; AAAI-99 Workshop on AI in Electronic Commerce, Orlando, FL, July 1999, pp. 46-55; and as a Washington University, St. Louis, Dept. of Computer Science Technical Report WU-CS-99-02, January 1999.
27. Sandholm T. eMediator: A next generation electronic commerce server. Computational Intelligence. 18:(4):2002;656-676. Early versions appeared in the Conference on Autonomous Agents (AGENTS-00), 2000, pp. 73-96; AAAI-99 Workshop on AI in Electronic Commerce, Orlando, FL, July 1999, pp. 46-55; and as a Washington University, St. Louis, Dept. of Computer Science Technical Report WU-CS-99-02, January 1999.
28. Sandholm T. eMediator: A next generation electronic commerce server. Computational Intelligence. 18:(4):2002;656-676. Early versions appeared in the Conference on Autonomous Agents (AGENTS-00), 2000, pp. 73-96; AAAI-99 Workshop on AI in Electronic Commerce, Orlando, FL, July 1999, pp. 46-55; and as a Washington University, St. Louis, Dept. of Computer Science Technical Report WU-CS-99-02, January 1999.
29. Sandholm T., Suri S., Gilpin A., Levine D. CABOB: A fast optimal algorithm for combinatorial auctions. Proc. IJCAI-01, Seattle, WA. 2001;1102-1108.
30. Sandholm T., Suri S., Gilpin A., Levine D. Winner determination in combinatorial auction generalizations. International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), Bologna, Italy. 2002;69-76. Early version appeared at the AGENTS-01 Workshop on Agent-Based Approaches to B2B, Montreal, Canada, May 2001, pp. 35-41.
31. Sandholm T., Suri S., Gilpin A., Levine D. Winner determination in combinatorial auction generalizations. International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), Bologna, Italy. 2002;69-76. Early version appeared at the AGENTS-01 Workshop on Agent-Based Approaches to B2B, Montreal, Canada, May 2001, pp. 35-41.
32. Tennenholtz M. Some tractable combinatorial auctions. Proc. AAAI-00, Austin, TX. 2000.
33. Weiss M.A. Data Structures and Algorithm Analysis in C++. 2nd Edition: 1999;Addison-Wesley, Reading, MA.