Abstract
Given a large number (notationallym) of users’ (members or voters) preferences as inputs over a large number of items or candidates (notationally n), preference queries leverage different preference aggregation methods to aggregate individual preferences in a systematic manner and come up with a single output (either a complete order or top-k, ordered or unordered) that is most representative of the users’ preferences. The goal of this 1.5 hour lecture style tutorial is to adapt different preference aggregation methods from social choice theories, summarize how existing research has handled fairness over these methods, identify their limitations, and outline new research directions.
Original language | English |
---|---|
Pages (from-to) | 4225-4228 |
Number of pages | 4 |
Journal | Proceedings of the VLDB Endowment |
Volume | 17 |
Issue number | 12 |
DOIs | |
State | Published - 1 Jan 2024 |
Event | 50th International Conference on Very Large Data Bases, VLDB 2024 - Guangzhou, China Duration: 24 Aug 2024 → 29 Aug 2024 |
ASJC Scopus subject areas
- Computer Science (miscellaneous)
- General Computer Science