IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v46y2021i3p856-868.html
   My bibliography  Save this article

On Capacity-Filling and Substitutable Choice Rules

Author

Listed:
  • Battal Doğan

    (Department of Economics, University of Bristol, Bristol BS8 1TL, United Kingdom)

  • Serhat Doğan

    (Department of Economics, Bilkent University, Bilkent, Ankara 06800, Turkey)

  • Kemal Yıldız

    (Department of Economics, Bilkent University, Bilkent, Ankara 06800, Turkey)

Abstract

Each capacity-filling and substitutable choice rule is known to have a maximizer-collecting representation: There exists a list of priority orderings such that from each choice set that includes more alternatives than the capacity, the choice is the union of the priority orderings’ maximizers. We introduce the notion of a critical set and constructively prove that the number of critical sets for a choice rule determines its smallest-size maximizer-collecting representation. We show that responsive choice rules require the maximal number of priority orderings in their smallest-size maximizer-collecting representations among all capacity-filling and substitutable choice rules. We also analyze maximizer-collecting choice rules in which the number of priority orderings equals the capacity. We show that if the capacity is greater than three and the number of alternatives exceeds the capacity by at least two, then no capacity-filling and substitutable choice rule has a maximizer-collecting representation of the size equal to the capacity.

Suggested Citation

  • Battal Doğan & Serhat Doğan & Kemal Yıldız, 2021. "On Capacity-Filling and Substitutable Choice Rules," Mathematics of Operations Research, INFORMS, vol. 46(3), pages 856-868, August.
    • Handle: RePEc:inm:ormoor:v:46:y:2021:i:3:p:856-868
    DOI: 10.1287/moor.2021.1128
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/moor.2021.1128
    Download Restriction: no
    File URL: https://libkey.io/10.1287/moor.2021.1128?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
    ---><---

    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:inm:ormoor:v:46:y:2021:i:3:p:856-868. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.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.