Efficiently finding committees satisfying justified representation and Pareto optimality
Statement
Given an approval profile and a target committee size , determine whether there exists a polynomial-time algorithm that outputs a committee of size satisfying both justified representation and Pareto optimality for every such profile. The cited preprint claims that, on the domain of all approval profiles, computing such a committee is NP-hard.
Record
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.