Expressive commerce and its application to sourcing: How we conducted $35 billion of generalized combinatorial auctions

AI Magazine

Volumn 28, Issue 3, 2007, Pages 45-58

  Sandholm, Tuomas ^a,b  

^a Carnegie Mellon University   (United States)

^b CombineNet Inc ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ELECTRONIC AUCTIONS; EXPRESSIVE COMMERCE; TREE SEARCH ALGORITHMS;

ALGORITHMS; OPTIMIZATION; OUTSOURCING; PARETO PRINCIPLE;

ELECTRONIC COMMERCE;

EID: 35349025425     PISSN: 07384602     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (35)

1. Boutilier, C. 2002. Solving Concisely Expressed Combinatorial Auction Problems. In Proceedings of the Eighteenth National Conference on Artificial Intelligence. Menlo Park, CA: AAAI Press.
2. Boutilier, C.; Sandholm, T.; and Shields, R. 2004. Eliciting Bid Taker Nonprice Preferences in (Combinatorial) Auctions. In Proceedings of the Nineteenth National Conference on Artiticial Intelligence. Menlo Park, CA: AAAI Press.
3. Caplice, C., and Sheffi, Y. 2003. Optimization-Based Procurement for Transportation Services. Journal of Business Logistics 24(2): 109-128.
4. Conitzer, V.; Derryberry, J.; and Sandholm, T. 2004. Combinatorial Auctions with Structured Item Graphs. In Proceedings of the Nineteenth National Conference on Artificial Intelligence. Menlo Park, CA: AAAI Press. de Vries, S., and Vohra, R. 2003. Combinatorial Auctions: A Survey. INFORMS Journal on Computing 15(3): 284-309.
5. Fujishima, Y.; Leyton-Brown, K.; and Shoham, Y. 1999. Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches. In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence. San Francisco: Morgan Kaufmann Publishers.
6. Gilpin, A., and Sandholm, T. 2007. Information-Theoretic Approaches to Branching in Search. In Proceedings of the Twentieth International Joint Conference on Artificial Intelligence. Menlo Park, CA: AAAI Press.
7. Hohner, G.; Rich, J.; Ng, E.; Reid, G.; Davenport, A.; Kalagnanam, J.; Lee, H.; and An, C. 2003. Combinatorial and Quantity-Discount Procurement Auctions Benefit Mars, Incorporated and Its Suppliers. Interfaces 33(1): 23-25.
8. Hoos, H., and Boutilier, C. 2000. Solving Combinatorial Auctions Using Stochastic Local Search. In Proceedings of the Seventeenth National Conference on Artificial Intelligence. Menlo Park, CA: AAAI Press.
9. Hoos, H., and Boutilier, C. 2001. Bidding Languages for Combinatorial Auctions. In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence. San Francisco: Morgan Kaufmann Publishers.
10. Kelly, F., and Steinberg, R. 2000. A Combinatorial Auction with Multiple Winners for Universal Services. Management Science 46(4): 586-596.
11. Kothari, A.; Parkes, D.; and Suri, S. 2003. Approximately Strategyproof and Tractable Multi-Unit Auctions. In Proceedings, Fourth ACM Conference on Electronic Commerce, 166-175. New York: Association for Computing Machinery.
12. Kwasnica, A.; Ledyard, J.; Porter, D.; and DeMartini, C. 2005. A New and Improved Design for Multiobject Iterative Auctions. Management Science 51(3): 419-434.
13. Ledyard, J.; Porter, D.; and Rangel, A. 1997. Experiments Testing Multiobject Allocation Mechanisms. Journal of Economics and Management Strategy 6(3): 639-675.
14. Leyton-Brown, K.; Nudelman, E.; and Shoham Y. 2006. Empirical Hardness Models for Combinatorial Auctions. Chapter 19 of Combinatorial Auctions, ed. P. Cramton, Y. Shoham, and R. Steinberg. Cambridge, MA: The MIT Press.
15. McAfee, P., and McMillan, J. 1996. Analyzing the Airwaves Auction. Journal of Economic Perspectives 10(1): 159-175.
16. McMillan, J. 1994. Selling Spectrum Rights. Journal of Economic Perspectives 8(3): 145-162.
17. Metty, T.; Harlan, R.; Samelson, Q.; Moore, T.; Morris, T.; Sorensen, R.; Schneur, A.; Raskina, O.; Schneur, R.; Kanner, J.; Potts, K.; and Robbins, J. 2005. Reinventing the Supplier Negotiation Process at Motorola. Interfaces 35(1): 7-23.
18. Müller, R.; Lehmann, D.; and Sandholm, T. 2006. The Winner Determination Problem. Chapter 12 of Combinatorial Auctions, ed. P. Cramton, Y. Shoham, and R. Steinberg. Cambridge, MA: The MIT Press.
19. Nisan, N. 2000. Bidding and Allocation in Combinatorial Auctions. In Proceedings, First ACM Conference on Electronic Commerce, 1-12. New York: Association for Computing Machinery.
20. Rassenti, S.; Smith, V.; and Bulfin, R. 1982. A Combinatorial Auction Mechanism for Airport Time Slot Allocation. Bell Journal of Economics 13(2): 402-417.
21. Rothkopf, M.; Pekec, A.; and Harstad, R. 1998. Computationally Manageable Combinatorial Auctions. Management Science 44(8): 131-1147.
22. Sandholm, T. 1991. A Strategy for Decreasing the Total Transportation Costs Among Area-Distributed Transportation Centers. In Nordic Operations Analysis in Cooperation (NOAS-91): OR in Business. Turku, Finland: Turku School of Economics.
23. Sandholm, T. 1993. An Implementation of the Contract Net Protocol Based on Marginal Cost Calculations. In Proceedings of the Eleventh National Conference on Artificial Intelligence. Menlo Park, CA: AAAI Press.
24. Sandholm, T. 2000. Issues in Computational Vickrey Auctions. International Journal of Electronic Commerce 4(3): 107-129.
25. Sandholm, T. 2002a. Algorithm for Optimal Winner Determination in Combinatorial Auctions. Artificial Intelligence 135(1-2): 1-54.
26. Sandholm, T. 2002b. eMediator: A Next Generation Electronic Commerce Server. Computational Intelligence 18(4): 656-676.
27. Sandholm, T. 2006. Optimal Winner Determination Algorithms. Chapter 14 of Combinatorial Auctions, ed. P. Cramton, Y. Shoham, and R. Steinberg. Cambridge, MA: The MIT Press.
28. Sandholm, T.; Levine, D.; Concordia, M.; Martyn, P.; Hughes, R.; Jacobs, J.; and Begg, D. 2006. Changing the Game in Strategic Sourcing at Procter & Gamble: Expressive Competition Enabled by Optimization. Interfaces 36(1), 55-68.
29. Sandholm, T., and Suri, S. 2001. Market Clearability. in Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence. San Francisco: Morgan Kaufmann Publishers.
30. Sandholm, T., and Suri, S. 2006. Side Constraints and Nonprice Attributes in Markets. Games and Economic Behavior 55(2): 321-330.
31. Sandholm, T., and Suri, S. 2002. Optimal Clearing of Supply/Demand Curves. In Proceedings of the Thirteenth Annual International Symposium on Algorithms and Computation (ISAAC), Lecture Notes in Computer Science, Vol. 2518. Berlin: Springer.
32. Sandholm, T., and Suri, S. 2003. BOB: Improved Winner Determination in Combinatorial Auctions and Generalizations. Artificial Intelligence 145(1-2): 33-58.
33. Sandholm, T.; Suri, S.; Gilpin, A.; and Levine, D. 2002. Winner Determination in Combinatorial Auction Generalizations. In Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS). New York: Association for Computing Machinery.
34. Sandholm, T.; Suri, S.; Gilpin, A.; and Levine, D. 2005. CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions. Management Science 51(3): 374-390.
35. Smock, D. 2004. How P&G Buys Plastics. Modern Plastics (December 1).