MIT Libraries homeMIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • Computer Science and Artificial Intelligence Lab (CSAIL)
  • CSAIL Digital Archive
  • CSAIL Technical Reports (July 1, 2003 - present)
  • View Item
  • DSpace@MIT Home
  • Computer Science and Artificial Intelligence Lab (CSAIL)
  • CSAIL Digital Archive
  • CSAIL Technical Reports (July 1, 2003 - present)
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Conservative-Bayesian Mechanisms

Author(s)
Azar, Pablo; Chen, Jing; Micali, Silvio
Thumbnail
DownloadMIT-CSAIL-TR-2010-042.pdf (182.4Kb)
Other Contributors
Theory of Computation
Advisor
Silvio Micali
Metadata
Show full item record
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.
Date issued
2010-09-08
URI
http://hdl.handle.net/1721.1/58486
Citation
Series/Report no.
MIT-CSAIL-TR-2010-042

Collections
  • CSAIL Technical Reports (July 1, 2003 - present)

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries homeMIT Libraries logo

Find us on

Twitter Facebook Instagram YouTube RSS

MIT Libraries navigation

SearchHours & locationsBorrow & requestResearch supportAbout us
PrivacyPermissionsAccessibility
MIT
Massachusetts Institute of Technology
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.