DeepAI AI Chat
Log In Sign Up

Computing and Testing Pareto Optimal Committees

by   Haris Aziz, et al.
Université Paris-Dauphine

Selecting a set of alternatives based on the preferences of agents is an important problem in committee selection and beyond. Among the various criteria put forth for the desirability of a committee, Pareto optimality is a minimal and important requirement. As asking agents to specify their preferences over exponentially many subsets of alternatives is practically infeasible, we assume that each agent specifies a weak order on single alternatives, from which a preference relation over subsets is derived using some preference extension. We consider five prominent extensions (responsive, downward lexicographic, upward lexicographic, best, and worst). For each of them, we consider the corresponding Pareto optimality notion, and we study the complexity of computing and verifying Pareto optimal outcomes. We also consider strategic issues: for four of the set extensions, we present a linear-time, Pareto optimal and strategyproof algorithm that even works for weak preferences.


page 1

page 2

page 3

page 4


On the Indecisiveness of Kelly-Strategyproof Social Choice Functions

Social choice functions (SCFs) map the preferences of a group of agents ...

Pareto optimal coalitions of fixed size

We tackle the problem of partitioning players into groups of fixed size,...

Fairness and Efficiency in Cake-Cutting with Single-Peaked Preferences

We study the cake-cutting problem when agents have single-peaked prefere...

Pareto Optimality and Strategy Proofness in Group Argument Evaluation (Extended Version)

An inconsistent knowledge base can be abstracted as a set of arguments a...

Generic Preferences over Subsets of Structured Objects

Various tasks in decision making and decision support systems require se...

Can we reach Pareto optimal outcomes using bottom-up approaches?

Traditionally, researchers in decision making have focused on attempting...

Cautious Learning of Multiattribute Preferences

This paper is dedicated to a cautious learning methodology for predictin...