Robust Market Design with Opaque Announcements
Author
Abstract
Suggested Citation
Download full text from publisher
More about this item
Keywords
Allocation Problems; Robust Market Design; Opaque Announcements; Strategy-Proofness; Transparency We introduce a framework where the announcements of a clearinghouse about the allocation process are opaque in the sense that there can be more than one outcome compatible with a realization of type reports. We ask whether desirable properties can be ensured under opacity in a robust sense. A property can be guaranteed under an opaque announcement if every mechanism compatible with it satisfies the property. We find an impossibility result: strategy-proofness cannot be guaranteed under any level of opacity. In contrast; in some environments; weak Maskin monotonicity and non-bossiness can be guaranteed under opacity.;All these keywords.
JEL classification:
- C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory
- D47 - Microeconomics - - Market Structure, Pricing, and Design - - - Market Design
- D82 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Asymmetric and Private Information; Mechanism Design
NEP fields
This paper has been announced in the following NEP Reports:- NEP-DES-2025-03-17 (Economic Design)
- NEP-MIC-2025-03-17 (Microeconomics)
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:bon:boncrc:crctr224_2025_653. See general information about how to correct material in RePEc.
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.
We have no bibliographic references for this item. You can help adding them by using 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: CRC Office (email available below). General contact details of provider: https://www.crctr224.de .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.