English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Fairness in multiwinner elections, a growing line of research incomputational social choice, primarily concerns the use of constraints toensure fairness. Recent work proposed a model to find a diverse \emph{and}representative committee and studied the model's computational aspects.However, the work gave complexity results under major assumptions on how thecandidates and the voters are grouped. Here, we close this gap and classify thecomplexity of finding a diverse and representative committee using a monotone,separable positional multiwinner voting rule, conditioned \emph{only} on theassumption that P $\neq$ NP.

On the Complexity of Finding a Diverse and Representative Committee using a Monotone, Separable Positional Multiwinner Voting Rule