CS 789 THEORY SEMINAR [home]

Speaker: Rann Smorodinsky
Affiliation: Technion - Israel Institute of Technology
Date: Monday, December 1, 2003
Title: http:  Overcoming Free Riding in Multi-Party Computations - The Anonymous Case

Abstract:

This paper addresses the question of multi party computation in a model where agents' own secrets are costly to retrieve. A mechanism is designed to elicit agents' secrets and perform the computation. However, such a mechanism must overcome the agents' incentive to free-ride. We show that approaching agents sequentially may be the optimal mechanism. Furthermore, we show that it is sufficient to provide each agent in the sequence with binary information, namely whether the function could be computed from previous replies, or not.

Joint work with and Moshe Tennenholtz.