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

A stricter canon: General Luce models for arbitrary menu sets

Author

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

Abstract

Alós-Ferrer and Mihm (2025, Corollary 1) recently provided a characterisation the classical Luce model (Luce, 1959) when choices are observed for an arbitrarily restricted collection of menus, as is typical in experimental settings or when working with field data. They also characterise the general Luce model (ibid., Theorem 1), which allows choice probabilities to be zero, for the same setting. The latter characterisation involves a single axiom – the general product rule (GPR). An important special case of the general Luce model is obtained when the mapping from menus to the support of choice probabilities can be rationalised by a weak order. Cerreia-Vioglio et al. (2021) show that this special case is characterised by Luce’s (1959) choice axiom, provided choice is observed for all possible (finite) menus. The choice axiom is thus a fundamental “canon of probabilistic rationality”. We show that a natural – and surprisingly simple – strengthening of the GPR characterises the model of Cerreia-Vioglio et al. (2021) when the menu set is arbitrarily restricted. Our axiom implies the choice axiom, and is therefore a “stricter canon”.

Suggested Citation

  • Rodrigues-Neto, José A. & Ryan, Matthew & Taylor, James, 2025. "A stricter canon: General Luce models for arbitrary menu sets," Mathematical Social Sciences, Elsevier, vol. 136(C).
    • Handle: RePEc:eee:matsoc:v:136:y:2025:i:c:s0165489625000460
    DOI: 10.1016/j.mathsocsci.2025.102431
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0165489625000460
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.mathsocsci.2025.102431?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:matsoc:v:136:y:2025:i:c:s0165489625000460. 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/inca/505565 .

    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.