IDEAS home Printed from https://ideas.repec.org/a/nov/artigo/v14y2004i1p111-120.html
   My bibliography  Save this article

The class of opportunity filters and the preference revealed by a path independent choice function

Author

Listed:
  • Somdeb Lahiri

    (University of Witwatersrand at Johannesburg)

Abstract

The purpose of this paper is to replicate the theory developed by Gekker (2001), without using any monotonicity assumption. We however retain a non-triviality assumption implicit in Gekker (2001), which says that there is at least one opportunity set which is preferred to the no-choice situation. In addition we require our preference relation on opportunity sets to be transitive (as in Gekker (2001), reflexive and satisfy an assumption called minimal comparability, which requires every opportunity set to be comparable with the null set. We also show that there exists a preference relation on the power set of the set of alternatives, revealed by a path independent choice function, which satisfies all the properties that we require of a binary relation to satisfy on the power set of the set of alternatives.

Suggested Citation

  • Somdeb Lahiri, 2004. "The class of opportunity filters and the preference revealed by a path independent choice function," Nova Economia, Economics Department, Universidade Federal de Minas Gerais (Brazil), vol. 14(1), pages 111-120, January-A.
  • Handle: RePEc:nov:artigo:v:14:y:2004:i:1:p:111-120
    as

    Download full text from publisher

    File URL: http://www.face.ufmg.br/novaeconomia/sumarios/v14n1/Lahiri.pdf
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    opportunity filters; preference relations; choice functions; path independence;
    All these keywords.

    JEL classification:

    • C79 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Other
    • D71 - Microeconomics - - Analysis of Collective Decision-Making - - - Social Choice; Clubs; Committees; Associations

    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:nov:artigo:v:14:y:2004:i:1:p:111-120. 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: Lucas Resende de Carvalho (email available below). General contact details of provider: https://edirc.repec.org/data/fufmgbr.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.