Strategy-proof voting on the full preference domain

Research output: Contribution to journalArticlepeer-review

17 Citations (SciVal)


In analyses of strategy-proof voting, two results feature prominently: the dictatorial characterization contained in the Gibbard-Satterthwaite theorem and the voting by committees characterization in the Barbera-Sonnenschein-Zhou theorem. The two theorems are based on voting procedures defined on the domain of strict preferences. In the present study, we derive corresponding results for voting schemes defined on the full domain of weak preferences and obtain a characterization by means of a combination of sequential dictatorship and voting by extended committees.
Original languageEnglish
Pages (from-to)272-287
JournalMathematical Social Sciences
Issue number3
Publication statusPublished - 2006

Subject classification (UKÄ)

  • Economics


  • Barbers-Sonnenschein-Zhou theorem
  • strategy-proof voting
  • Gibbard-Satterthwaite theorem


Dive into the research topics of 'Strategy-proof voting on the full preference domain'. Together they form a unique fingerprint.

Cite this