Committee selection under weight constraints

DOI10.1016/j.mathsocsci.2011.11.006zbMath1247.91052OpenAlexW3123429499WikidataQ61638300 ScholiaQ61638300MaRDI QIDQ449043

Christian Klamler, Ulrich Pferschy, Stefan Ruzika

Publication date: 11 September 2012

Published in: Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mathsocsci.2011.11.006

Mathematics Subject Classification ID

Decision theory (91B06) Voting theory (91B12) Social choice (91B14)

Related Items

How hard is it to tell which is a Condorcet committee?

Uses Software

• Knapsack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximizing the minimum voter satisfaction on spanning trees
• An axiomatic characterization of the lexicographic maximin extension of an ordering over a set to the power set
• A note on maximizing the minimum voter satisfaction on spanning trees
• Approximation algorithms for knapsack problems with cardinality constraints
• The traveling group problem
• Finding socially best spanning treesî
• Voting by committees under constraints
• Committee Selection with a Weight Constraint Based on Lexicographic Rankings of Individuals
• Basic Geometry of Voting