2000 character limit reached
Two Theorems on the Range of Strategy-proof Rules on a Restricted Domain (1408.7044v1)
Published 29 Aug 2014 in math.CO
Abstract: Let g be a strategy-proof rule on the domain NP of profiles where no alternative Pareto-dominates any other and let g have range S on NP. We complete the proof of a Gibbard-Satterthwaite result - if S contains more than two elements, then g is dictatorial - by establishing a full range result on two subdomains of NP.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.