Abstract

I consider social choice problems such that (i) the set of alternatives can be partitioned into categories based on a prominent and objective feature and (ii) agents have strict preferences over the alternatives. Main results are characterizations of the structure of the strategy-proof social choice functions. I prove that each social choice function is strategy-proof if and only if it is decomposable into “small” strategy-proof social choice functions; one of them chooses one category and each of the others chooses one alternative from a category.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.