BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:General Truthfulness Characterizations Via Convex Analysis - Ian K
 ash (MSR Cambridge)
DTSTART:20121126T150000Z
DTEND:20121126T160000Z
UID:TALK41629@talks.cam.ac.uk
CONTACT:Felix Fischer
DESCRIPTION:We present a model of truthful elicitation which generalizes a
 nd extends both mechanisms and scoring rules. Our main result is a charact
 erization theorem using the tools of convex analysis\, of which characteri
 zations of mechanisms and scoring rules represent special cases. Moreover\
 , we demonstrate that a variety of existing results in the mechanism desig
 n literature are often simpler and more direct when first phrased in terms
  of convexity. We then generalize our main theorem to settings where agent
 s report some alternate representation of their private information rather
  than reporting it directly\, which gives new results about both scoring r
 ules and mechanism design.
LOCATION:MR12\, Centre for Mathematical Sciences\, Wilberforce Road\, Camb
 ridge
END:VEVENT
END:VCALENDAR