Subsidies, Knapsack Auctions and Dantzig's Greedy Heuristic
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 propose a buying mechanism which can be viewed as a game theoretic extension of Dantzig's greedy heuristic for the classic knapsack problem. We use Monte Carlo simulations to analyse the performance of our mechanism. Finally, we discuss how the mechanism can be applied to award R&D subsidies.
|Date of creation:||2009|
|Contact details of provider:|| Postal: Mohrenstraße 58, D-10117 Berlin|
Web page: http://www.diw.de/en
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:diw:diwwpp:dp880. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Bibliothek)
If references are entirely missing, you can add them using this form.