Algorithmic Challenges in Ensuring Fairness at the Time of Decision

Published on ● Video Link: https://www.youtube.com/watch?v=alULWMndXpU



Duration: 41:25
661 views
11


Swati Gupta (Georgia Institute of Technology)
https://simons.berkeley.edu/talks/algorithmic-challenges-ensuring-fairness-time-decision
Societal Considerations and Applications

Algorithmic decision-making in societal contexts, such as retail pricing, loan administration, recommendations on online platforms, etc., often involves experimentation with decisions for the sake of learning, which results in perceptions of unfairness among people impacted by these decisions. It is hence necessary to embed appropriate notions of fairness in such decision-making processes. The goal of this paper is to highlight the rich interface between temporal notions of fairness and online decision-making through a novel meta-objective of ensuring fairness at the time of decision. Given some arbitrary comparative fairness notion for static decision-making (e.g., students should pay at most 90% of the general adult price), a corresponding online decision-making algorithm satisfies fairness at the time of decision if the said notion of fairness is satisfied for any entity receiving a decision in comparison to all the past decisions. We show that this basic requirement introduces new methodological challenges in online decision-making. We illustrate the novel approaches necessary to address these challenges in the context of stochastic convex optimization with bandit feedback under a comparative fairness constraint that imposes lower bounds on the decisions received by entities depending on the decisions received by everyone in the past. The talk will showcase some novel research opportunities in online decision-making stemming from temporal fairness concerns. This is based on joint work with Vijay Kamble and Jad Salem.




Other Videos By Simons Institute for the Theory of Computing


2022-11-15Graphons and Graphexes as Models of Large Sparse Networks
2022-11-11Re-designing Recommendation on VolunteerMatch: Theory and Practice
2022-11-11Efficient and Targeted COVID-19 Border Testing via Reinforcement Learning
2022-11-10Unpacking the Black Box: Regulating Algorithmic Decisions
2022-11-10Decision-Aware Learning for Global Health Supply Chains
2022-11-10Supply-Side Equilibria in Recommender Systems
2022-11-10What Really Matters for Fairness in Machine Learning: Delayed Impact and Other Desiderata
2022-11-10Predictive Modeling in Healthcare – Special Considerations
2022-11-10Bringing Order to Chaos: Navigating the Disagreement Problem in Explainable ML
2022-11-09Pipeline Interventions
2022-11-09Algorithmic Challenges in Ensuring Fairness at the Time of Decision
2022-11-09Improving Refugee Resettlement
2022-11-09Learning to Predict Arbitrary Quantum Processes
2022-11-09A Kerfuffle: Differential Privacy and the 2020 Census
2022-11-08Chasing the Long Tail: What Neural Networks Memorize and Why
2022-11-08Concurrent Composition Theorems for all Standard Variants of Differential Privacy
2022-11-08Privacy Management: Achieving the Possimpible
2022-11-07Privacy-safe Measurement on the Web: Open Questions From the Privacy Sandbox
2022-10-29Transmission Neural Networks: From Virus Spread Models to Neural Networks
2022-10-29Spatial Spread of Dengue Virus: Appropriate Spatial Scales for Transmission
2022-10-28A Global Comparison of COVID-19 Variant Waves and Relationships with Clinical and...



Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Epidemics and Information Diffusion
Swati Gupta