Aart van Gils

In this thesis, I discuss the aggregation problem for T. M. Scanlon’s “contractualism”. I argue that Scanlonian contractualists have the following two options when it comes to the aggregation problem. First, they can choose to limit aggregation directly via a specific version of the Relevance View, “Sequential Claims-Matching”. Second, Scanlonian contractualists can adopt a so-called “mixed solution” of which I propose a specific version. My mixed solution does not limit aggregation. Rather, it either avoids some of the counterintuitive results in certain cases, or at least makes these same results look a lot less counterintuitive by putting them into perspective thanks to a plausible plurality of precisely specified values. The stakes between these two options are as follows. The first option justifies Scanlon’s intuition in one vs. many cases of which his “World Cup Case” is one example, but it comes at the cost of a seemingly quite limited range of application: any version of the Relevance View only works in cases in which we have no more than two groups of competing claimants. The second option has the exact opposite implications: my mixed solution cannot justify Scanlon’s intuition in one vs. many cases, but it could be applied to any case with any number of groups of competing claimants. In this choice between pre-theoretical intuition and feasibility, I would urge Scanlonian contractualists to choose feasibility.

Often institutions or individuals are faced with decisions where not all claims can be satisfied. Sometimes, these claims will be of differing strength. In such cases, it must be decided whether or not weaker claims can be aggregated in order to collectively defeat stronger claims. Many are attracted to a view, which this chapter calls Limited Aggregation, where this is sometimes acceptable and sometimes not. A new version of this view, Local Relevance, has recently emerged. This chapter seeks to explore and evaluate this view. In order to do so, the chapter offers a more precise interpretation of this basic approach, calling it ‘Sequential Claims-Matching’. The chapter shows how Sequential Claims-Matching avoids problems that dog other Limited Aggregation views but suffers from difficulties and ambiguities of its own. In particular, the chapter shows that it is hard to accommodate some core Limited Aggregation intuitions around tie-break cases within the Local Relevance view.