Skip to main content
SpringerLink
Log in

The Minimum Acceptable Violation Ranking of Alternatives from Voters’ Ordinal Rankings

  • Conference paper
  • First Online:
Combinatorial Optimization and Applications

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

  • 1028 Accesses

Abstract

Motived by applications of ordinal ranking and adjustment consensus in group decision making, we study the problem of aggregating all voters’ ordinal ranking on a set of alternatives into an adjusted “consensus” ranking. In this problem, every voter ranks a set of alternatives respectively, and we know the adjustment acceptability. The problem is to find an optimal ordinal ranking which minimizes the sum of voter’s acceptable violation. We analyse this problem by utilizing both pairwise preference and order-based ranking, and develop a branch-and-bound algorithm to solve this problem. The effectiveness and efficiency of this algorithm are verified with a small example and numerical experiments.

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 EPUB and 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

References

  1. De Borda J.C.: Mmoire sur les lections au scrutin (1781)

    Google Scholar 

  2. Kendall, M.G.: Rank correlation methods, Biometrika (1990)

    Google Scholar 

  3. Wei, T.-H.: The algebraic foundations of ranking theory, University of Cambridge (1952)

    Google Scholar 

  4. Blin, J.M.: A linear assignment formulation of the multiattribute decision problem. RAIRO - Oper. Res. - Recherche Opérationnelle 10(V2), 21–32 (1976)

    MathSciNet  MATH  Google Scholar 

  5. Kemeny, J.G., Snell, L.J.: Preference ranking: an axiomatic approach. In: Mathematical Models in the Social Sciences, pp. 9–23 (1962)

    Google Scholar 

  6. Cook, W.D., Seiford, L.M.: Priority ranking and consensus formation. Manage. Sci. 24(16), 1721–1732 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  7. Cook, W.D., Seiford, L.M.: On the Borda-Kendall consensus method for priority ranking problems. Manage. Sci. 28(6), 621–637 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  8. Ali, I., Cook, W.D., Kress, M.: On the minimum violations ranking of a tournament. Manage. Sci. 32(6), 660–672 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  9. Cook, W.D., Saipe, A.L.: Committee approach to priority planning: the median ranking. Cahiers du Centre dtudes de Recherche Oprationnelle 18(3), 337–351 (1976)

    MathSciNet  MATH  Google Scholar 

  10. Barzilai, J., Cook, W.D., Kress, M.: A generalized network formulation of the pairwise comparison consensus ranking model. Manage. Sci. 32(8), 1007–1014 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  11. Cook, W.D., Golan, I., Kress, M.: Heuristics for ranking players in a round robin tournament. Comput. Oper. Res. 15(2), 135–144 (1988)

    Article  MathSciNet  Google Scholar 

  12. Cook, W.D., Kress, M.: A data envelopment model for aggregating preference rankings. Manage. Sci. 36(11), 1302–1310 (1990)

    Article  MATH  Google Scholar 

  13. Rademaker, M., De Baets, B.: A ranking procedure based on a natural monotonicity constraint. Inf. Fusion 17, 74–82 (2014)

    Article  Google Scholar 

  14. Cook, W.D., Golany, B., Penn, M., et al.: Creating a consensus ranking of proposals from reviewers partial ordinal rankings. Comput. Oper. Res. 34(4), 954–965 (2007)

    Article  MATH  Google Scholar 

  15. Ben-Arieh, D., Chen, Z.: Linguistic labels aggregation and consensus measure for autocratic decision-making using group recommendations. IEEE Trans. Syst. Man Cybern. Part A Syst. Hum. 36(3), 558–568 (2006)

    Article  Google Scholar 

  16. Ben-Arieh, D., Easton, T.: Multi-criteria group consensus under linear cost opinion elasticity. Decis. Supp. Syst. 43(3), 713–721 (2007)

    Article  Google Scholar 

  17. Ben-Arieh, D., Easton, T., Evans, B.: Minimum cost consensus with quadratic cost functions. IEEE Trans. Syst. Man Cybern. Part A Syst. Hum. 39(1), 210–217 (2009)

    Article  Google Scholar 

  18. Isaak, G., Narayan, D.A.: Complete classification of all tournaments having a disjoint union of directed paths as a minimum feedback arc set. J. Graph Theor. 45(1), 2847 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  19. Bader, D., Cong, G.: Graph algorithms. Encycl. Parallel Comput. 11(5), 467–492 (2011)

    Google Scholar 

Download references

Acknowledgments

This paper was supported by the National Natural Science Foundation of China (No. 61221063), the Program for Changjiang Scholars and Innovative Research Team in University (IRT1173).

Author information

Authors and Affiliations

  1. School of Management, Xi’an Jiaotong University, Xi’an, China

    Kelin Luo & Yinfeng Xu

  2. State Key Lab for Manufacturing System Engineering, Xi’an, 710049, China

    Kelin Luo & Yinfeng Xu

Authors
  1. Kelin Luo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yinfeng Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kelin Luo .

Editor information

Editors and Affiliations

  1. Dept. of Mathematics and Computer Science, Marywood University, Scranton, Pennsylvania, USA

    Zaixin Lu

  2. North Carolina Central University, Durham, North Carolina, USA

    Donghyun Kim

  3. University of Texas at Dallas, Richardson, Texas, USA

    Weili Wu

  4. Texas Southern University, Houston, Texas, USA

    Wei Li

  5. University of Texas at Dallas, Richardson, Texas, USA

    Ding-Zhu Du

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Luo, K., Xu, Y. (2015). The Minimum Acceptable Violation Ranking of Alternatives from Voters’ Ordinal Rankings. In: Lu, Z., Kim, D., Wu, W., Li, W., Du, DZ. (eds) Combinatorial Optimization and Applications. Lecture Notes in Computer Science(), vol 9486. Springer, Cham. https://doi.org/10.1007/978-3-319-26626-8_56

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-26626-8_56

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-26625-1

  • Online ISBN: 978-3-319-26626-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation