2000 character limit reached
Anonymous, non-manipulable, binary social choice
Published 3 Jul 2020 in econ.TH | (2007.01552v1)
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 $2{n+1}$ if V contains $n$ agents.
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.