IDEAS home Printed from https://ideas.repec.org/p/iim/iimawp/wp01698.html
   My bibliography  Save this paper

The Lexicographic Composition of Abstract Games

Author

Listed:
  • Lahiri Somdeb

Abstract

Two stage selection procedures are quite common. Decisions arrived at on the basis of the composition of the binary relations in some form, is what is implemented in such two stage choice procedures. The resulting binary relation is referred to as a lexicographic composition of the individual binary relations. In this paper we begin by obtaining a necessary and sufficient condition for a quasi transitive binary relation to be transitive. Then we obtain necessary and sufficient conditions for the lexicographic composition of two quasi transitive binary relations to be quasi transitive. In passing it is noted that the lexicographic composition of two transitive binary relations is always transitive. Finally, we obtain conditions for the lexicographic composition of two binary relations to be acyclic. It is observed that if the second stage binary relation is acyclic, then the lexicographic composition is acyclic if and only if the first stage binary relation is. All our binary relations are assumed to be reflexive and complete. Such binary relations are called abstract games.

Suggested Citation

  • Lahiri Somdeb, 2000. "The Lexicographic Composition of Abstract Games," IIMA Working Papers WP2000-09-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
    • Handle: RePEc:iim:iimawp:wp01698
    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:wp01698. 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.