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

Some Solutions for Abstract Games: Axiomatic Characterisations

Author

Listed:
  • Lahiri Somdeb

Abstract

In this paper we consider binary relations which are reflexive and complete. Such binary relations are referred to in the literature as abstract games. Given an abstract game a (game) solution is a function which associates to each subset a non-empty collection of points of the subset. An important consequence of this framework is that often, a set may fail to have an element which is best with respect to the given binary relation. To circumvent this problem the concept of the top cycle set is introduced, which selects from among the feasible alternatives only those which are best with respect to the transitive closure of the given relation. The top cycle set is always non-empty and in this paper we provide an axiomatic characterization of the top-cycle solution. It is subsequently observed that the top cycle solution is the coarsest solution which satisfies two innocuous assumptions. In the final section of this paper we address the problem of axiomatically characterizing the uncovered solution (where ‘covering’ is now defined as a ‘menu-based’ concept).

Suggested Citation

  • Lahiri Somdeb, 2000. "Some Solutions for Abstract Games: Axiomatic Characterisations," IIMA Working Papers WP2000-06-03, Indian Institute of Management Ahmedabad, Research and Publication Department.
  • Handle: RePEc:iim:iimawp:wp01684
    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:wp01684. 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.