Name
Abstract | ||
|---|---|---|
We consider the problem of committee selection from a fixed set of candidates where each candidate has multiple quantifiable attributes. Instead of voting for a candidate, a voter is allowed to approve the preferred attributes of a given candidate. Though attribute-based preferences capture several important real-life scenarios, committee selection problem with attribute approval of voters has not properly formalized or studied. We present a detailed study of axioms, rules, algorithms, and computational complexity for the setting. Apart from extending previous axioms and rules, we design two new algorithms that are especially appropriate for our model. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.5555/3463952.3464035 | AAMAS |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Venkateswara Rao Kagita | 1 | 59 | 8.13 |
| Arun K. Pujari | 2 | 420 | 48.20 |
| Vineet Padmanabhan | 3 | 216 | 25.90 |
| Haris Aziz | 4 | 624 | 76.06 |
| Vikas Kumar 0003 | 5 | 25 | 4.76 |