[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
IDEAS home Printed from https://ideas.repec.org/p/iim/iimawp/wp01607.html
   My bibliography  Save this paper

A Note on Numerical Representations of Quasi-Transitive Binary Relations

Author

Listed:
  • Lahiri Somdeb
Abstract
A Binary relation is said to be quasi-transitive if its asymmetric part is transitive. A binary relation is said to be a weak-order if it is reflexive, complete and transitive. One may refer to Frensh [1986] for a synopsis of these and similar definitions. An easy consequence of the result in Donaldson and Weymark [1998], which states that, any binary relation which is reflexive, complete and quasi-transitive can be expressed as an intersection of weak orders, is the result (which for a finite domain may be traced back to Aizerman and Malishevsky [1981], [see Aizerman and Aleskerov [1995] as well]) that the asymmetric part of a quasi-transitive binary relation can be expressed as the intersection of the asymmetric parts of weak-orders. In this note we provide a new and an independent proof of this result (which is what we refer to as Theorem I in this note) considering its abiding importance in decision theory. We also, use our Theorem I to prove the well known result due to Dushnik and Miller [1941], which states that any asymmetric and transitive binary relation is the intersection of binary relations which are asymmetric, transitive and complete. Finally, we provide a new proof of the result due to Donaldson and Weymark [1998], mentioned. Our proof appears to be simpler than the one provided by them, and is established with the help of the Theorem due to Dushnik and Miller [1941].

Suggested Citation

  • Lahiri Somdeb, 1999. "A Note on Numerical Representations of Quasi-Transitive Binary Relations," IIMA Working Papers WP1999-06-05, Indian Institute of Management Ahmedabad, Research and Publication Department.
    • Handle: RePEc:iim:iimawp:wp01607
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:iim:iimawp:wp01607. 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: the person in charge (email available below). General contact details of provider: https://edirc.repec.org/data/eciimin.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.