Skip to main content
SpringerLink
Log in

Aggregation of Partial Rankings - An Approach Based on the Kemeny Ranking Problem

  • Conference paper
  • First Online:
Book cover Advances in Computational Intelligence (IWANN 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9095))

Included in the following conference series:

Abstract

Aggregating the preference of multiple experts is a very old problem which remains without an absolute solution. This assertion is supported by the Arrow’s theorem: there is no aggregation method that simultaneously satisfies three fairness criteria (non-dictatorship, independence of irrelevant alternatives and Pareto efficiency). However, it is possible to find a solution having minimal distance to the consensus, although it involves a NP-hard problem even for only a few experts. This paper presents a model based on Ant Colony Optimization for facing this problem when input data are incomplete. It means that our model should build a complete ordering from partial rankings. Besides, we introduce a measure to determine the distance between items. It provides a more complete picture of the aggregated solution. In order to illustrate our contributions we use a real problem concerning Employer Branding issues in Belgium.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Jackson, B.N., et al.: Consensus genetic maps as median orders from inconsistent sources. IEEE/ACM Trans. on Computational Biology and Bioinformatics 5, 161–171 (2008)

    Article  Google Scholar 

  2. Ephrati, E., Rosenschein, J.: Multi-agent planning as a dynamic search for social consensus. In: Proceedings of the 13th International Joint Conference on Artificial Intelligence, IJCAI 1993, pp. 423–429. Morgan Kaufmann (1993)

    Google Scholar 

  3. Diaconis, P., et al.: A generalization of spectral analysis with application to ranked data. Annals of Statistics 5, 949–979 (1989)

    Article  MathSciNet  Google Scholar 

  4. Chen, H., et al.: Global models of document structure using latent permutations. In: Proc. of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, NAACL, pp. 371–379 (2009)

    Google Scholar 

  5. Borda, J.: Memoire sur les elections au scrutin. In: Histoire de l’Academie Royal des Sciences (1781)

    Google Scholar 

  6. Condorcet, M.: Sur L’application de L’analyse à la Probabilité Des Décisions Rendues à la Pluralité Des Voix, L’Imprimerie Royale, Paris (1785)

    Google Scholar 

  7. Arrow, K.J.: Social Choice and Individual Values. Yale University Press (1963)

    Google Scholar 

  8. Ali, A., Meilă, M.: Experiments with Kemeny ranking: What works when? Mathematical Social Sciences 64, 28–40 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  9. Aledo, J., Gámez, J., Molina, D.: Tackling the rank aggregation problem with evolutionary algorithms. Applied Mathematics and Computation 222, 632–644 (2013)

    Article  MathSciNet  Google Scholar 

  10. Puris, A., Bello, R., Herrera, F.: Analysis of the efficacy of a Two-Stage methodology for ant colony optimization: Case of study with TSP and QAP. Expert Systems with Applications 37, 5443–5453 (2010)

    Article  Google Scholar 

  11. Kemeny, J.L., Snell, J.G.: Mathematical Models in the Social Sciences, New York (1962)

    Google Scholar 

  12. Kendall, M.G.: A new measure of rank correlation. Biometrika 30, 81–93 (1938)

    Article  MATH  MathSciNet  Google Scholar 

  13. Bansal, M., Fernández-Baca, D.: Computing distances between partial rankings. Information Processing Letters 109, 238–241 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  14. Hausdorff, F.: Grundzüge der Mengenlehre, Leipzig (1914)

    Google Scholar 

  15. Fagin, R., Kumar, R., Mahdian, M., Sivakumar, D., Vee, E.: Comparing partial rankings. Journal of Discrete Mathematics 20, 628–648 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  16. Dorigo, M., Caro, G.D., Gambardella, L.: Ant algorithms for discrete optimization. Artificial Life 5, 137–172 (1999)

    Article  Google Scholar 

  17. Dorigo, M., Bonabeau, E., Theraulaz, G.: Ant algorithms and stigmergy. Future Generation Computer Systems 16, 851–871 (2000)

    Article  Google Scholar 

  18. Dorigo, M., Colorni, A., Maniezzo, V.: The ant system: Optimization by a colony of cooperating agents. IEEE Transactions on Systems and Cybernetics 26, 29–41 (1996)

    Article  Google Scholar 

  19. Dorigo, M., Gambardella, L.: Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Trans. on Evolutionary Computation 1, 53–66 (1997)

    Article  Google Scholar 

  20. Stützle, T., Hoos, H.H.: MAX–MIN ant system. Future Generation Computer System 16, 889–914 (2000)

    Article  Google Scholar 

  21. Friedman, M.: The use of ranks to avoid the assumption of normality implicit in the analysis of variance. Jour. of the American Statistical Association 32, 674–701 (1937)

    Google Scholar 

  22. Wilcoxon, F.: Individual comparisons by ranking methods. Biometrics. 1, 80–83 (1945)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universidad Central “Marta Abreu” de Las Villas, Santa Clara, Cuba

    Gonzalo Nápoles & Rafael Bello

  2. Hasselt University, Diepenbeek, Belgium

    Gonzalo Nápoles, Zoumpoulia Dikopoulou & Koen Vanhoof

  3. Technological Education Institute of Central Greece, Lamia, Greece

    Elpiniki Papageorgiou

Authors
  1. Gonzalo Nápoles
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zoumpoulia Dikopoulou
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Elpiniki Papageorgiou
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Rafael Bello
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Koen Vanhoof
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Gonzalo Nápoles .

Editor information

Editors and Affiliations

  1. University of Granada, Granada, Spain

    Ignacio Rojas

  2. Department of Electronics Technology, University of Malaga, Malaga, Spain

    Gonzalo Joya

  3. Polytechnic University of Catalonia, Vilanova i la Geltrú, Spain

    Andreu Catala

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Nápoles, G., Dikopoulou, Z., Papageorgiou, E., Bello, R., Vanhoof, K. (2015). Aggregation of Partial Rankings - An Approach Based on the Kemeny Ranking Problem. In: Rojas, I., Joya, G., Catala, A. (eds) Advances in Computational Intelligence. IWANN 2015. Lecture Notes in Computer Science(), vol 9095. Springer, Cham. https://doi.org/10.1007/978-3-319-19222-2_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-19222-2_29

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-19221-5

  • Online ISBN: 978-3-319-19222-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation