Mathematical Programming formulations for the efficient solution of the k-sum approval voting problem
In this paper we address the problem of electing a committee among a set of m candidates on the basis of the preferences of a set of n voters. We consider the approval voting method in which each voter can approve as many candidates as he likes by expressing a preference profile (boolean m -vector). In order to elect a committee, a voting rule must be established to ‘transform’ the n voters’ profiles into a winning committee.