As a guest user you are not logged in or recognized by your IP address. You have
access to the Front Matter, Abstracts, Author Index, Subject Index and the full
text of Open Access publications.
We study committee selection with multimodal preferences: Assuming a set of candidates A, 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.