Abstract
Several authors have proposed a social choice function based upon distance-consensus between different committee rankings. Under this framework, the total absolute disagreement between committees is minimised. The purpose of this paper is to formulate the underlying optimisation problem as a goal programming (GP) model. To do this, the following three GP formulations are proposed: (a) a linear weighting GP model, where consensus is established by the minimisation of the weighted aggregated disagreement, (b) a MINMAX GP model, where the consensus is defined as the minimisation of the maximum disagreement and (c) an extended GP model, which subsumes the two previous formulations as particular cases.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.