Javascript verkar inte påslaget? - Vissa delar av Lunds universitets webbplats fungerar inte optimalt utan javascript, kontrollera din webbläsares inställningar.
Du är här

Strategy-proof voting on the full preference domain

Publiceringsår: 2006
Språk: Engelska
Sidor: 272-287
Publikation/Tidskrift/Serie: Mathematical Social Sciences
Volym: 52
Nummer: 3
Dokumenttyp: Artikel
Förlag: Elsevier Science B.V.


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.



  • Business and Economics
  • Barbers-Sonnenschein-Zhou theorem
  • strategy-proof voting
  • Gibbard-Satterthwaite theorem


  • ISSN: 0165-4896

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu [dot] se

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen