Abstract

Let Φn be the set of the binary strategy-proof social choice functions referred to a group of n voters who are allowed to declare indifference between the alternatives. We provide a recursive way to obtain the set Φn+1 from the set Φn. Computing the cardinalities |Φn| presents difficulties as the computation of the Dedekind numbers. The latter give the analogous number of social choice functions when only strict preferences are admitted. A comparison is given for the known values. Based on our results, we present a graphical description of the binary strategy-proof social choice functions in the case of three voters.

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.