Abdelmonaim Tlidi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Abdelmonaim Tlidi has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Mostapha Diss
Université Marie et Louis Pasteur, CRESE (UR 3190), Besançon, France
5 shared publications - Eric Kamwa
LC2S UMR CNRS 8053 Univ. des Antilles Schoelcher Cedex F-97275 Martinique France
3 shared publications E. Lakhel
Cadi Ayyad University, National School of Applied Sciences
1 shared publication
Latest Publications
- Open Access
- 12 November 2020
- Published by CAIRN.INFO in Revue d'économie politique
- Vol. 130 (5) , 699-725
On Some k -scoring Rules for Committee Elections: Agreement and Condorcet Principle
Given a collection of individual preferences on a set of candidates and a desired number of winners, a multi-winner voting rule outputs groups of winners, which we call committees. In this paper, we consider five multi-winner voting rules widely studied in the literature of social choice theory: the k-Plurality rule, the k-Borda rule, the k-Negative Plurality rule, the Bloc rule, and the Chamberlin-Courant rule. The objective of this paper is to provide a comparison of these multi-winner voting rules according to some principles by taking into account a probabilistic approach using the well-known Impartial Anonymous Culture (IAC) assumption. We first evaluate the probability that each pair of the considered voting rules selects the same unique committee in order to identify which multi-winner rules are the most likely to agree for a given number of candidates and a fixed target size of the committee. In this matter, our results show that the Chamberlin-Courant rule and the k-Plurality rule on one side, and the k-Borda rule and the Bloc rule on the other side, are the pairs of rules that most agree in comparison to other pairs. Furthermore, we evaluate the probability of every multi-winner voting rule selecting the Condorcet committee à la Gehrlein when it exists. The Condorcet committee à la Gehrlein is a fixed-size committee such that every member defeats every non-member in pairwise comparisons. In addition, we compare the considered multi-winner voting rules according to their ability (susceptibility) to select a committee containing the Condorcet winner (loser) when one exists. Here, our results tell us that in general, the k-Borda rule has the highest performance amongst all the considered voting rules. Finally, we highlight that this paper is one of the very rare contributions in the literature giving exact results under the Impartial Anonymous Culture (IAC) condition for the case of four candidates.
- 12 November 2020
- Published by CAIRN.INFO in Revue d'économie politique
- Vol. 130 (5) , 699-725
Open AccessOn Some k -scoring Rules for Committee Elections: Agreement and Condorcet Principle
Given a collection of individual preferences on a set of candidates and a desired number of winners, a multi-winner voting rule outputs groups of winners, which we call committees. In this paper, we consider five multi-winner voting rules widely studied in the literature of social choice theory: the k-Plurality rule, the k-Borda rule, the k-Negative Plurality rule, the Bloc rule, and the Chamberlin-Courant rule. The objective of this paper is to provide a comparison of these multi-winner voting rules according to some principles by taking into account a probabilistic approach using the well-known Impartial Anonymous Culture (IAC) assumption. We first evaluate the probability that each pair of the considered voting rules selects the same unique committee in order to identify which multi-winner rules are the most likely to agree for a given number of candidates and a fixed target size of the committee. In this matter, our results show that the Chamberlin-Courant rule and the k-Plurality rule on one side, and the k-Borda rule and the Bloc rule on the other side, are the pairs of rules that most agree in comparison to other pairs. Furthermore, we evaluate the probability of every multi-winner voting rule selecting the Condorcet committee à la Gehrlein when it exists. The Condorcet committee à la Gehrlein is a fixed-size committee such that every member defeats every non-member in pairwise comparisons. In addition, we compare the considered multi-winner voting rules according to their ability (susceptibility) to select a committee containing the Condorcet winner (loser) when one exists. Here, our results tell us that in general, the k-Borda rule has the highest performance amongst all the considered voting rules. Finally, we highlight that this paper is one of the very rare contributions in the literature giving exact results under the Impartial Anonymous Culture (IAC) condition for the case of four candidates.
- 9 October 2018
- Published by Springer Nature
- p. 301-320
Time-Dependent Neutral Stochastic Delay Partial Differential Equations Driven by Rosenblatt Process in Hilbert Space
- 9 October 2018
- Published by Springer Nature
- p. 301-320
Time-Dependent Neutral Stochastic Delay Partial Differential Equations Driven by Rosenblatt Process in Hilbert Space
- Open Access
The Chamberlin-Courant Rule and the k-Scoring Rules: Agreement and Condorcet Committee Consistency
For committee or multiwinner elections, the Chamberlin-Courant rule (CCR), which combines the Borda rule and the proportional representation, aims to pick the most representative committee (Chamberlin and Courant, 1983). Chamberlin and Courant (1983) have shown that if the size of the committee to be elected is k = 1 among m ≥ 3 candidates, the CCR is equivalent to the Borda rule; Kamwa and Merlin (2014) claimed that if k = m − 1, the CCR is equivalent to the k-Plurality rule. In this paper, we explore what happens for 1 < k < m − 1 by computing the probability of agreement between the CCR and four k-scoring rules: k-Plurality, k-Borda, k-Negative Plurality and Bloc. Our results show that for committees of at least two members, the CCR usually leads to a committee recommended by the k-Plurality rule. Furthermore, we evaluate the probability of the CCR to select the Condorcet committee à la Gehrlein when it exists. The Condorcet committee à la Gehrlein is a fixed size subset of candidates such that every meber defeats every non-member in pairwise comparisons. In this matter, our results indicate that the CCR performs less well than the k-Borda rule and the Bloc rule but better than the k-Plurality and the k-Negative Plurality rules.
Open AccessThe Chamberlin-Courant Rule and the k-Scoring Rules: Agreement and Condorcet Committee Consistency
For committee or multiwinner elections, the Chamberlin-Courant rule (CCR), which combines the Borda rule and the proportional representation, aims to pick the most representative committee (Chamberlin and Courant, 1983). Chamberlin and Courant (1983) have shown that if the size of the committee to be elected is k = 1 among m ≥ 3 candidates, the CCR is equivalent to the Borda rule; Kamwa and Merlin (2014) claimed that if k = m − 1, the CCR is equivalent to the k-Plurality rule. In this paper, we explore what happens for 1 < k < m − 1 by computing the probability of agreement between the CCR and four k-scoring rules: k-Plurality, k-Borda, k-Negative Plurality and Bloc. Our results show that for committees of at least two members, the CCR usually leads to a committee recommended by the k-Plurality rule. Furthermore, we evaluate the probability of the CCR to select the Condorcet committee à la Gehrlein when it exists. The Condorcet committee à la Gehrlein is a fixed size subset of candidates such that every meber defeats every non-member in pairwise comparisons. In this matter, our results indicate that the CCR performs less well than the k-Borda rule and the Bloc rule but better than the k-Plurality and the k-Negative Plurality rules.
- Open Access
The Chamberlin-Courant Rule and the k-Scoring Rules: Agreement and Condorcet Committee Consistency
For committee or multiwinner elections, the Chamberlin-Courant rule (CCR), which combines the Borda rule and the proportional representation, aims to pick the most representative committee (Chamberlin and Courant, 1983). Chamberlin and Courant (1983) have shown that if the size of the committee to be elected is k = 1 among m ≥ 3 candidates, the CCR is equivalent to the Borda rule; Kamwa and Merlin (2014) claimed that if k = m − 1, the CCR is equivalent to the k-Plurality rule. In this paper, we explore what happens for 1 < k < m − 1 by computing the probability of agreement between the CCR and four k-scoring rules: k-Plurality, k-Borda, k-Negative Plurality and Bloc. Our results show that for committees of at least two members, the CCR usually leads to a committee recommended by the k-Plurality rule. Furthermore, we evaluate the probability of the CCR to select the Condorcet committee à la Gehrlein when it exists. The Condorcet committee à la Gehrlein is a xed size subset of candidates such that every member defeats every non-member in pairwise comparisons. In this matter, our results indicate that the CCR performs less well than the k-Borda rule and the Bloc rule but better than the k-Plurality and the k-Negative Plurality rules.
Open AccessThe Chamberlin-Courant Rule and the k-Scoring Rules: Agreement and Condorcet Committee Consistency
For committee or multiwinner elections, the Chamberlin-Courant rule (CCR), which combines the Borda rule and the proportional representation, aims to pick the most representative committee (Chamberlin and Courant, 1983). Chamberlin and Courant (1983) have shown that if the size of the committee to be elected is k = 1 among m ≥ 3 candidates, the CCR is equivalent to the Borda rule; Kamwa and Merlin (2014) claimed that if k = m − 1, the CCR is equivalent to the k-Plurality rule. In this paper, we explore what happens for 1 < k < m − 1 by computing the probability of agreement between the CCR and four k-scoring rules: k-Plurality, k-Borda, k-Negative Plurality and Bloc. Our results show that for committees of at least two members, the CCR usually leads to a committee recommended by the k-Plurality rule. Furthermore, we evaluate the probability of the CCR to select the Condorcet committee à la Gehrlein when it exists. The Condorcet committee à la Gehrlein is a xed size subset of candidates such that every member defeats every non-member in pairwise comparisons. In this matter, our results indicate that the CCR performs less well than the k-Borda rule and the Bloc rule but better than the k-Plurality and the k-Negative Plurality rules.
- 1 January 2018
- Published by Springer Nature in Theory and Decision
- Vol. 84 (1) , 99-121
Another perspective on Borda's paradox
- 1 January 2018
- Published by Springer Nature in Theory and Decision
- Vol. 84 (1) , 99-121
Another perspective on Borda's paradox
- Open Access
Another perspective on Borda's paradox
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. 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.
Open AccessAnother perspective on Borda's paradox
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. 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.