Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Approximately Stable Committee Selection

Association for Computing Machinery (ACM) via YouTube

Overview

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.

Syllabus

Intro
Committee Selection
Preference Model
Participatory Budgeting (Knapsack)
Clustering
Fairness / Stability
Fair Taxation
Bypass the Impossibility Result
Example of a Lottery
Approximate Stability
Existence of 2-Approximately Stable Lotteries
From Randomized to Deterministic
Properties of good committees
Recursion
Open Questions

Taught by

Association for Computing Machinery (ACM)

Reviews

Start your review of Approximately Stable Committee Selection

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.