BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Rational Proofs - Micali\, S (MIT)
DTSTART:20120410T133000Z
DTEND:20120410T143000Z
UID:TALK37385@talks.cam.ac.uk
CONTACT:Mustapha Amrani
DESCRIPTION:We unify the treatment of asymmetry of information in theoreti
 cal computer science and economics.\nWe put forward a new type of proof sy
 stem\, where an unbounded Prover and a polynomial time Verifier interact\,
  on inputs a string x and a function f\, so that the Verifier may learn f(
 x). In our setting there no longer are “good” or “malicious” Prove
 rs\, but only RATIONAL ones. In essence\, (1) the Verifier gives the Prove
 r a reward in [0\,1] determined by the transcript of their interaction\; (
 2) the Prover wishes to maximize his expected reward\; and (3) the reward 
 is maximized only if the verifier correctly learns f(x).\nRational proofs 
 are as powerful as interactive ones\, but can be amazingly more efficient 
 in the amount of communication involved: that is\, the number of bits exch
 anged and the number of rounds of interaction.\nJoint work with Pablo Azar
 .\n
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR