Changing the Game in Strategic Sourcing at Procter & Gamble: Expressive Competition Enabled by Optimization

References

• Boutilier Craig. Solving concisely expressed combinatorial auction problems. Proc. National Conf. on Artificial Intelligence (AAAI) (2002) (Edmonton, Alberta, Canada) 359–366Google Scholar
• Boutilier Craig, Sandholm Tuomas, Shields Robert. Eliciting bid taker non-price preferences in (combinatorial) auctions. Proc. National Conf. on Artificial Intelligence (AAAI) (2004) San Jose, CA:204–211Google Scholar
• Camm Jeffrey D., Chorman Thomas E., Dill Franz A., Evans James R., Sweeney Dennis J., Wegryn Glenn W. Blending OR/MS, judgment, and GIS: Restructuring P&G’s supply chain. Interfaces (1997) 27(1):128–142Link, Google Scholar
• Caplice Chris, Sheffi Yossi. Optimization-based procurement for transportation services. J. Bus. Logist. (2003) 24(2):109–128Crossref, Google Scholar
• Conitzer Vincent, Derryberry Jonathan, Sandholm Tuomas. Combinatorial auctions with structured item graphs. Proc. National Conf. on Artificial Intelligence (AAAI) (2004) San Jose, CA:212–218Google Scholar
• de Vries Sven, Vohra Rakesh. Combinatorial auctions: A survey. INFORMS J. Comput. (2003) 15(3):284–309Link, Google Scholar
• Fujishima Yuzo, Leyton-Brown Kevin, Shoham Yoav. Taming the computational complexity of combinatorial auctions: Optimal and approximate approaches. Proc. Internat. Joint Conf. on Artificial Intelligence (IJCAI) (1999) Stockholm, Sweden:548–553Google Scholar
• Gilpin Andrew, Sandholm Tuomas. Information-theoretic approaches to branching in search. Proc. Internat. Conf. on Autonomous Agents and Multiagent Systems (AAMAS) (2006) Hakodate, JapanFull-length version: Technical report CMU-CS-06-102, Computer Science Department, Carnegie Mellon University, Pittsburgh, PACrossref, Google Scholar
• Hohner Gail, Rich John, Ng Ed, Reid Grant, Davenport Andrew, Kalagnanam Jayant, Lee Ho Soo, An Chae. Combinatorial and quantity-discount procurement auctions benefit Mars, Incorporated and its suppliers. Interfaces (2003) 33(1):23–35Link, Google Scholar
• Hoos Holger, Boutilier Craig. Solving combinatorial auctions using stochastic local search. Proc. National Conf. on Artificial Intelligence (AAAI) (2000) Austin, TX:22–29Google Scholar
• Hoos Holger, Boutilier Craig. Bidding languages for combinatorial auctions. Proc. Internat. Joint Conf. on Artificial Intelligence (IJCAI) (2001) Seattle, WA:1211–1217Google Scholar
• Kelly Frank, Steinberg Richard. A combinatorial auction with multiple winners for universal services. Management Sci. (2000) 46(4):586–596Link, Google Scholar
• Kwasnica Anthony, Ledyard John, Porter David, DeMartini Christine. A new and improved design for multiobject iterative auctions. Management Sci. (2005) 51(3):419–434Link, Google Scholar
• Ledyard John, Porter David, Rangel Antonio. Experiments testing multiobject allocation mechanisms. J. Econom. Management Strategy (1997) 6(3):639–675Crossref, Google Scholar
• McAfee Preston, McMillan John. Analyzing the airwaves auction. J. Econom. Perspectives (1996) 10(1):159–175Crossref, Google Scholar
• McMillan John. Selling spectrum rights. J. Econom. Perspectives (1994) 8(3):145–162Crossref, Google Scholar
• Metty Theresa, Harlan Rob, Samelson Quentin, Moore Tom, Morris Thomas, Sorensen Ron, Schneur Avner, Raskina Olga, Schneur Rina, Kanner Joshua, Potts Kevin, Robbins Jeffrey. Reinventing the supplier negotiation process at Motorola. Interfaces (2005) 35(1):7–23Link, Google Scholar
• Müller Rudolf, Lehmann Daniel, Sandholm Tuomas, Cramton Peter, Shoham Yoav, Steinberg Richard. The winner determination problem. Combinatorial Auctions (2006) (MIT Press, Cambridge, MA) Google Scholar
• Nisan Noam. Bidding and allocation in combinatorial auctions. Proc. ACM Conf. on Electronic Commerce (ACM-EC) (2000) Minneapolis, MN:1–12Crossref, Google Scholar
• Rassenti Stephen, Smith Vernon, Bulfin Robert. A combinatorial auction mechanism for airport time slot allocation. Bell J. Econom. (1982) 13(2):402–417Crossref, Google Scholar
• Rothkopf Michael, Pekec Aleksandar, Harstad Ronald. Computationally manageable combinatorial auctions. Management Sci. (1998) 44(8):131–147Link, Google Scholar
• Sandholm Tuomas. A strategy for decreasing the total transportation costs among area-distributed transportation centers. Nordic Operations Analysis in Cooperation (NOAS): OR in Business (1991) (Turku School of Economics, Turku, Finland) Google Scholar
• Sandholm Tuomas. An implementation of the contract net protocol based on marginal cost calculations. Proc. National Conf. on Artificial Intelligence (AAAI) (1993) Washington, DC:256–262Google Scholar
• Sandholm Tuomas. Issues in computational Vickrey auctions. Internat. J. Electronic Commerce (2000) 4(3):107–129Crossref, Google Scholar
• Sandholm Tuomas. Algorithm for optimal winner determination in combinatorial auctions. Artificial Intelligence (2002a) 135(January):1–54Crossref, Google Scholar
• Sandholm Tuomas. eMediator: A next generation electronic commerce server. Computational Intelligence (2002b) 18(4):656–676Crossref, Google Scholar
• Sandholm Tuomas, Cramton Peter, Shoham Yoav, Steinberg Richard. Optimal winner determination algorithms. Combinatorial Auctions (2006) (MIT Press, Cambridge, MA) Google Scholar
• Sandholm Tuomas, Suri Subhash. Market clearability. Proc. Internat. Joint Conf. on Artificial Intelligence (IJCAI) (2001a) Seattle, WA:1145–1151Google Scholar
• Sandholm Tuomas, Suri Subhash. Side constraints and nonprice attributes in markets. Proc. IJCAI Workshop on Distributed Constraint Reasoning (2001b) Seattle, WA:55–61Games and Economic Behavior. ForthcomingGoogle Scholar
• Sandholm Tuomas, Suri Subhash. Optimal clearing of supply/demand curves. Proc. Annual Internat. Sympos. on Algorithms and Comput. (ISAAC) (2002) Vancouver, British Columbia, CanadaCrossref, Google Scholar
• Sandholm Tuomas, Suri Subhash. BOB: Improved winner determination in combinatorial auctions and generalizations. Artificial Intelligence (2003) 145:3–58Crossref, Google Scholar
• Sandholm Tuomas, Suri Subhash, Gilpin Andrew, Levine David. Winner determination in combinatorial auction generalizations. Proc. Internat. Conf. on Autonomous Agents and Multi-Agent Systems (AAMAS) (2002) Bologna, Italy:69–76Crossref, Google Scholar
• Sandholm Tuomas, Suri Subhash, Gilpin Andrew, Levine David. CABOB: A fast optimal algorithm for winner determination in combinatorial auctions. Management Sci. (2005) 51(3):374–390Link, Google Scholar
• Smock Doug. How P&G buys plastics. Modern Plastics (2004) DecemberGoogle Scholar