Mechanism design with partial verification and revelation principle
暂无分享,去创建一个
In the case of mechanism design with partial verification, where agents have restrictions on misreporting, the Revelation Principle does not always hold. Auletta et al. (J Auton Agent Multi-Agent Syst, to appear) proposed a characterization of correspondences for which the Revelation Principle holds, i.e., they described restrictions on misreporting under which a social choice function is implementable if and only if it is truthfully implementable. In this paper, we demonstrate that the characterization proposed in [1] is incorrect, and, building on their work, give a correct characterization. We also provide an example that demonstrates that our characterization is different from that of Auletta et al.
[1] Jerry R. Green,et al. Partially Verifiable Information and Mechanism Design , 1986 .
[2] Carmine Ventre,et al. Alternatives to truthfulness are hard to recognize , 2009, Autonomous Agents and Multi-Agent Systems.
[3] Noam Nisan,et al. Algorithmic Mechanism Design , 2001, Games Econ. Behav..
[4] Rakesh V. Vohra,et al. Paths, Cycles and Mechanism Design , 2007 .
[5] J. Rochet. A necessary and sufficient condition for rationalizability in a quasi-linear context , 1987 .