Committee selection with multimodal preferences
Pallavi Jain,Nimrod Talmon +1 more
- Vol. 325, pp 123-130
Reads0
Chats0
TLDR
This work designs efficient algorithms for certain cases of committee selection with multimodal preferences and discusses applications of the model and the computational complexity of several generalizations of known committee scoring rules to this setting.Abstract:
We study committee selection with multimodal preferences: Assuming a set of candidatesA, a set of voters V , and ` layers, where each voter v ∈ V has ordinal preferences over the alternatives for each layer separately, the task is to select a committee S ⊆ A of size k. We discuss applications of our model and study the computational complexity of several generalizations of known committee scoring rules (specifically, k-Borda and Chamberlin–Courant) to our setting, as well as discuss domain restrictions for our model. While most problems we encounter are computationally intractable in general, we nevertheless design efficient algorithms for certain cases.read more
Citations
More filters
Proceedings ArticleDOI
Position-Based Matching with Multi-Modal Preferences
TL;DR: In this article , the authors introduce three position-based matching models, which minimize the "dissatisfaction score", which measures matchings from different perspectives, and present diverse complexity results for these three models, among others, polynomial-time solvability for the first model.
Proceedings ArticleDOI
Stable Matching with Multilayer Approval Preferences: Approvals can be Harder than Strict Preferences
TL;DR: In this paper , the complexity of stable matching problems with multilayer approval preferences was studied and eleven stability notions derived from three well-established stability notions for stable matchings with ties and four adaptions proposed by Chen et al.
Proceedings ArticleDOI
Distortion in Attribute Approval Committee Elections
Dorothea Baumeister,Linus Boes +1 more
TL;DR: In this article , the distortion in attribute approval committee elections is studied, where each candidate satisfies a variety of attributes in different categories (e.g., academic degree, work experience, lo-cation).
Journal ArticleDOI
Multi-votes Election Control by Selecting Rules
Aizhong Zhou,Jianliang Xu +1 more
TL;DR: In this paper , the authors considered a new model of election control that by assigning different rules to the votes from different layers, makes the special candidate p being the winner of the election (a rule can be assigned to different layers).
References
More filters
Journal ArticleDOI
Multi-attribute proportional representation
Jérôme Lang,Piotr Skowron +1 more
TL;DR: In this article, the authors consider the problem of selecting a set of items from a predefined set of attributes, where each item is described by a vector of attributes and for each attribute there is a desired distribution that the selected set should have.
Proceedings Article
Preference restrictions in computational social choice: recent progress
TL;DR: An overview of recent progress in understanding and exploiting useful properties of restricted preference domains, such as, e.g., the domains of single-peaked, single-crossing and 1-Euclidean preferences is provided.
Proceedings ArticleDOI
Multiwinner Rules on Paths From k-Borda to Chamberlin-Courant.
TL;DR: This work explores continuous transitions from k-Borda to Chamberlin-Courant and study intermediate rules, which represent two extremes of the multiwinner world.
Proceedings ArticleDOI
Achieving Fully Proportional Representation by Clustering Voters
TL;DR: Using ideas from cluster analysis, several approximation algorithms for the Chamberlin–Courant and Monroe rules are developed and found to be computationally efficient and able to provide solutions which are very close to optimal.
Journal ArticleDOI
Committee Scoring Rules: Axiomatic Characterization and Hierarchy
TL;DR: In this article, the authors identify several natural subclasses of committee scoring rules, namely, weakly separable, representation-focused, top-k-counting, OWA-based, and decomposable rules.