Anonymous, non-manipulable, binary social choice
Achille Basile, Surekha Rao, and K.P.S. Bhaskara Rao
TL;DR
This paper characterizes all anonymous, non-manipulable social choice functions for societies with agents expressing preferences over two options, providing a simple formula and counting their total number.
Contribution
It presents a universal representation formula for all such social choice functions and determines their total count based on society size.
Findings
Number of functions is 2^{n+1} for n agents
Provides a simple representation formula
Applicable to all anonymous, non-manipulable binary social choice functions
Abstract
Let V be a finite society whose members express weak orderings (hence also indifference, possibly) about two alternatives. We show a simple representation formula that is valid for all, and only, anonymous, non-manipulable, binary social choice functions on V . The number of such functions is if V contains agents.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.