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

Majority Rule Under Transitivity Constraints

Author

Listed:
  • V. J. Bowman

    (Carnegie-Mellon University and The University of Pittsburgh)

  • C. S. Colantoni

    (Carnegie-Mellon University)

Abstract

In this paper we are concerned with imposing constraints directly on the admissible majority decisions so as to insure transitivity without restricting individual preference orderings. We demonstrate that this corresponds to requiring that majority decisions be confined to the extreme points of a convex polyhedron. Thus, transitive majority decisions can be characterized as basic solutions of a set of linear inequalities. Through the use of a majority decision function (which is not restricted to be linear) it is shown that constrained majority rule is equivalent to an integer programming problem. Some special forms of majority decision functions are studied including the generalized l p norm and an indicator function. Implications of an integer programming solution, including alternate optima and post optimality analysis, are also discussed.

Suggested Citation

  • V. J. Bowman & C. S. Colantoni, 1973. "Majority Rule Under Transitivity Constraints," Management Science, INFORMS, vol. 19(9), pages 1029-1041, May.
    • Handle: RePEc:inm:ormnsc:v:19:y:1973:i:9:p:1029-1041
    DOI: 10.1287/mnsc.19.9.1029
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.19.9.1029
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.19.9.1029?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. Alfonso D'errico, 1994. "Una funzione ordinale di benessere sociale," Decisions in Economics and Finance, Springer;Associazione per la Matematica, vol. 17(1), pages 19-33, March.
    2. Michael J. Brusco & Douglas Steinley & Ashley L. Watts, 2022. "Disentangling relationships in symptom networks using matrix permutation methods," Psychometrika, Springer;The Psychometric Society, vol. 87(1), pages 133-155, March.
    3. Irène Charon & Olivier Hudry, 2010. "An updated survey on the linear ordering problem for weighted or unweighted tournaments," Annals of Operations Research, Springer, vol. 175(1), pages 107-158, March.
    4. Akram Dehnokhalaji & Pekka J. Korhonen & Murat Köksalan & Nasim Nasrabadi & Diclehan Tezcaner Öztürk & Jyrki Wallenius, 2014. "Constructing a strict total order for alternatives characterized by multiple criteria: An extension," Naval Research Logistics (NRL), John Wiley & Sons, vol. 61(2), pages 155-163, March.
    5. Akram Dehnokhalaji & Behjat Hallaji & Narges Soltani & Jafar Sadeghi, 2017. "Convex cone-based ranking of decision-making units in DEA," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(3), pages 861-880, July.
    6. 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.
    7. 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.
    8. Michael Brusco & Hans-Friedrich Köhn & Stephanie Stahl, 2008. "Heuristic Implementation of Dynamic Programming for Matrix Permutation Problems in Combinatorial Data Analysis," Psychometrika, Springer;The Psychometric Society, vol. 73(3), pages 503-522, September.

    More about this item

    Statistics

    Access and download statistics

    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:19:y:1973:i:9:p:1029-1041. 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.