Abstract
This paper presents a method for solving discrete choice problems characterized by multiple evaluative criteria. The proposed method, known as MAPPAC, is based on a pairwise comparison of alternatives relative to each pair of criteria, defining the two relations P (preference) and I (indifference), which constitute a complete preorder. Moreover, by aggregating these preferences, it is possible to obtain a variety of relations on a set of feasible actions.
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.
