English

Anonymous, non-manipulable, binary social choice

Theoretical Economics 2020-07-06 v1

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 2n+12^{n+1} if V contains nn agents.

Cite

@article{arxiv.2007.01552,
  title  = {Anonymous, non-manipulable, binary social choice},
  author = {Achille Basile and Surekha Rao and K. P. S. Bhaskara Rao},
  journal= {arXiv preprint arXiv:2007.01552},
  year   = {2020}
}

Comments

JEL Code: D71

R2 v1 2026-06-23T16:49:25.144Z