Abstract
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).
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.