In (Mennle and Seuken, 2017), we have introduced partial strategyproofness, a new, relaxed notion of strategyproofness, to study the incentive properties of non-strategyproof assignment mechanisms. In this paper, we present results pertaining to local sufficiency for partial strategyproofness: We show that, for any r in [0,1], r-local partial strategyproofness implies r^2-partial strategyproofness, and we show that this is the tightest polynomial bound for which a guarantee can be proven. Our results unify the two prior local sufficiency results for strategyproofness (Carroll, 2012) and lexicographic dominance-strategyproofness (Cho, 2012).

中文翻译：

---

局部策略证明的局部充分性

在 (Mennle and Seuken, 2017) 中，我们引入了部分策略证明，这是一种新的、宽松的策略证明概念，用于研究非策略证明分配机制的激励特性。在本文中，我们展示了关于局部策略证明的局部充分性的结果：我们表明，对于 [0,1] 中的任何 r，r-local 部分策略证明意味着 r^2-partial strategyproofness，并且我们证明这是最严格的可以证明保证的多项式边界。我们的结果统一了策略证明（Carroll，2012）和词典优势策略证明（Cho，2012）的两个先前的局部充分性结果。