ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Given an approval profile PP and a target committee size kk, determine whether there exists a polynomial-time algorithm that outputs a committee WW of size kk 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
Links

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.