A dynamic auction for multi-object procurement under a hard budget constraint

We present a new dynamic auction for procurement problems where payments are bounded by a hard budget constraint and money does not enter the procurer's objective function

Innovation Contests with Entry Auction

We consider procurement of an innovation from heterogeneous sellers. Innovations are random but depend on unobservable effort and private information. We compare two procurement mechanisms where potential sellers first bid in an auction for admission to an innovation contest. After the contest, an innovation is procured employing either a fixed prize or a first-price auction. We characterize Bayesian Nash equilibria such that both mechanisms are payoff-equivalent and induce the same efforts and innovations. In these equilibria, signaling in the entry auction does not occur since contestants play a simple strategy that does not depend on rivals' private information

How to allocate Research (and other) Subsidies

A budget-constrained buyer wants to purchase items from a short-listed set. Items are differentiated by observable quality and sellers have private reserve prices for their items. The buyer’s problem is to select a subset of maximal quality. Money does not enter the buyer’s objective function, but only his constraints. Sellers quote prices strategically, inducing a knapsack game. We derive the Bayesian optimal mechanism for the buyer’s problem. We ?nd that simultaneous take-it-or-leave-it offers are optimal. Hence, somewhat surprisingly, ex-postcompetition is not required to implement optimality. Finally, we discuss the problem in a detail free setting

How to allocate Research (and other) Subsidies

A budget-constrained buyer wants to purchase items from a short-listed set. Items are differentiated by observable quality and sellers have private reserve prices for their items. The buyer’s problem is to select a subset of maximal quality. Money does not enter the buyer’s objective function, but only his constraints. Sellers quote prices strategically, inducing a knapsack game. We derive the Bayesian optimal mechanism for the buyer’s problem. We ?nd that simultaneous take-it-or-leave-it offers are optimal. Hence, somewhat surprisingly, ex-postcompetition is not required to implement optimality. Finally, we discuss the problem in a detail free setting.Mechanism Design; Subsidies; Budget; Procurement; Knapsack Problem