IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2608.16708.html

Quantile restrictions, revealed rankings, and the limits of multinomial choice

Author

Listed:
  • Tatiana Komarova

Abstract

This paper analyzes when choice probabilities reveal rankings of deterministic utility indices in semiparametric discrete choice models. It begins with binary choice, where quantile thresholds guarantee ranking recovery, and shows that such thresholds can arise either from behavioral departures from utility maximization (e.g., limited attention) under exchangeable unobservables, or from non-exchangeable unobservables under standard utility maximization. These behavioral and distributional routes are then extended to multinomial choice. Under limited attention, balance restrictions on attention probabilities yield global linear ranking partitions which are robust to the distribution of unobservables and, given sufficiently rich joint variation in the differences of utility indices, are also necessary. Absent the required attention restrictions, opposite rankings can produce overlapping probability images. Under non-exchangeable unobservables, a comparable distribution-uniform partition generally need not exist. Holding the distribution fixed, however, ranking recovery remains possible via an injective nonlinear map from normalized utility differences to choice probabilities under both behavioral and distributional extensions. Together, the results distinguish distribution-robust global ranking partitions from ranking recovery with a fixed distribution of unobservables and clarify the limits of extending binary quantile restrictions to multinomial choice.

Suggested Citation

  • Tatiana Komarova, 2026. "Quantile restrictions, revealed rankings, and the limits of multinomial choice," Papers 2608.16708, arXiv.org.
  • Handle: RePEc:arx:papers:2608.16708
    as

    Download full text from publisher

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

    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:arx:papers:2608.16708. 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: https://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.