Simple Mechanisms And Preferences For Honesty
Games and Economic Behavior(2014)
摘要
We consider full implementation in complete-information environments when agents have an arbitrarily small preference for honesty. We offer a condition called separable punishment and show that when it holds and there are at least two agents, any social choice function can be implemented by a simple mechanism in two rounds of iterated deletion of strictly dominated strategies. (C) 2013 Elsevier Inc. All rights reserved.
更多查看译文
关键词
Behavioral mechanism design,Implementation,Lying costs,Separable domain
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络