Show simple item record

Conservative-Bayesian Mechanism Design

dc.date.accessioned2010-12-30T09:15:11Z
dc.date.accessioned2018-11-26T22:26:29Z
dc.date.available2010-12-30T09:15:11Z
dc.date.available2018-11-26T22:26:29Z
dc.date.issued2010-12-20
dc.identifier.urihttp://hdl.handle.net/1721.1/60370
dc.identifier.urihttp://repository.aust.edu.ng/xmlui/handle/1721.1/60370
dc.description.abstractClassical Bayesian mechanism design is "centralized," that is, the designer is assumed to know the distribution D from which the players' type profile has been drawn. We instead investigate a very "decentralized" Bayesian model, where the designer has no knowledge at all, and each player only has some probabilistic information about D. For this decentralized model and many contexts of interest, where the goal is to maximize revenue, we show that, for arbitrary type distributions D (in particular, correlated ones), it is possible to design mechanisms matching to a significant extent the performance of the optimal centralized mechanisms. Our results are "existential" for a broad class of contexts (including combinatorial auctions) and "constructive" for auctions of a single good.en_US
dc.format.extent18 p.en_US
dc.titleConservative-Bayesian Mechanism Designen_US


Files in this item

FilesSizeFormatView
MIT-CSAIL-TR-2010-059.pdf324.0Kbapplication/pdfView/Open

This item appears in the following Collection(s)

Show simple item record