This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

Subsidies, Knapsack Auctions and Dantzig's Greedy Heuristic

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Ludwig Ensthaler
Thomas Giebe

Additional information is available for the following registered author(s):

Abstract

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.

Download Info
To download:

If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

File URL: http://www.diw.de/documents/publikationen/73/diw_01.c.97540.de/dp880.pdf
File Format: application/pdf
File Function:
Download Restriction: no

Publisher Info
Paper provided by DIW Berlin, German Institute for Economic Research in its series Discussion Papers of DIW Berlin with number 880.

Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Length: 8 p.
Date of creation: 2009
Date of revision:
Handle: RePEc:diw:diwwpp:dp880

Contact details of provider:
Postal: Mohrenstra�e 58, D-10117 Berlin
Phone: xx49-30-89789-0
Fax: xx49-30-89789-200
Email:
Web page: http://www.diw.de/en
More information through EDIRC

For technical questions regarding this item, or to correct its listing, contact: (Bibliothek).

Related research
Keywords: Auctions; Subsidies; Market Design; Knapsack Problem;

Other versions of this item:

Find related papers by JEL classification:
D21 - Microeconomics - - Production and Organizations - - - Firm Behavior
D43 - Microeconomics - - Market Structure and Pricing - - - Oligopoly and Other Forms of Market Imperfection
D44 - Microeconomics - - Market Structure and Pricing - - - Auctions
D45 - Microeconomics - - Market Structure and Pricing - - - Rationing; Licensing

This paper has been announced in the following NEP Reports:

References listed on IDEAS
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.:
  1. Thomas Giebe & Tim Grebe & Elmar Wolfstetter, 2005. "How to Allocate R&D (and Other) Subsidies: An Experimentally Tested Policy Recommendation," Discussion Papers 108, SFB/TR 15 Governance and the Efficiency of Economic Systems, Free University of Berlin, Humboldt University of Berlin, University of Bonn, University of Mannheim, University of Munich. [Downloadable!]
    Other versions:
  2. Siegel, Donald S, et al, 2003. " Policies Promoting Innovation in Small Firms: Evidence from the U.S. and U.K," Small Business Economics, Springer, vol. 20(2), pages 121-27, March. [Downloadable!] (restricted)
Full references

Statistics
Access and download statistics

Did you know? Over five million full texts a year are downloaded through IDEAS.

This page was last updated on 2009-11-26.


This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.