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:||Feb 2009|
|Date of revision:|
|Contact details of provider:|| Postal: |
Web page: http://www.sfbtr15.de/
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Giebe, Thomas & Grebe, Tim & Wolfstetter, Elmar, 2006.
"How to allocate R&D (and other) subsidies: An experimentally tested policy recommendation,"
Elsevier, vol. 35(9), pages 1261-1272, November.
- Giebe, Thomas & Grebe, Tim & Wolfstetter, Elmar G., 2005. "How to Allocate R&D (and Other) Subsidies: An Experimentally Tested Policy Recommendation," Discussion Paper Series of SFB/TR 15 Governance and the Efficiency of Economic Systems 108, Free University of Berlin, Humboldt University of Berlin, University of Bonn, University of Mannheim, University of Munich.
When requesting a correction, please mention this item's handle: RePEc:trf:wpaper:254. 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: (Tamilla Benkelberg)
If references are entirely missing, you can add them using this form.