arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 2205.03352econ.TH
收藏

Jackson & Sonnenschein(2007)《Overcoming Incentive Constraints by Linking Decisions》

Comment on Jackson and Sonnenschein (2007) "Overcoming Incentive Constraints by Linking Decisions"

Ian Ball, Matt O. Jackson, Deniz Kattwinkel

摘要:

我们修正了Jackson和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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑