atlas

Research map / Learning theory and algorithms / Fairness

Remembering to Be Fair: Non-Markovian Fairness in Sequential Decision Making

ICML 2024 · Learning theory and algorithms › Fairness · approach: Causal and policy fairness in decisions · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Formalizes non-Markovian fairness over decision histories (long-term, periodic, anytime, bounded fairness), shows value-regular status functions can be made Markovian via memory augmentation, and proposes FairQCM, which generates counterfactual memory experiences for Q-learning.

Problem

Fairness in sequential multi-stakeholder decision making depends on the history of decisions and must be assessed at intermediate time points, so it is non-Markovian and standard MDP methods do not directly apply.

Approach

Defines a fairness-scheme formalism (status function, extended aggregation, filter) that expresses long-term, periodic, anytime and bounded fairness; uses memory augmentation to make value-regular status functions Markovian; and generates counterfactual memory experiences (FairQCM) to improve sample efficiency of fair policy learning.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
use FairQCM with counterfactual memory experiences instead of the evaluated memory-augmented RL baselinesDQN-based resource allocation · Resource Allocationaccumulated Nash welfareHelped
use FairQCM with counterfactual memory experiences instead of the evaluated memory-augmented RL baselinesDQN-based resource allocation · Resource Allocationsample efficiencyHelped
use FairQCM with counterfactual memory experiences instead of the evaluated memory-augmented RL baselinesQ-learning resource allocation · Tabular Resource Allocationaccumulated Nash welfareHelped
use FairQCM with counterfactual memory experiences instead of the evaluated memory-augmented RL baselinesQ-learning resource allocation · Tabular Resource Allocationsamples needed to trainHelped
use FairQCM with counterfactual memory experiences instead of the evaluated memory-augmented RL baselinesDQN-based simulated lending · Simulated Lendingaccumulated Relaxed Demographic Parity scoreHelped
use FairQCM with counterfactual memory experiences instead of the evaluated memory-augmented RL baselinesDQN-based simulated lending with Gaussian credit score changes · Simulated Lending with Gaussian Credit Score Changesaccumulated Relaxed Demographic Parity scoreHelped
use a GRU memory instead of some other evaluated memory baselinesDQN-based resource allocation · Resource Allocationaccumulated Nash welfareHelped
use a GRU memory instead of some other evaluated memory baselinesDQN-based simulated lending · Simulated Lendingaccumulated Relaxed Demographic Parity scoreHelped

Surprising findings

Limitations

Experimental setup

Datasets: simulated doughnut allocation environment simulated lending environment (adapted from dynamic lending environment)

Benchmarks: simulated doughnut allocation simulated lending

Metrics: accumulated Nash welfare accumulated relaxed demographic parity score number of doughnuts not wasted sample efficiency

Baselines: Full memory DQN Min memory DQN RNN (GRU) DQN Reset Oracle Random

Builds on: Q-learning DQN CRM (counterfactual reward machines) Nash welfare

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy