Identifying Best Fair Intervention
arXiv:2111.04272
Abstract
We study the problem of best arm identification with a fairness constraint in a given causal model. The goal is to find a soft intervention on a given node to maximize the outcome while meeting a fairness constraint by counterfactual estimation with only partial knowledge of the causal model. The problem is motivated by ensuring fairness on an online marketplace. We provide theoretical guarantees on the probability of error and empirically examine the effectiveness of our algorithm with a two-stage baseline.
References in corpus (7)
- Man is to Computer Programmer as Woman is to Homemaker? Debiasing Word Embeddings
- Counterfactual Fairness
- Identifying Best Interventions through Online Importance Sampling
- Achieving Fairness in the Stochastic Multi-armed Bandit Problem
- Group Retention when Using Machine Learning in Sequential Decision Making: the Interplay between User Dynamics and Fairness
- Fair Contextual Multi-Armed Bandits: Theory and Experiments
- Causal Bandits with Propagating Inference