The communication cost of selfishness |
| |
Authors: | Ronald Fadel Ilya Segal |
| |
Affiliation: | aABC Group, Lebanon;bDepartment of Economics, Stanford University, Stanford, CA 94305, United States |
| |
Abstract: | We consider how many bits need to be exchanged to implement a given decision rule when the mechanism must be ex post or Bayesian incentive compatible. For ex post incentive compatibility, the communication protocol must reveal enough information to calculate monetary transfers to the agents to motivate them to be truthful (agents' payoffs are assumed to be quasilinear in such transfers). For Bayesian incentive compatibility, the protocol may need to hide some information from the agents to prevent deviations contingent on the information. In both settings with selfish agents, the communication cost can be higher than in the case in which the agents are honest and can be relied upon to report truthfully. The increase is the “communication cost of selfishness.” We provide an exponential upper bound on the increase. We show that the bound is tight in the Bayesian setting, but we do not know this in the ex post setting. We describe some cases where the communication cost of selfishness proves to be very low. |
| |
Keywords: | Communication complexity Algorithmic mechanism design Bayesian incentive compatibility Ex post incentive compatibility Sequential and simultaneous communication protocols Information sets |
本文献已被 ScienceDirect 等数据库收录! |
|