Identifying Best Fair Intervention

11/08/2021
by   Ruijiang Gao, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/14/2020

Shortcomings of Counterfactual Fairness and a Proposed Modification

In this paper, I argue that counterfactual fairness does not constitute ...
research
09/21/2021

Achieving Counterfactual Fairness for Causal Bandit

In online recommendation, customers arrive in a sequential and stochasti...
research
01/10/2017

Identifying Best Interventions through Online Importance Sampling

Motivated by applications in computational advertising and systems biolo...
research
07/27/2022

Towards Soft Fairness in Restless Multi-Armed Bandits

Restless multi-armed bandits (RMAB) is a framework for allocating limite...
research
10/01/2018

Counterfactually Fair Prediction Using Multiple Causal Models

In this paper we study the problem of making predictions using multiple ...
research
09/01/2021

FADE: FAir Double Ensemble Learning for Observable and Counterfactual Outcomes

Methods for building fair predictors often involve tradeoffs between fai...
research
02/19/2021

Fair Sparse Regression with Clustering: An Invex Relaxation for a Combinatorial Problem

In this paper, we study the problem of fair sparse regression on a biase...

Please sign up or login with your details

Forgot password? Click here to reset