A budget-constrained buyer wants to purchase items from a shortlisted set. Items are differentiated by quality and sellers have private reserve prices for their items. Sellers quote prices strategically, inducing a knapsack game. The buyer's problem is to select a subset of maximal quality. We...

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,...

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.

A budget-constrained buyer wants to purchase items from a shortlisted set. Items are differentiated by quality and sellers have private reserve prices for their items. Sellers quote prices strategically, inducing a knapsack game. The buyer's problem is to select a subset of maximal quality. We...

A budget-constrained buyer wants to purchase items from a shortlisted set. Items are differentiated by quality and sellers have private reserve prices for their items. Sellers quote prices strategically, inducing a knapsack game. The buyer's problem is to select a subset of maximal quality. We...

A budget-constrained buyer wants to purchase items from a shortlisted set. Items are differentiated by quality and sellers have private reserve prices for their items. Sellers quote prices strategically, inducing a knapsack game. The buyer's problem is to select a subset of maximal quality. We...

We analyse procurement auctions in which sellers are distinguished on the basis of the ratios of quality per unit of money that they offer. Sellers are privately informed on the offered quality of the technology or good. We assume that the procurer cannot perfectly identify the best offer. Thus,...