Predictive algorithms are playing an increasingly prominent role in society, being used to predict recidivism, loan repayment, job performance, and so on. With this increasing influence has come an increasing concern with the ways in which they might be unfair or biased against individuals in virtue of their race, gender, or, more generally, their group membership. Many purported criteria of algorithmic fairness concern statistical relationships between the algorithm’s predictions and the actual outcomes, for instance requiring that the rate of false (...) positives be equal across the relevant groups. We might seek to ensure that algorithms satisfy all of these purported fairness criteria. But a series of impossibility results shows that this is impossible, unless base rates are equal across the relevant groups. What are we to make of these pessimistic results? I argue that none of the purported criteria, except for a calibration criterion, are necessary conditions for fairness, on the grounds that they can all be simultaneously violated by a manifestly fair and uniquely optimal predictive algorithm, even when base rates are equal. I conclude with some general reflections on algorithmic fairness. (shrink)

Though the revised edition of A Theory of Justice, published in 1999, is the definitive statement of Rawls's view, so much of the extensive literature on Rawls's theory refers to the first edition. This reissue makes the first edition once again available for scholars and serious students of Rawls's work.

This paper generalises the classical Condorcet jury theorem from majority voting over two options to plurality voting over multiple options. The paper further discusses the debate between epistemic and procedural democracy and situates its formal results in that debate. The paper finally compares a number of different social choice procedures for many-option choices in terms of their epistemic merits. An appendix explores the implications of some of the present mathematical results for the question of how probable majority cycles (as in (...) Condorcet's paradox) are in large electorates. (shrink)

To address the rising concern that algorithmic decision-making may reinforce discriminatory biases, researchers have proposed many notions of fairness and corresponding mathematical formalizations. Each of these notions is often presented as a one-size-fits-all, absolute condition; however, in reality, the practical and ethical trade-offs are unavoidable and more complex. We introduce a new approach that considers fairness—not as a binary, absolute mathematical condition—but rather, as a relational notion in comparison to alternative decisionmaking processes. Using US mortgage lending as an example use (...) case, we discuss the ethical foundations of each definition of fairness and demonstrate that our proposed methodology more closely captures the ethical trade-offs of the decision-maker, as well as forcing a more explicit representation of which values and objectives are prioritised. (shrink)

This item was published as 'Appendix 3: An Implication of the k-option Condorcet jury mechanism for the probability of cycles' in List and Goodin (2001) http://eprints.lse.ac.uk/705/. Standard results suggest that the probability of cycles should increase as the number of options increases and also as the number of individuals increases. These results are, however, premised on a so-called "impartial culture" assumption: any logically possible preference ordering is assumed to be as likely to be held by an individual as any other. (...) The present chapter shows, in the three-option case, that given suitably systematic, however slight, deviations from an impartial culture situation, the probability of a cycle converges either to zero (more typically) or to one (less typically) as the number of individuals increases. (shrink)