Nash implementable domains for the Borda count

Puppe, Clemens and Tasnádi, Attila (2008) Nash implementable domains for the Borda count. Social choice and welfare, 31 (3). pp. 367-392. DOI 10.1007/s00355-007-0286-4

PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader

Official URL:


We characterize the preference domains on which the Borda count satisfies Maskin monotonicity. The basic concept is the notion of a "cyclic permutation domain" which arises by fixing one particular ordering of alternatives and including all its cyclic permutations. The cyclic permutation domains are exactly the maximal domains on which the Borda count is strategy-proof when combined with every possible tie breaking rule. It turns out that the Borda count is monotonic on a larger class of domains. We show that the maximal domains on which the Borda count satisfies Maskin monotonicity are the "cyclically nested permutation domains" which are obtained from the cyclic permutation domains in an appropriately specified recursive way. ------ *We thank József Mala for posing the question of Nash implementability on restricted domains that led to this research. We are very grateful to two anonymous referees and an associate editor for their helpful comments and suggestions. The second author gratefully acknowledges financial support from the Hungarian Academy of Sciences (MTA) through the Bolyai János research fellowship.

Item Type:Article
Series Number / Identification Number:10.1007/s00355-007-0286-4
Uncontrolled Keywords:Maskin monotonicity, Borda count, restricted preference domains
Subjects:Mathematics, Econometrics
ID Code:293
Deposited By: Ádám Hoffmann
Deposited On:05 Mar 2011 09:47
Last Modified:18 Mar 2014 16:30

Repository Staff Only: item control page


Downloads per month over past year

View more statistics