Table of Contents
Fetching ...

Double Fairness Policy Learning: Integrating Action Fairness and Outcome Fairness in Decision-making

Zeyu Bian, Lan Wang, Chengchun Shi, Zhengling Qi

TL;DR

The paper introduces Double Fairness Learning (DFL), a policy-learning framework that simultaneously targets action fairness, outcome fairness, and value maximization. By formulating a multi-objective optimization and employing a lexicographic weighted Tchebyshev scalarization, it identifies Pareto-efficient policies even in non-convex settings, with rigorous regret bounds. The work provides necessary and sufficient conditions for the existence of outcome/double fairness policies, specialized guarantees for Equal Opportunity and Counterfactual Fairness, and demonstrates substantial fairness gains with minimal value loss on both synthetic simulations and real datasets (motor insurance and entrepreneurship training). The approach is flexible across fairness notions and supports auditing, enhancing trustworthy decision-making in high-stakes domains.

Abstract

Fairness is a central pillar of trustworthy machine learning, especially in domains where accuracy- or profit-driven optimization is insufficient. While most fairness research focuses on supervised learning, fairness in policy learning remains less explored. Because policy learning is interventional, it induces two distinct fairness targets: action fairness (equitable action assignments) and outcome fairness (equitable downstream consequences). Crucially, equalizing actions does not generally equalize outcomes when groups face different constraints or respond differently to the same action. We propose a novel double fairness learning (DFL) framework that explicitly manages the trade-off among three objectives: action fairness, outcome fairness, and value maximization. We integrate fairness directly into a multi-objective optimization problem for policy learning and employ a lexicographic weighted Tchebyshev method that recovers Pareto solutions beyond convex settings, with theoretical guarantees on the regret bounds. Our framework is flexible and accommodates various commonly used fairness notions. Extensive simulations demonstrate improved performance relative to competing methods. In applications to a motor third-party liability insurance dataset and an entrepreneurship training dataset, DFL substantially improves both action and outcome fairness while incurring only a modest reduction in overall value.

Double Fairness Policy Learning: Integrating Action Fairness and Outcome Fairness in Decision-making

TL;DR

The paper introduces Double Fairness Learning (DFL), a policy-learning framework that simultaneously targets action fairness, outcome fairness, and value maximization. By formulating a multi-objective optimization and employing a lexicographic weighted Tchebyshev scalarization, it identifies Pareto-efficient policies even in non-convex settings, with rigorous regret bounds. The work provides necessary and sufficient conditions for the existence of outcome/double fairness policies, specialized guarantees for Equal Opportunity and Counterfactual Fairness, and demonstrates substantial fairness gains with minimal value loss on both synthetic simulations and real datasets (motor insurance and entrepreneurship training). The approach is flexible across fairness notions and supports auditing, enhancing trustworthy decision-making in high-stakes domains.

Abstract

Fairness is a central pillar of trustworthy machine learning, especially in domains where accuracy- or profit-driven optimization is insufficient. While most fairness research focuses on supervised learning, fairness in policy learning remains less explored. Because policy learning is interventional, it induces two distinct fairness targets: action fairness (equitable action assignments) and outcome fairness (equitable downstream consequences). Crucially, equalizing actions does not generally equalize outcomes when groups face different constraints or respond differently to the same action. We propose a novel double fairness learning (DFL) framework that explicitly manages the trade-off among three objectives: action fairness, outcome fairness, and value maximization. We integrate fairness directly into a multi-objective optimization problem for policy learning and employ a lexicographic weighted Tchebyshev method that recovers Pareto solutions beyond convex settings, with theoretical guarantees on the regret bounds. Our framework is flexible and accommodates various commonly used fairness notions. Extensive simulations demonstrate improved performance relative to competing methods. In applications to a motor third-party liability insurance dataset and an entrepreneurship training dataset, DFL substantially improves both action and outcome fairness while incurring only a modest reduction in overall value.
Paper Structure (28 sections, 15 theorems, 101 equations, 8 figures, 2 tables, 1 algorithm)

This paper contains 28 sections, 15 theorems, 101 equations, 8 figures, 2 tables, 1 algorithm.

Key Result

Proposition 1

There exists a outcome fairness policy for the given environment if and only if either Assumption asmp:domination or Assumption asmp:non-domination holds.

Figures (8)

  • Figure 1: The performance of the three framework types is illustrated using a radar chart, where a higher score along each axis represents better performance in that specific aspect. Here, AF and OF refer to action fairness and outcome fairness, respectively. DFL refers to our proposed double fairness learning method. ASF represents the action single fair policy framework, and OSF denotes the value single fair policy framework.
  • Figure 2: The directed acyclic graph of the DGP. The arrow in cyan means that the path is intervenable. The dashed line between $S$ and $X$ means that $S$ might influence $X$, but the relationship is uncertain or not definitively established.
  • Figure 3: Empirical action fairness metric $\Delta_1(\pi)$ (lower is better), outcome fairness metric $\Delta_2(\pi)$ (lower is better), and value function $V(\pi)$ (higher is better), based on the equal opportunity fairness notion. Results are obtained from a testing set of size 5,000, comparing our proposed DFL method with competing approaches. The results are averaged over 100 replications, each with $K=10$ and a training set of size 200.
  • Figure 4: Empirical action fairness metric $\Delta_1(\pi)$ (lower is better), outcome fairness metric $\Delta_2(\pi)$ (lower is better), and value function $V(\pi)$ (higher is better) based on the counterfactual fairness notion, obtained from a testing set of size 5,000, comparing our proposed DFL method with competing approaches. The results are averaged over 100 replications, each with $K=10$ and a training set of size 200.
  • Figure 5: Performance, based on numerical studies, is visualized using a radar chart. A higher score along a particular axis indicates better performance in that aspect. DFL refers to our proposed double fairness learning method. ASF represents the action single fair policy framework (VB1), and OSF denotes the outcome single fair policy framework (VB2).
  • ...and 3 more figures

Theorems & Definitions (37)

  • Definition 1: Equal Opportunity
  • Definition 2: Counterfactual Fairness
  • Example 1: Action Fairness
  • Example 2: Outcome fairness (continued)
  • Proposition 1
  • Proposition 2
  • Example 3: Equal Opportunity
  • Example 4: Counterfactual Fairness
  • Definition 3: Pareto Fairness Policies and Pareto Fairness Set
  • Remark 1
  • ...and 27 more