Conservative-Bayesian Mechanisms
dc.contributor.advisor | Silvio Micali | |
dc.contributor.author | Azar, Pablo | en_US |
dc.contributor.author | Chen, Jing | en_US |
dc.contributor.author | Micali, Silvio | en_US |
dc.contributor.other | Theory of Computation | en |
dc.date.accessioned | 2010-09-11T00:00:46Z | |
dc.date.available | 2010-09-11T00:00:46Z | |
dc.date.issued | 2010-09-08 | |
dc.identifier.uri | http://hdl.handle.net/1721.1/58486 | |
dc.description.abstract | We put forward a new class of mechanisms. In this extended abstract, we exemplify our approach only for single-good auctions in what we call a conservative-Bayesian setting. (Essentially, no common-knowledge about the underlying distribution of the players' valuations is required.) We prove that our mechanism is optimal in this challenging and realistic setting. | en_US |
dc.format.extent | 5 p. | en_US |
dc.relation.ispartofseries | MIT-CSAIL-TR-2010-042 | |
dc.title | Conservative-Bayesian Mechanisms | en_US |
dc.identifier.citation | en_US |