Overcoming free riding in multi-party computations—The anonymous case |
| |
Authors: | Rann Smorodinsky Moshe Tennenholtz |
| |
Institution: | Davidson Faculty of Industrial Engineering and Management, Technion, Haifa 32000, Israel |
| |
Abstract: | This paper addresses the question of multi-party computation in a model with asymmetric information. Each agent has a private value (secret), but in contrast to standard models, the agent incurs a cost when retrieving the secret. There is a social choice function the agents would like to compute and implement. All agents would like to perform a joint computation, which input is their vector of secrets. However, agents would like to free-ride on others' contribution.A mechanism which elicits players' secrets and performs the desired computation defines a game. A mechanism is ‘appropriate’ if it (weakly) implements the social choice function for all secret vectors. namely, if there exists an equilibrium in which it is able to elicit (sufficiently many) agents' secrets and perform the computation, for all possible secret vectors. We show that ‘appropriate’ mechanisms approach agents sequentially and that they have low communication complexity. |
| |
Keywords: | Multi-party computations Sequential mechanisms Equilibrium Revelation principle Information acquisition |
本文献已被 ScienceDirect 等数据库收录! |
|