Skip to main content
SpringerLink
Log in

Consolidation of Individual Rankings by the Method of Branches And Bounds

  • SYSTEM ANALYSIS AND OPERATIONS RESEARCH
  • Published:
Journal of Computer and Systems Sciences International Aims and scope

Abstract

In the problem of collective choice, an algorithm is proposed for constructing an optimal aggregate ranking that is closest to all individual strict rankings in the sense of the Kemeny median. The application of the branch-and-bound method allows problems of large dimensions to be solved and can also be used in the case when individual preferences are arbitrary binary relations.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

REFERENCES

  1. B. G. Mirkin, Group Choice Problem (Nauka, Moscow, 1974) [in Russian].

    Google Scholar 

  2. H. Moulin, Axioms of Cooperative Decision Making (Cambridge Univ. Press, Cambridge, 2013).

    MATH  Google Scholar 

  3. H. P. Young, “Condorcet’s theory of voting,” Am. Polit. Sci. Rev., No. 82, 1231–1244 (1988).

  4. A. B. Petrovsky, Decision Theory (Akademiya, Moscow, 2009) [in Russian].

    Google Scholar 

  5. V. N. Nefedov, V. A. Osipova, C. O. Smerchinskaya, and N. P. Yashina, “Non-contradictory aggregations of relations of strict order,” Russ. Math. (Iz. VUZ) 62 (5), 61–73 (2018).

  6. B. G. Litvak, Expert Information: Methods of Obtaining and Analyzing (Radio Svyaz’, Moscow, 1982) [in Russian].

    Google Scholar 

  7. V. P. Korneenko, Methods of Multi-Criteria Evaluation of Objects with a Multi-Level Structure of Performance Indicators (MAKS Press, Moscow, 2018) [in Russian].

    Google Scholar 

  8. W. D. Cook, “Distance-based and ad hoc consensus models in ordinal preference ranking,” Eur. J. Operat. Res., No. 172, 369–385 (2006).

  9. V. N. Nefedov, “Some properties of a linearly ordered median for an odd number of linear asymmetric ratios,” Available from VINITI No. 62–B2021 (2021).

  10. V. N. Nefedov, Discrete Optimization Problems (MAI, Moscow, 1993) [in Russian].

Download references

Author information

Authors and Affiliations

  1. Moscow Aviation Institute (National Research University), 125080, Moscow, Russia

    V. N. Nefedov & V. A. Osipova

Authors
  1. V. N. Nefedov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. A. Osipova
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to V. N. Nefedov or V. A. Osipova.

Ethics declarations

The authors declare that they have no conflicts interest.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Nefedov, V.N., Osipova, V.A. Consolidation of Individual Rankings by the Method of Branches And Bounds. J. Comput. Syst. Sci. Int. 61, 981–989 (2022). https://doi.org/10.1134/S1064230722060144

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S1064230722060144

Search

Navigation