Show simple item record

dc.contributor.authorDaskalakis, Konstantinos
dc.contributor.authorPapadimitriou, Christos H
dc.contributor.authorTzamos, Christos
dc.date.accessioned2017-07-25T17:21:00Z
dc.date.available2017-07-25T17:21:00Z
dc.date.issued2016-07
dc.identifier.isbn9781450339360
dc.identifier.urihttp://hdl.handle.net/1721.1/110837
dc.description.abstractWe study the problem of optimal auction design in a valuation model, explicitly motivated by online ad auctions, in which there is two-way informational asymmetry, in the sense that private information is available to both the seller (the item type) and the bidders (their type), and the value of each bidder for the item depends both on his own and the item's type. Importantly, we allow arbitrary auction formats involving, potentially, several rounds of signaling from the seller and decisions by the bidders, and seek to find the optimum co-design of signaling and auction (we call this optimum the "optimum augmented auction"). We characterize exactly the optimum augmented auction for our valuation model by establishing its equivalence with a multi-item Bayesian auction with additive bidders. Surprisingly, in the optimum augmented auction there is no signaling whatsoever, and in fact the seller need not access the available information about the item type until after the bidder chooses his bid. Suboptimal solutions to this problem, which have appeared in the recent literature, are shown to correspond to well-studied ways to approximate multi-item auctions by simpler formats, such as grand-bundling (this corresponds to Myerson's auction without any information revelation), selling items separately (this corresponds to Myerson's auction preceded by full information revelation as in [Fu et al. 2012]), and fractional partitioning (this corresponds to Myerson's auction preceded by optimal signaling). Consequently, all these solutions are separated by large approximation gaps from the optimum revenue.en_US
dc.description.sponsorshipUnited States. Office of Naval Research (grant N0 0014-12-1-0999)en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (Award CCF-0953960 (CAREER))en_US
dc.description.sponsorshipNational Science Foundation (U.S.). Division of Computing and Communication Foundations (CCF-1551875)en_US
dc.description.sponsorshipNational Science Foundation (U.S.). Division of Computing and Communication Foundations (CCF-1408635)en_US
dc.description.sponsorshipSimons Award for Graduate Students in Theoretical Computer Scienceen_US
dc.language.isoen_US
dc.publisherAssociation for Computing Machineryen_US
dc.relation.isversionofhttp://dx.doi.org/10.1145/2940716.2940789en_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alikeen_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/4.0/en_US
dc.sourceMIT Web Domainen_US
dc.titleDoes Information Revelation Improve Revenue?en_US
dc.typeArticleen_US
dc.identifier.citationDaskalakis, Constantinos, Christos Papadimitriou, and Christos Tzamos. “Does Information Revelation Improve Revenue?” Proceedings of the 2016 ACM Conference on Economics and Computation - EC ’16 (2016).en_US
dc.contributor.departmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratoryen_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Scienceen_US
dc.contributor.mitauthorDaskalakis, Konstantinos
dc.contributor.mitauthorPapadimitriou, Christos H
dc.contributor.mitauthorTzamos, Christos
dc.relation.journalProceedings of the 2016 ACM Conference on Economics and Computation - EC '16en_US
dc.eprint.versionAuthor's final manuscripten_US
dc.type.urihttp://purl.org/eprint/type/ConferencePaperen_US
eprint.statushttp://purl.org/eprint/status/NonPeerRevieweden_US
dspace.orderedauthorsDaskalakis, Constantinos; Papadimitriou, Christos; Tzamos, Christosen_US
dspace.embargo.termsNen_US
dc.identifier.orcidhttps://orcid.org/0000-0002-5451-0490
dc.identifier.orcidhttps://orcid.org/0000-0002-7560-5069
mit.licenseOPEN_ACCESS_POLICYen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record