论文标题
评论杰克逊和索宁琴(Jackson and Sonnenschein)(2007年)“通过联系决策来克服激励的限制”
Comment on Jackson and Sonnenschein (2007) "Overcoming Incentive Constraints by Linking Decisions"
论文作者
论文摘要
我们纠正了杰克逊和索尼斯辛(Jackson and Sonnenschein)(2007)纸体所使用的近似真实性的定义。他们的主要定理的证明使用了不同的基于置换的定义,隐含地声称置换量反映意味着基于边界的版本。我们表明,只有在绑定宽松的情况下,这种说法才能存在。新的界限仍然足够强大,可以保证随着问题的数量的增加,谎言的比例消失了,因此,定理是正确的,如绑定一旦绑定而言。
We correct a bound in the definition of approximate truthfulness used in the body of the paper of Jackson and Sonnenschein (2007). The proof of their main theorem uses a different permutation-based definition, implicitly claiming that the permutation-version implies the bound-based version. We show that this claim holds only if the bound is loosened. The new bound is still strong enough to guarantee that the fraction of lies vanishes as the number of problems grows, so the theorem is correct as stated once the bound is loosened.