Abstract
Decomposition of choice functions into some choice functions rationalizable by linear orders, and ordinal representaion of closure operators are two concepts independently developed in the literature. Koshevoy (1999) defined a map which is a correspondence between path independent choice functions and anti-exchange closure operators. In this study the Koshevoy map is redefined for some special cases of classically rationalizable choice functions. For these cases, the width concept in the decomposition of choice functions, introduced by Aleskerov et al. (1979), and the structure of joint irreducible sets in ordinal representation of closure operators, studied by Monjardet and Raderanirina (1999), are combined.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
