Strategy-proofness on the Non-Paretian Subdomain
Combinatorics
2015-03-02 v1
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.
Cite
@article{arxiv.1502.07933,
title = {Strategy-proofness on the Non-Paretian Subdomain},
author = {Donald E. Campbell and Jerry S. Kelly},
journal= {arXiv preprint arXiv:1502.07933},
year = {2015}
}