In the committee selection problem, we are given m candidates, and n voters. Candidates can have different weights. A committee is a subset of candidates, and its weight is the sum of weights of its candidates.
Oct 30, 2019
Jun 22, 2020 · We study a general notion of group fairness via stability: A committee of given total weight K is stable if no coalition of voters can deviate ...
Theorem. There always exists a 32-approximately stable committee. S ⊆ C with w(S) ≤ n. This was previously only known for select special cases. The proof will ...
A committee is a subset of candidates, and its weight is the sum of weights of its candidates. Each voter expresses an ordinal ranking over all possible ...
People also ask
What is the meaning of committee selection?
Who should be on a selection committee?
In the committee selection problem, we are given $m$ candidates, and $n$ voters. Candidates can have different weights. A committee is a subset of candidates, ...
Duration: 21:25
Posted: Jun 14, 2020
Posted: Jun 14, 2020
May 13, 2020 · We talk about fairness in the committee selection problem. We consider a general notion of fairness via stability: A committee is stable if ...
The core provides a strong notion of fairness, subsuming other notions that have been widely studied in computational social choice. It is well-known that an ...
May 11, 2019 · In this paper, we study fairness in committee selection problems. We consider a general notion of fairness via stability: A committee is stable ...
The notion of fairness we adopt is that of core stability from cooperative game theory: No subset of voters should be able to choose another blocking committee ...