Mechanism Design via Consensus Estimates, Cross Checking, and Profit Extraction
AbstractThere is only one technique for prior-free optimal mechanism design that generalizes beyond the structurally benevolent setting of digital goods. This technique uses random sampling to estimate the distribution of agent values and then employs the Bayesian optimal mechanism for this estimated distribution on the remaining players. Though quite general, even for digital goods, this random sampling auction has a complicated analysis and is known to be suboptimal. To overcome these issues we generalize the consensus technique from Goldberg and Hartline (2003) to structurally rich environments that include, e.g., single-minded combinatorial auctions.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. 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.
Bibliographic InfoPaper provided by Northwestern University, Center for Mathematical Studies in Economics and Management Science in its series Discussion Papers with number 1538.
Date of creation: 24 Aug 2011
Date of revision:
Contact details of provider:
Postal: Center for Mathematical Studies in Economics and Management Science, Northwestern University, 580 Jacobs Center, 2001 Sheridan Road, Evanston, IL 60208-2014
Web page: http://www.kellogg.northwestern.edu/research/math/
More information through EDIRC
This paper has been announced in the following NEP Reports:
- NEP-ALL-2011-09-05 (All new papers)
- NEP-CDM-2011-09-05 (Collective Decision-Making)
- NEP-GTH-2011-09-05 (Game Theory)
You can help add them by filling out this form.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Fran Walker).
If references are entirely missing, you can add them using this form.