Home /  Workshop /  Schedules /  Fairness in Algorithmic Decisions via Social Choice

Fairness in Algorithmic Decisions via Social Choice

Randomization, Neutrality, and Fairness October 23, 2023 - October 27, 2023

October 24, 2023 (01:30 PM PDT - 02:30 PM PDT)
Speaker(s): Nisarg Shah (University of Toronto)
Location: SLMath: Eisenbud Auditorium, Online/Virtual
Tags/Keywords
  • fair resource allocation

  • best of both worlds

  • randomization

  • envy-freeness

Primary Mathematics Subject Classification
Secondary Mathematics Subject Classification
Video

Fairness in Algorithmic Decisions via Social Choice

Abstract

As algorithms and AI models are increasingly used to augment, or even replace, traditional human decision-making, there is a growing interest in ensuring that they treat (groups of) people fairly. While fairness is a relatively new design criterion in many areas of algorithmic decision-making (e.g., machine learning), it has a long history of study in social choice theory from microeconomics. In this talk, I will first survey some of the recent advances that boost fairness guarantees in traditional economic problems such as resource allocation, and then show how these can be adapted to many other decision-making paradigms ranging from classification and clustering to recommender systems and conference peer review.

 

Supplements No Notes/Supplements Uploaded
Video/Audio Files

Fairness in Algorithmic Decisions via Social Choice

Troubles with video?

Please report video problems to itsupport@slmath.org.

See more of our Streaming videos on our main VMath Videos page.