Главная
Study mode:
on
1
Intro
2
Committee Selection
3
Preference Model
4
Participatory Budgeting (Knapsack)
5
Clustering
6
Fairness / Stability
7
Fair Taxation
8
Bypass the Impossibility Result
9
Example of a Lottery
10
Approximate Stability
11
Existence of 2-Approximately Stable Lotteries
12
From Randomized to Deterministic
13
Properties of good committees
14
Recursion
15
Open Questions
Description:
Learn about the challenges and solutions in committee selection through this 21-minute ACM conference talk. Explore concepts like preference models, participatory budgeting, clustering, and fairness in the context of selecting stable committees. Dive into topics such as fair taxation, bypassing impossibility results, and the use of lotteries in selection processes. Examine the properties of good committees, including approximate stability and the existence of 2-approximately stable lotteries. Discover how to transition from randomized to deterministic selection methods, and understand the role of recursion in committee formation. Conclude by considering open questions in the field, providing a comprehensive overview of current research in approximately stable committee selection.

Approximately Stable Committee Selection

Association for Computing Machinery (ACM)
Add to list