Ex-post optimal knapsack procurement

نویسندگان

  • Felix Jarman
  • Vincent Meisner
چکیده

We consider a budget-constrained mechanism designer who selects an optimal set of projects to maximize her utility. A project’s cost is private information and its value for the designer may vary. In this allocation problem, the selection of projects both which and how many is endogenously determined by the mechanism. The designer faces ex-post constraints: The participation and budget constraints must hold for each possible outcome while the mechanism must be implementable in dominant strategies. We derive the class of optimal mechanisms and show that it has a deferred acceptance auction representation. This feature guarantees an implementation with a descending clock auction. Only in the case of symmetric projects do price clocks descend synchronously such that the cheapest projects are executed. The case in which values or costs are asymmetrically distributed features a novel tradeoff between quantity and quality. Interestingly, this tradeoff mitigates the distortion due to the informational asymmetry compared to environments where quantity is exogenous. JEL-Classification: D02, D44, D45, D82, H57.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

www.econstor.eu Ex-post Optimal Knapsack Procurement∗

We consider a budget-constrained mechanism designer who selects an optimal set of projects to maximize her utility. A project’s cost is private information and its value for the designer may vary. In this allocation problem, the selection of projects both which and how many is endogenously determined by the mechanism. The designer faces ex-post constraints: The participation and budget constrai...

متن کامل

Truthful Multi-unit Procurements with Budgets

We study procurement games where each seller supplies multiple units of his item, with a cost per unit known only to him. The buyer can purchase any number of units from each seller, values different combinations of the items differently, and has a budget for his total payment. For a special class of procurement games, the bounded knapsack problem, we show that no universally truthful budget-fe...

متن کامل

Bayesian optimal knapsack procurement

A budget-constrained buyer wants to purchase items from a shortlisted 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 report the B...

متن کامل

Budget - Constrained

We study optimal procurement mechanisms for a financially constrained buyer subject to ex post incentive compatibility and individual rationality. In our setup, a buyer who has a fixed budget wishes to purchase a homogeneous product up to a maximum demand amount. We characterize the optimal mechanism when the budget constraint always binds and when the maximum demand constraint always binds. Wh...

متن کامل

Nonconvex piecewise linear knapsack problems

This paper considers the minimization version of a class of nonconvex knapsack problems with piecewise linear cost structure. The items to be included in the knapsack have a divisible quantity and a cost function. An item can be included partially in the given quantity range and the cost is a nonconvex piecewise linear function of quantity. Given a demand, the optimization problem is to choose ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Economic Theory

دوره 171  شماره 

صفحات  -

تاریخ انتشار 2017