arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0911.0517math.COmath.PR
收藏

操纵的几何学--Gibbard Satterthwaite定理的定量证明

The Geometry of Manipulation - a Quantitative Proof of the Gibbard Satterthwaite Theorem

Marcus Isaksson, Guy Kindler, Elchanan Mossel

摘要:

我们证明了定量版本的Gibbard-Satterthwaite定理。我们表明,一个统一选择的选民配置文件的一个中立的社会选择函数f的$q \ge 4$的替代品和n选民将操纵的概率至少$10^{-4} \eps^2 n^{-3} q^{-30}$,其中$\eps$是最小的统计距离f和家庭的独裁者功能。我们的结果扩展了FrKaNi:08的结果,该结果是针对3个备选方案的情况获得的,并且意味着在计算硬度后面的掩蔽操作的方法(如在BarthOrline:91,ConitzerS 03 b,ElkindL 05,ProcacciaR 06和ConitzerS 06中所考虑的)不能完全隐藏操作。我们的证明是几何的。更具体地说,它扩展了典型路径的方法,以表明位于3个或更多结果的界面上的轮廓的测量是大的。据我们所知,我们的结果是第一个等周的结果,建立界面的两个以上的机构。

英文摘要:

We prove a quantitative version of the Gibbard-Satterthwaite theorem. We show that a uniformly chosen voter profile for a neutral social choice function f of $q \ge 4$ alternatives and n voters will be manipulable with probability at least $10^{-4} \eps^2 n^{-3} q^{-30}$, where $\eps$ is the minimal statistical distance between f and the family of dictator functions. Our results extend those of FrKaNi:08, which were obtained for the case of 3 alternatives, and imply that the approach of masking manipulations behind computational hardness (as considered in BarthOrline:91, ConitzerS03b, ElkindL05, ProcacciaR06 and ConitzerS06) cannot hide manipulations completely. Our proof is geometric. More specifically it extends the method of canonical paths to show that the measure of the profiles that lie on the interface of 3 or more outcomes is large. To the best of our knowledge our result is the first isoperimetric result to establish interface of more than two bodies.

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

↑