Committee selection under weight constraints

Christian Klamler, Ulrich Pferschy and Stefan Ruzika

Mathematical Social Sciences, 2012, vol. 64, issue 1, 48-56

Abstract: In this paper we investigate the problem of selecting a committee consisting of k members from a list of m candidates. Each candidate has a certain cost or weight. The choice of the k-committee has to satisfy some budget or weight constraint: the sum of the weights of all committee members must not exceed a given value W. While the former part of the problem is a typical question in Social Choice Theory, the latter stems from Operations Research. The purpose of this paper is to link these two research fields: we first characterize reasonable ways of ranking sets of objects, i.e., candidates, and then develop efficient algorithms for the actual computation of optimal committees.

Date: 2012
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0165489611001272
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matsoc:v:64:y:2012:i:1:p:48-56

DOI: 10.1016/j.mathsocsci.2011.11.006

Access Statistics for this article

Mathematical Social Sciences is currently edited by J.-F. Laslier

More articles in Mathematical Social Sciences from Elsevier
Bibliographic data for series maintained by Catherine Liu ().