Changing the Game in Strategic Sourcing at Procter & Gamble: Expressive Competition Enabled by Optimization
暂无分享,去创建一个
David Levine | Tuomas Sandholm | Jim Jacobs | Rick Hughes | Michael Concordia | Paul Martyn | Dennis Begg | T. Sandholm | David Levine | Michael Concordia | P. Martyn | Rick Hughes | Jim Jacobs | Dennis Begg
[1] Tuomas Sandholm. eMediator: A Next Generation Electronic Commerce Server , 2002, Comput. Intell..
[2] Subhash Suri,et al. Side constraints and non-price attributes in markets , 2006, Games Econ. Behav..
[3] Craig Boutilier,et al. Solving Combinatorial Auctions Using Stochastic Local Search , 2000, AAAI/IAAI.
[4] Ronald M. Harstad,et al. Computationally Manageable Combinational Auctions , 1998 .
[5] Tuomas Sandholm,et al. An Implementation of the Contract Net Protocol Based on Marginal Cost Calculations , 1993, AAAI.
[6] Anthony M. Kwasnica,et al. A New and Improved Design for Multiobject Iterative Auctions , 2005, Manag. Sci..
[7] Craig Boutilier,et al. Eliciting Bid Taker Non-price Preferences in (Combinatorial) Auctions , 2004, AAAI.
[8] Tuomas Sandholm,et al. Issues in Computational Vickrey Auctions , 2000, Int. J. Electron. Commer..
[9] J. Ledyard,et al. Experiments Testing Multiobject Allocation Mechanisms , 1997 .
[10] James R. Evans,et al. Blending OR/MS, Judgment, and GIS: Restructuring P&G's Supply Chain , 1997 .
[11] Craig Boutilier,et al. Solving concisely expressed combinatorial auction problems , 2002, AAAI/IAAI.
[12] Ben Delaney,et al. Interfaces , 2002, IEEE Multim..
[13] Sven de Vries,et al. Combinatorial Auctions: A Survey , 2003, INFORMS J. Comput..
[14] David Levine,et al. CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions , 2005, Manag. Sci..
[15] Thomas Morris,et al. Reinventing the Supplier Negotiation Process at Motorola , 2005, Interfaces.
[16] Tuomas Sandholm,et al. Optimal Winner Determination Algorithms , 2005 .
[17] Tuomas Sandholm,et al. Information-theoretic approaches to branching in search , 2006, AAMAS '06.
[18] Noam Nisan,et al. Bidding and allocation in combinatorial auctions , 2000, EC '00.
[19] F. Kelly,et al. A Combinatorial Auction with Multiple Winners for Universal Service , 2000 .
[20] D. Lehmann,et al. The Winner Determination Problem , 2003 .
[21] Ho Soo Lee,et al. Special Issue: 2002 Franz Edelman Award for Achievement in Operations Research and the Management Sciences: Combinatorial and Quantity-Discount Procurement Auctions Benefit Mars, Incorporated and Its Suppliers , 2003, Interfaces.
[22] Vincent Conitzer,et al. Combinatorial Auctions with Structured Item Graphs , 2004, AAAI.
[23] R. McAfee,et al. Analyzing the Airwaves Auction , 1996 .
[24] Subhash Suri,et al. Market Clearability , 2001, IJCAI.
[25] Subhash Suri,et al. BOB: Improved winner determination in combinatorial auctions and generalizations , 2003, Artif. Intell..
[26] Craig Boutilier,et al. Bidding Languages for Combinatorial Auctions , 2001, IJCAI.
[27] Subhash Suri,et al. Optimal Clearing of Supply/Demand Curves , 2002 .
[28] David Levine,et al. Winner determination in combinatorial auction generalizations , 2002, AAMAS '02.
[29] Doug Smock. How P&G buys plastics , 2004 .
[30] S. Rassenti,et al. A Combinatorial Auction Mechanism for Airport Time Slot Allocation , 1982 .
[31] Y. Sheffi,et al. OPTIMIZATION‐BASED PROCUREMENT FOR TRANSPORTATION SERVICES , 2003 .
[32] Yoav Shoham,et al. Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches , 1999, IJCAI.
[33] Tuomas Sandholm,et al. Algorithm for optimal winner determination in combinatorial auctions , 2002, Artif. Intell..