On Capacity-Filling and Substitutable Choice Rules

Battal Dogan, Serhat Doğan () and Kemal Yildiz
Additional contact information
Serhat Doğan: Department of Economics, Bilkent University, Bilkent, Ankara 06800, Turkey

Mathematics of Operations Research, 2021, vol. 46, issue 3, 856-868

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.

Keywords: Primary: 91B68; secondary: 05C70; Primary: utility/preference: theory; secondary: mathematics: combinatorics; choice rules; capacity-filling; substitutability; path independence; prime atom (search for similar items in EconPapers)
Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/moor.2021.1128 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormoor:v:46:y:2021:i:3:p:856-868

Access Statistics for this article

More articles in Mathematics of Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().