Proposes a formal DP-compatible framework with three unfairness measures (mutual information with TV proxy, MaxSAT-based repair, top-k tuple contribution) that satisfy positivity, monotonicity, and computability.
1007–1026
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Revives Chaitin's heuristic principle to the extent permitted by logic and shows that Omega cannot be a halting probability under any infinite discrete measure, proposing alternative definitions instead.
citing papers explorer
-
Measuring Database Unfairness via Dependency Quantification Under Differential Privacy
Proposes a formal DP-compatible framework with three unfairness measures (mutual information with TV proxy, MaxSAT-based repair, top-k tuple contribution) that satisfy positivity, monotonicity, and computability.
-
On Chaitin's Heuristic Principle and Halting Probability
Revives Chaitin's heuristic principle to the extent permitted by logic and shows that Omega cannot be a halting probability under any infinite discrete measure, proposing alternative definitions instead.