IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v32y1986i8p1007-1014.html
   My bibliography  Save this article

A Generalized Network Formulation of the Pairwise Comparison Consensus Ranking Model

Author

Listed:
  • Jonathan Barzilai

    (Department of Business Administration, Dalhousie University, Halifax, Nova Scotia, Canada)

  • Wade D. Cook

    (Faculty of Administrative Studies, York University, Toronto, Ontario, Canada)

  • Moshe Kress

    (CEMA, P.O. Box 2250, Haifa, Israel)

Abstract

One of the best known and most widely referenced models for representing ordinal preferences is that due to Kemeny and Snell (Kemeny, J. G., L. J. Snell. 1962. Preference ranking: an axiomatic approach. Mathematical Models in the Social Sciences. Glnn, New York, 9--23.). This model is designed to accommodate pairwise comparison data with an l 1 norm used to measure voter disagreement. While this model possesses many of the necessary properties for a social choice function, solution procedures developed to date have been capable of handling only small problems due to the difficulty of modelling the transitivity requirements of an optimal consensus ranking. This paper shows how the consensus formation problem for strict linear orderings can be modelled as a generalized network. Since efficient computer codes already exist for handling this special structure, this approach will permit the solution of much larger problems than has been the case previously.

Suggested Citation

  • Jonathan Barzilai & Wade D. Cook & Moshe Kress, 1986. "A Generalized Network Formulation of the Pairwise Comparison Consensus Ranking Model," Management Science, INFORMS, vol. 32(8), pages 1007-1014, August.
    • Handle: RePEc:inm:ormnsc:v:32:y:1986:i:8:p:1007-1014
    DOI: 10.1287/mnsc.32.8.1007
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.32.8.1007
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.32.8.1007?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Kelin Luo & Yinfeng Xu & Bowen Zhang & Huili Zhang, 2018. "Creating an acceptable consensus ranking for group decision making," Journal of Combinatorial Optimization, Springer, vol. 36(1), pages 307-328, July.
    2. Tavana, M. & Kennedy, D. T. & Joglekar, P., 1996. "A group decision support framework for consensus ranking of technical manager candidates," Omega, Elsevier, vol. 24(5), pages 523-538, October.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:32:y:1986:i:8:p:1007-1014. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.