How hard is it to tell which is a Condorcet committee?
From MaRDI portal
Publication:459394
DOI10.1016/j.mathsocsci.2013.06.004zbMath1296.91100OpenAlexW2015589916WikidataQ41113477 ScholiaQ41113477MaRDI QIDQ459394
Publication date: 8 October 2014
Published in: Mathematical Social Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.mathsocsci.2013.06.004
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Social choice (91B14)
Related Items (6)
On stable rules for selecting committees ⋮ A social choice approach to ordinal group activity selection ⋮ It is difficult to tell if there is a Condorcet spanning tree ⋮ Gehrlein stable committee with multi-modal preferences ⋮ Coincidence of Condorcet committees ⋮ Aggregation over Metric Spaces: Proposing and Voting in Elections, Budgeting, and Legislation
Cites Work
- Unnamed Item
- Taking the final step to a full dichotomy of the possible winner problem in pure scoring rules
- Committee selection under weight constraints
- Maximizing the minimum voter satisfaction on spanning trees
- A note on maximizing the minimum voter satisfaction on spanning trees
- The Condorcet criterion and committee selection
- Voting schemes for which it can be difficult to tell who won the election
- Characterizations of the plurality function
- Yes-no voting
- Towards a dichotomy for the possible winner problem in elections based on scoring rules
- Handbook of social choice and welfare. Vol. 1.
- On the complexity of achieving proportional representation
- Sets of alternatives as Condorcet winners
- Committee Selection with a Weight Constraint Based on a Pairwise Dominance Relation
- An Analysis of Simple Voting Systems for Electing Committees
- Condorcet Social Choice Functions
- The Rectilinear Steiner Tree Problem is $NP$-Complete
This page was built for publication: How hard is it to tell which is a Condorcet committee?
