IDEAS home Printed from https://ideas.repec.org/a/eee/mateco/v117y2025ics0304406825000114.html
   My bibliography  Save this article

Cycle conditions for “Luce rationality”

Author

Listed:
  • Rodrigues-Neto, José A.
  • Ryan, Matthew
  • Taylor, James

Abstract

We extend and refine conditions for “Luce rationality” (i.e., the existence of a Luce – or logit – model) in the context of stochastic choice. When choice probabilities satisfy positivity, the cyclical independence (CI) condition of Ahumada and Ülkü (2018) and Echenique and Saito (2019) is necessary and sufficient for Luce rationality, even if choice is only observed for a restricted set of menus. We adapt results from the cycles approach (Rodrigues-Neto, 2009) to the common prior problem Harsanyi (1967–1968) to refine the CI condition, by reducing the number of cycle equations that need to be checked. A general algorithm is provided to identify a minimal sufficient set of equations. Three cases are discussed in detail: (i) when choice is only observed from binary menus, (ii) when all menus contain a common default; and (iii) when all menus contain an element from a common binary default set. Investigation of case (i) leads to a refinement of the famous product rule.

Suggested Citation

  • Rodrigues-Neto, José A. & Ryan, Matthew & Taylor, James, 2025. "Cycle conditions for “Luce rationality”," Journal of Mathematical Economics, Elsevier, vol. 117(C).
    • Handle: RePEc:eee:mateco:v:117:y:2025:i:c:s0304406825000114
    DOI: 10.1016/j.jmateco.2025.103094
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0304406825000114
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.jmateco.2025.103094?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:eee:mateco:v:117:y:2025:i:c:s0304406825000114. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/jmateco .

    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.