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

Majority Decisions and Transitivity: Some Special Cases

Author

Listed:
  • Deepak K. Merchant

    (University of Rochester)

  • M. R. Rao

    (University of Rochester)

Abstract

The problem considered is that of obtaining majority decisions which are transitive. We show that the corresponding optimization problems for the weighted l 1 norm and the weighted l 2 norm are identical. We then show that she general problem of minimizing the weighted l k norm can be equivalently formulated as a set covering problem. Finally, we identify the Tchebycheff problem (l 2 norm) with a class, of bottleneck quadratic assignment problems and give an efficient algorithm for solving it.

Suggested Citation

  • Deepak K. Merchant & M. R. Rao, 1976. "Majority Decisions and Transitivity: Some Special Cases," Management Science, INFORMS, vol. 23(2), pages 125-130, October.
    • Handle: RePEc:inm:ormnsc:v:23:y:1976:i:2:p:125-130
    DOI: 10.1287/mnsc.23.2.125
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.23.2.125
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.23.2.125?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. 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.

    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:23:y:1976:i:2:p:125-130. 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.