Today, many countries around the world, particularly in Africa, are experiencing post-election difficulties due to unexpected election results. This sometimes provokes protests and revolt among the population. To overcome this major problem, several voting systems have been developed in the literature, but some of them are not lacking in shortcomings. It was with this in mind that the voting method based on the evaluation of the mean deviation was born. It's a voting system that seems to be appreciated because it respects a certain number of fundamental properties of a ranking method. On the other hand, we note in the literature that it is only applicable to small-scale data with an insignificant number of candidates and voters. For this reason, we set ourselves the goal of implementing this method in order to extend its use to large-scale problems. Thus, we proposed the computer program using python software, which takes as input the scores assigned to the candidates by each voter and displays as output the best candidate. To do this, we built sub-programs such as median, arithmetic mean and mean-spread functions, each of which plays an effective role in selecting the best candidate. We then studied the algorithmic time complexity theoretically, then graphically, and ended by applying our computer program to several voting examples containing a very large number of candidates and voters. Numerous applications enabled us to observe that, whatever the size of the data, we always obtained a conclusive and satisfactory result with polynomial-type time complexity.
| Published in | Pure and Applied Mathematics Journal (Volume 14, Issue 2) |
| DOI | 10.11648/j.pamj.20251402.11 |
| Page(s) | 13-23 |
| Creative Commons |
This is an Open Access article, distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution and reproduction in any medium or format, provided the original work is properly cited. |
| Copyright |
Copyright © The Author(s), 2025. Published by Science Publishing Group |
Implementation, Voting Method, Mean- Deviation, Election
| [1] | N. Bakhta. Multi-agent model for the design of collective decision support systems. thesis, University of Oran. pages 542-569, 2013-2014. |
| [2] | P. Blanchenay. Voting paradoxes and voting methods in france. the master's thesis,' high school commercial studies major 'economie. 2004. |
| [3] | Adama Coulibaly. Group decision, facilitation aid: adjusting voting procedures according to the decision context. artificial intelligence [cs.ai]. university toulouse 1 capitole (ut1capitole). 2019. |
| [4] | Veera P. Darji and Ravipud V. Rao. Application of ahp/evamix method for decision making in the industrial environment; s.v. national institute of technology, surat, india. (3): 542-569, 2013. |
| [5] | Kangashe Jean-Louis Esambo. Strategic vote choice in one round and two round elections. Political research quaterly. 4(3): 637-645, 2010. |
| [6] | Kangashe Jean-Louis Esambo. Congolese electoral law. academia-harmattan., louvain-la-neuve. 2014. |
| [7] | Benny Geys. Rational theories of voter tournout: A review. political studies review. (4): 16-35, 2006. |
| [8] | Jacobs M. Sustainable development as a contested concept, in dobson, a. fairness and futurity: Essays on environmental sustainability and socialjustice. oxford: Oxford university press. pages 27-59, 1999. |
| [9] | Zoïnabo Savadogo. Contributions to collective aggregation in the multicriteria decision support problem. page 19. |
| [10] | Zoïnabo Savadogo, Abdoulaye Compaore, and Pegdwindé Ousséni Fabrice Ouedraogo. Voting method based on an average gap. 12(3): 1176-1186, 2019. |
| [11] | Zoïnabo Savadogo, Sougoursi Jean Yves Zaré, Wambie, Zongo, Somdouda Sawadogo, Blaise Somé. New Innovative Method in the Field of Social Choice Theory. Pure and Applied Mathematics Journal. Vol. 10, No. 6, 2021, pp. 121-126. |
| [12] | Zoïnabo SAVADOGO, Sougoursi Jean Yves ZARE, Wambie ZONGO, Blaise SOME. New Voting Method Adapted to Developing Countries (NoMePaVD). Pure and Applied Mathematics Journal. Vol. 12, No. 1, 2023, pp. 12-15. |
| [13] | Koumbèbarè Kambiré, Zoïnabo Savadogo, Frédéric Nikiéma. Implementation of the VMAVA Method in Order to Make Applications with a Large Number of Candidates and Voters. Pure and Applied Mathematics Journal. Vol. 12, No. 3, 2023, pp. 49-58. |
| [14] | Wambie Zongo, Zoïnabo Savadogo, Sougoursi Jean Yves Zare, Somdouda Sawadogo and Blaise Some, VMAVA+: (Voting Method based on Approval Voting and Arithmetic mean) +, Advances and Applications in Discrete Mathematics 35 (2022), 87-102. |
| [15] | Ngoie, R.-B. M.; Kasereka, S. K.; Sakulu, J.-A. B.; Kyamakya, K. Mean-Median Compromise Method: A Novel Deepest Voting Function Balancing Range Voting and Majority Judgment. Mathematics 2024, 12, 3631. |
APA Style
Yiogo, H., Savadogo, Z. (2025). Implementation of a Voting Method Based on Mean-Deviation Evaluation for a Large-Scale Election. Pure and Applied Mathematics Journal, 14(2), 13-23. https://doi.org/10.11648/j.pamj.20251402.11
ACS Style
Yiogo, H.; Savadogo, Z. Implementation of a Voting Method Based on Mean-Deviation Evaluation for a Large-Scale Election. Pure Appl. Math. J. 2025, 14(2), 13-23. doi: 10.11648/j.pamj.20251402.11
Share This Article
Twitter
Linked In
Facebook
Copy
Download@article{10.11648/j.pamj.20251402.11,
author = {Hadarou Yiogo and Zoïnabo Savadogo},
title = {Implementation of a Voting Method Based on Mean-Deviation Evaluation for a Large-Scale Election
},
journal = {Pure and Applied Mathematics Journal},
volume = {14},
number = {2},
pages = {13-23},
doi = {10.11648/j.pamj.20251402.11},
url = {https://doi.org/10.11648/j.pamj.20251402.11},
eprint = {https://article.sciencepublishinggroup.com/pdf/10.11648.j.pamj.20251402.11},
abstract = {Today, many countries around the world, particularly in Africa, are experiencing post-election difficulties due to unexpected election results. This sometimes provokes protests and revolt among the population. To overcome this major problem, several voting systems have been developed in the literature, but some of them are not lacking in shortcomings. It was with this in mind that the voting method based on the evaluation of the mean deviation was born. It's a voting system that seems to be appreciated because it respects a certain number of fundamental properties of a ranking method. On the other hand, we note in the literature that it is only applicable to small-scale data with an insignificant number of candidates and voters. For this reason, we set ourselves the goal of implementing this method in order to extend its use to large-scale problems. Thus, we proposed the computer program using python software, which takes as input the scores assigned to the candidates by each voter and displays as output the best candidate. To do this, we built sub-programs such as median, arithmetic mean and mean-spread functions, each of which plays an effective role in selecting the best candidate. We then studied the algorithmic time complexity theoretically, then graphically, and ended by applying our computer program to several voting examples containing a very large number of candidates and voters. Numerous applications enabled us to observe that, whatever the size of the data, we always obtained a conclusive and satisfactory result with polynomial-type time complexity.
},
year = {2025}
}
TY - JOUR T1 - Implementation of a Voting Method Based on Mean-Deviation Evaluation for a Large-Scale Election AU - Hadarou Yiogo AU - Zoïnabo Savadogo Y1 - 2025/04/10 PY - 2025 N1 - https://doi.org/10.11648/j.pamj.20251402.11 DO - 10.11648/j.pamj.20251402.11 T2 - Pure and Applied Mathematics Journal JF - Pure and Applied Mathematics Journal JO - Pure and Applied Mathematics Journal SP - 13 EP - 23 PB - Science Publishing Group SN - 2326-9812 UR - https://doi.org/10.11648/j.pamj.20251402.11 AB - Today, many countries around the world, particularly in Africa, are experiencing post-election difficulties due to unexpected election results. This sometimes provokes protests and revolt among the population. To overcome this major problem, several voting systems have been developed in the literature, but some of them are not lacking in shortcomings. It was with this in mind that the voting method based on the evaluation of the mean deviation was born. It's a voting system that seems to be appreciated because it respects a certain number of fundamental properties of a ranking method. On the other hand, we note in the literature that it is only applicable to small-scale data with an insignificant number of candidates and voters. For this reason, we set ourselves the goal of implementing this method in order to extend its use to large-scale problems. Thus, we proposed the computer program using python software, which takes as input the scores assigned to the candidates by each voter and displays as output the best candidate. To do this, we built sub-programs such as median, arithmetic mean and mean-spread functions, each of which plays an effective role in selecting the best candidate. We then studied the algorithmic time complexity theoretically, then graphically, and ended by applying our computer program to several voting examples containing a very large number of candidates and voters. Numerous applications enabled us to observe that, whatever the size of the data, we always obtained a conclusive and satisfactory result with polynomial-type time complexity. VL - 14 IS - 2 ER -
Department of Mathematics, Laboratory of Numerical Analysis, Computer Science and Biomathematics, Joseph KI-ZERBO University, Ouagadougou, Burkina Faso
Department of Mathematics, Laboratory of Numerical Analysis, Computer Science and Biomathematics, Joseph KI-ZERBO University, Ouagadougou, Burkina Faso
Information