On capacity-filling and substitutable choice rules

buir.contributor.authorYıldız, Kemal
buir.contributor.authorDoğan, Serhat
buir.contributor.orcidDoğan, Serhat|0000-0002-0848-8130
buir.contributor.orcidYıldız, Kemal|0000-0003-4352-3197
dc.citation.epage868en_US
dc.citation.issueNumber3en_US
dc.citation.spage856en_US
dc.citation.volumeNumber46en_US
dc.contributor.authorDoğan, Battal
dc.contributor.authorDoğan, Serhat
dc.contributor.authorYıldız, Kemal
dc.date.accessioned2022-02-14T13:23:33Z
dc.date.available2022-02-14T13:23:33Z
dc.date.issued2021-08
dc.departmentDepartment of Economicsen_US
dc.description.abstractEach 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.en_US
dc.description.provenanceSubmitted by Türkan Cesur (cturkan@bilkent.edu.tr) on 2022-02-14T13:23:33Z No. of bitstreams: 1 On_Capacity-Filling_and_Substitutable_Choice_Rules.pdf: 937838 bytes, checksum: c4bb0675422aac87d12b00932cba1165 (MD5)en
dc.description.provenanceMade available in DSpace on 2022-02-14T13:23:33Z (GMT). No. of bitstreams: 1 On_Capacity-Filling_and_Substitutable_Choice_Rules.pdf: 937838 bytes, checksum: c4bb0675422aac87d12b00932cba1165 (MD5) Previous issue date: 2021-08en
dc.identifier.doi10.1287/moor.2021.1128en_US
dc.identifier.eissn1526-5471
dc.identifier.issn0364-765X
dc.identifier.urihttp://hdl.handle.net/11693/77333
dc.language.isoEnglishen_US
dc.publisherInstitute for Operations Research and the Management Sciences (INFORMS)en_US
dc.relation.isversionofhttps://doi.org/10.1287/moor.2021.1128en_US
dc.source.titleMathematics of Operations Researchen_US
dc.subjectChoice rulesen_US
dc.subjectCapacity-fillingen_US
dc.subjectSubstitutabilityen_US
dc.subjectPath independenceen_US
dc.subjectPrime atomen_US
dc.titleOn capacity-filling and substitutable choice rulesen_US
dc.typeArticleen_US

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
On_Capacity-Filling_and_Substitutable_Choice_Rules.pdf
Size:
915.86 KB
Format:
Adobe Portable Document Format
Description:

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.69 KB
Format:
Item-specific license agreed upon to submission
Description: