Optimal Descending Mechanisms for Constrained Procurement

Descending mechanisms for procurement (or, ascending mechanisms for selling) have been well‐recognized for their simplicity from the viewpoint of bidders—they require less bidder sophistication as compared to sealed‐bid mechanisms. In this study, we consider procurement under each of two types of constraints: (1) Individual/Group Capacities : limitations on the amounts that can be sourced from individual and/or subsets of suppliers, and (2) Business Rules : lower and upper bounds on the number of suppliers to source from, and on the amount that can be sourced from any single supplier. We analyze two procurement problems, one that incorporates individual/group capacities and another that incorporates business rules. In each problem, we consider a buyer who wants to procure a fixed quantity of a product from a set of suppliers, where each supplier is endowed with a privately known constant marginal cost. The buyer's objective is to minimize her total expected procurement cost. For both problems, we present descending auction mechanisms that are optimal mechanisms. We then show that these two problems belong to a larger class of mechanism design problems with constraints specified by polymatroids, for which we prove that optimal mechanisms can be implemented as descending mechanisms.

• 저널Production and Operations Management · 24(12) · 1955–1965
• 토픽Auction Theory and Applications · Management Science and Operations Research
• DOI10.1111/poms.12385
• 저자Shivam Gupta, Wěi Chén, Milind Dawande, Ganesh Janakiraman