Market Research and Market Design
We study trading models when the distribution of signals such as costs or values is not known to traders or the mechanism designer when the profit-maximizing trading procedure is designed. We present adaptive mechanisms that simultaneously elicit this information (market research) while maintaining incentive compatibility and maximizing profits when the set of traders is large (market design). First, we study a monopoly pricing model where neither the seller nor the buyers know the distribution of values. Second, we study a model with a broker intermediating trade between a large number of buyers and sellers with private information about their valuations and costs. We show that when the set of traders becomes large our adaptive mechanisms achieve the same expected profits for the monopolist and the broker as when the distribution of signals is common knowledge.
If 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.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 3 (2003)
Issue (Month): 1 (August)
|Contact details of provider:|| Web page: http://www.degruyter.com|
|Order Information:||Web: http://www.degruyter.com/view/j/bejte|
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.:
- Dirk Bergemann & Stephen Morris, 2005.
"Robust Mechanism Design,"
NajEcon Working Paper Reviews
- Stephen Morris & Dirk Bergemann, 2004. "Robust Mechanism Design," Yale School of Management Working Papers ysm380, Yale School of Management.
- Dirk Bergemann & Stephen Morris, 2003. "Robust Mechanism Design," Cowles Foundation Discussion Papers 1421, Cowles Foundation for Research in Economics, Yale University.
- Dirk Bergemann & Stephen Morris, 2003. "Robust Mechanism Design," Cowles Foundation Discussion Papers 1421R, Cowles Foundation for Research in Economics, Yale University, revised Apr 2004.
- Dirk Bergemann & Stephen Morris, 2003. "Robust Mechanism Design," Levine's Bibliography 666156000000000035, UCLA Department of Economics.
- Gresik, Thomas A. & Satterthwaite, Mark A., 1989. "The rate at which a simple market converges to efficiency as the number of traders increases: An asymptotic result for optimal trading mechanisms," Journal of Economic Theory, Elsevier, vol. 48(1), pages 304-332, June.
- Wilson, Robert B, 1985. "Incentive Efficiency of Double Auctions," Econometrica, Econometric Society, vol. 53(5), pages 1101-15, September.
When requesting a correction, please mention this item's handle: RePEc:bpj:bejtec:v:advances.3:y:2003:i:1:n:5. 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: (Peter Golla)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.