IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2212.13449.html
   My bibliography  Save this paper

Self-progressive choice models

Author

Listed:
  • Kemal Yildiz

Abstract

Consider a population of heterogenous agents whose choice behaviors are partially \textit{comparable} according to a given \textit{primitive ordering}.The set of choice functions admissible in the population specifies a \textit{choice model}. As a criterion to guide the model selection process, we propose \textit{self-progressiveness}, ensuring that each aggregate choice behavior explained by the model has a unique orderly representation within the model itself. We establish an equivalence between self-progressive choice models and well-known algebraic structures called \textit{lattices}. This equivalence provides for a precise recipe to restrict or extend any choice model for unique orderly representation. Following this recipe, we identify the set of choice functions that are essential for the unique orderly representation of random utility functions. This extended model offers an intuitive explanation for the \textit{choice overload} phenomena. We provide the necessary and sufficient conditions for identifying the underlying primitive ordering.

Suggested Citation

  • Kemal Yildiz, 2022. "Self-progressive choice models," Papers 2212.13449, arXiv.org, revised Oct 2024.
    • Handle: RePEc:arx:papers:2212.13449
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2212.13449
    File Function: Latest version
    Download Restriction: no
    ---><---

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:arx:papers:2212.13449. 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: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    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.