Information design in optimal auctions (Q6072258)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Information design in optimal auctions |
scientific article; zbMATH DE number 7749721
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Information design in optimal auctions |
scientific article; zbMATH DE number 7749721 |
Statements
Information design in optimal auctions (English)
0 references
12 October 2023
0 references
In this article, the authors characterize the symmetric buyer-optimal information structure as well as the symmetric seller-worst information structure with symmetric binary priors and a Myersonian optimal auction. More precisely, the authors translate both information design problems into finite-dimensional, constrained optimization problems in which one can explicitly solve for the optimal information structure. It is show that with two or more buyers, the symmetric buyer-optimal information structure is different from the symmetric seller-worst information structure. Section 5 studies the information design problem with asymmetric signal distributions. Section 6 discusses issues with asymmetric or continuous priors and studies the ``maxmin'' mechanisms. Appendix A contains all proofs of the propositions.
0 references
information design
0 references
optimal auction
0 references
virtual value distribution
0 references
buyer-optimal information
0 references
seller-worst information
0 references
0.94483984
0 references
0.9261787
0 references
0.9187395
0 references
0.9089109
0 references
0.90202755
0 references
0.89837515
0 references
0.8967901
0 references
0.8942872
0 references
0.8927708
0 references