Wlodek Rabinowicz

In Rabinowicz (2008), I considered how value relations can best be analysed in terms of fitting pro-attitudes. In the formal model of that paper, fitting pro-attitudes are represented by the class of permissible preference orderings on a domain of items that are being compared. As it turns out, this approach opens up for a multiplicity of different types of value relationships, along with the standard relations of ‘better’, ‘worse’, ‘equally as good as’ and ‘incomparable in value’. Unfortunately, the approach is vulnerable to a number of objections. I believe these objections can be avoided if one re-interprets the underlying notion of preference: instead of treating preference as a ‘dyadic’ attitude directed towards a pair of items, we can think of it as a difference of degree between ‘monadic’ attitudes of favouring. Each such monadic attitude has just one item as its object. Given this re-interpretation, permissible preferences can be modelled by the class of permissible assignments of degrees of favouring to items in the domain. From this construction, we can then recover the old modelling in terms of the class of permissible preference orderings, but the previous objections to that model no longer apply.

According to the so-called “Folk Theorem” for repeated games, stable cooperative relations can be sustained in a Prisoner’s Dilemma if the game is repeated an indefinite number of times. This result depends on the possibility of applying strategies that are based on reciprocity, i.e., strategies that reward cooperation with subsequent cooperation and punish defectionwith subsequent defection. If future interactions are sufficiently important, i.e., if the discount rate is relatively small, each agent may be motivated to cooperate by fear of retaliation in the future. For finite games, however, where the number of plays is known beforehand, there is a backward induction argument showing that rational agents will not be able to achieve cooperation. On behalf of the Hobbesian “Foole”, who cannot see any advantage in cooperation, Gregory Kavka (1983, 1986) has presented an argument that significantly extends the range of the backward induction argument. He shows that, for the backward induction argument to be effective, it is not necessary that the precise number of future interactions be known. It is sufficient that there is a known definite upper bound on the number of interactions. A similar argument is developed by John W. Carroll (1987). We will here question the assumption of a known upper bound. When the assumption is made precise in the way needed for the argument to go through, its apparent plausibility evaporates. We then offer a reformulation of the argument, based on weaker, and more plausible, assumptions.

The point of departure in my story is the contrast between two models of democratic voting process: popular democracy and what might be called committee democracy. On one interpretation, voting in popular democracy is a procedure whose function is to aggregate the individuals’ preferences to something like a collective preference, while in committee democracy what is being aggregated are committee members’ judgments. The relevant judgments on the agenda often address an evaluative question. It is such value judgments that this paper focuses on. The question is how their aggregation differs from aggregation of preferences. I focus on the case in which the two aggregation scenarios exhibit a far-reaching structural similarity: more precisely, the case in which, in the judgment aggregation scenario, the individual inputs are value rankings. This means that, formally, the individual judgments in this case have the same structure as preference rankings over a given set of alternatives, but while in a preference ranking the alternatives are ordered in accordance with one’s preferences, a value ranking expresses one’s comparative evaluation of the alternatives: say, this alternative is best, those two alternatives are second-best, that alternative is third-best, etc. I suggest that this difference in the nature of individual inputs in two aggregation scenarios has important implications for the task of aggregation. In particular, distance-based methods that look fine for the aggregation of judgments turn out to be inappropriate for the aggregation of preferences: Minimization of distance from individual inputs violates the Pareto condition. When applied to judgment aggregation, distance-based methods can also be approached from the epistemic standpoint: the questions canl be posed concerning their advantages as a truth-tracker. In this context, what matters is not only the probability of the outcome of the aggregation procedure being true, but also the expected verisimilitude of the outcome: its expected distance from truth.

The authors of this paper earlier argued that concrete objects, such as things or persons, may have final value , which is not reducible to the value of states of affairs that concern the object in question.Our arguments have been challenged. This paper is an attempt to respond to some of these challenges, viz. those that concern the reducibility issue. The discussion presupposes a Brentano-inspired account of value in terms of fitting responses to value bearers. Attention is given to a yet another type of reduction proposal, according to which the ultimate bearers of final value are abstract particulars rather than abstract states or facts. While the proposal is attractive , it confronts serious difficulties. To recognise tropes as potential bearers of final value, along with other objects, is one thing; but to reduce the final value of concrete objects to the final value of tropes is another matter