DeepAI AI Chat
Log In Sign Up

A Rule for Committee Selection with Soft Diversity Constraints

03/30/2018
by   Haris Aziz, et al.
UNSW
0

Committee selection with diversity or distributional constraints is a ubiquitous problem. However, many of the formal approaches proposed so far have certain drawbacks including (1) computationally intractability in general, and (2) inability to suggest a solution for certain instances where the hard constraints cannot be met. We propose a practical and polynomial-time algorithm for diverse committee selection that draws on the idea of using soft bounds and satisfies natural axioms.

READ FULL TEXT

page 1

page 2

page 3

page 4

02/19/2023

Matching Algorithms under Diversity-Based Reservations

Selection under category or diversity constraints is a ubiquitous and wi...
06/07/2017

Imposing Hard Constraints on Deep Networks: Promises and Limitations

Imposing constraints on the output of a Deep Neural Net is one way to im...
08/06/2020

A general solution to the preferential selection model

We provide a general analytic solution to Herbert Simon's 1955 model for...
06/30/2011

A Maximal Tractable Class of Soft Constraints

Many researchers in artificial intelligence are beginning to explore the...
11/17/2017

Multiwinner Elections with Diversity Constraints

We develop a model of multiwinner elections that combines performance-ba...
01/16/2014

Soft Constraints of Difference and Equality

In many combinatorial problems one may need to model the diversity or si...
12/29/2022

PCCC: The Pairwise-Confidence-Constraints-Clustering Algorithm

We consider a semi-supervised k-clustering problem where information is ...