2016
DOI: 10.2139/ssrn.2875342
|View full text |Cite
|
Sign up to set email alerts
|

Another Perspective on Borda's Paradox

Abstract: This paper presents the conditions required for a profile in order to never exhibit either the strong or the strict Borda paradoxes under all weighted scoring rules in three-candidate elections. The main particularity of our paper is that all the conclusions are extracted from the differences of votes between candidates in pairwise majority elections. This way allows us to answer new questions and provide an organized knowledge of the conditions under which a given profile never shows one of the two paradoxes.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
3
0

Year Published

2018
2018
2019
2019

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 14 publications
(8 reference statements)
0
3
0
Order By: Relevance
“…It is important to notice that this paradox is also known in the literature as the strong Borda paradox. This type of problem for k = 1 is studied by Diss and Gehrlein (2012); Diss and Tlidi (2018); Fishburn and Gehrlein (1976); Gehrlein and Lepelley (2010b), among others. It is important to notice that, since a k-Condorcet loser set for (C, V, p) is a k-Condorcet winner for (C, V, p r ), if a csr is Condorcet consistent and immune to the reversal bias then it is immune to the Condorcet loser paradox.…”
Section: The Probability Of Suffering the Condorcet Loser Paradoxmentioning
confidence: 99%
See 1 more Smart Citation
“…It is important to notice that this paradox is also known in the literature as the strong Borda paradox. This type of problem for k = 1 is studied by Diss and Gehrlein (2012); Diss and Tlidi (2018); Fishburn and Gehrlein (1976); Gehrlein and Lepelley (2010b), among others. It is important to notice that, since a k-Condorcet loser set for (C, V, p) is a k-Condorcet winner for (C, V, p r ), if a csr is Condorcet consistent and immune to the reversal bias then it is immune to the Condorcet loser paradox.…”
Section: The Probability Of Suffering the Condorcet Loser Paradoxmentioning
confidence: 99%
“…7 Recall that a csr R is resolute if, for every (C, V, p) ∈ E and k ∈ [|C|−1], |R(C, V, p, k)| = 1; R suffers the reversal bias if there exist (C, V, p) ∈ E and k ∈ [|C| − 1] such that |R(C, V, p, k)| = 1 and R(C, V, p, k) = R(C, V, p r , k); R suffers the Condorcet loser paradox if there exist (C, V, p) ∈ E, k ∈ [|C| − 1] and W * ∈ 2 C k such that W * is a k-Condorcet loser set for (C, V, p), that is, for every x ∈ W * and y ∈ C \ W * , c p (x, y) < |V | 2 , and R(C, V, p, k) = {W * }; R suffers the leaving member paradox if there exist (C, V, p) ∈ E, k ∈ [|C| − 1] with k = 1, and 7 Those properties are largely studied in the literature. See for instance, Bubboloni and Gori (2016), Diss and Doghmi (2016), Diss and Gehrlein (2012), Diss and Tlidi (2018), Duggan and Schwartz (2000), Fishburn and Gehrlein (1976), Gehrlein and Lepelley (2010b), Jeong and Ju (2017), Kamwa and Merlin (2015), Saari and Barney (2003), and Staring (1986).…”
mentioning
confidence: 99%
“…The study of the likelihood of each of these three paradoxes is well addressed in the social choice literature. Without been exhaustive, the reader may refer to the theoretical works of Diss and Gehrlein (2012), Diss and Tlidi (2018), Fishburn (1976, 1978a), Gehrlein and Lepelley (2017, 2011, 2010b, 1998, Lepelley (1996Lepelley ( , 1993, Lepelley et al (2000a,b), Saari (1994), Saari and Valognes (1999), Tataru and Merlin (1997). We can also mention that there are some empirical works that looked after these paradoxes in real-world data; we refer to the works of Bezembinder (1996), Colman and Poutney (1978), Riker (1982), Taylor (1997), Van Newenhizen (1992, Weber (1978).…”
Section: Introductionmentioning
confidence: 99%