General Truthfulness Characterizations Via Convex Analysis

Add to your list(s) Download to your calendar using vCal

• Ian Kash (MSR Cambridge)
• Monday 26 November 2012, 15:00-16:00
• MR12, Centre for Mathematical Sciences, Wilberforce Road, Cambridge.

If you have a question about this talk, please contact Felix Fischer.

We present a model of truthful elicitation which generalizes and extends both mechanisms and scoring rules. Our main result is a characterization theorem using the tools of convex analysis, of which characterizations of mechanisms and scoring rules represent special cases. Moreover, we demonstrate that a variety of existing results in the mechanism design literature are often simpler and more direct when first phrased in terms of convexity. We then generalize our main theorem to settings where agents report some alternate representation of their private information rather than reporting it directly, which gives new results about both scoring rules and mechanism design.

This talk is part of the Optimization and Incentives Seminar series.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• Cambridge talks
• DPMMS Lists
• DPMMS info aggregator
• DPMMS lists
• Economics and Computer Science Talks
• Hanchen DaDaDash
• Interested Talks
• MR12, Centre for Mathematical Sciences, Wilberforce Road, Cambridge
• Optimization and Incentives Seminar
• School of Physical Sciences
• Statistical Laboratory info aggregator
• Trust & Technology Initiative - interesting events
• bld31

Note that ex-directory lists are not shown.