2000 character limit reached
Strategy-proofness on the Non-Paretian Subdomain
Published 26 Feb 2015 in math.CO | (1502.07933v1)
Abstract: Let g be a strategy-proof rule on the domain NP of profiles where no alternative Pareto-dominates any other. Then we establish a result with a Gibbard-Satterthwaite flavor: g is dictatorial if its range contains at least three alternatives.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.