Following the recent generalization of social choice in the literature on judgment aggregation, we extend the analysis of freedom of choice from sets of alternatives to sets of opinions. We establish the analogue of the cardinality based freedom of choice measure and suggest an alternative...

The purpose of this paper is to provide a binary comparison of two distance-based preference aggregation rules, Slater's rule and Kemeny''s rule. It will be shown that for certain lists of individual preferences the outcomes will be antagonistic in the sense that what is considered best...

We show how ultrafilters can be used to prove a central impossibility result in judgement aggregation introduced by Nehring and Puppe (2005), namely that for a logically strongly interconnected agenda, an independent and monotonic judgement aggregation rule which satisfies universal domain,...

This paper is concerned with the manipulability of common voting rules, in particular with the Borda rule and other scoring rules. It is shown that, if one deviates from the assumption of complete information of the voters about the preference profile in the slightest possible manner, the Borda...

In this paper we compare a minisum and a minimax procedure as suggested by Brams et al. for selecting committees from a set of candidates. Using a general geometric framework as developed by Don Saari for preference aggregation, we show that antipodality of a unique maximin and a unique minisum...

The purpose of this paper is to provide a binary comparison of two distance-based preference aggregation rules, Slater's rule and Kemeny''s rule. It will be shown that for certain lists of individual preferences the outcomes will be antagonistic in the sense that what is considered best...

This paper compares binary versions of two well-known preference aggregation methods designed to overcome problems occurring from voting cycles, Copeland's (1951) and Dodgson''s (1876) method. In particular it will first be shown that the Copeland winner can occur at any position in the Dodgson...

In this paper we compare a minisum and a minimax procedure as suggested by Brams et al. for selecting committees from a set of candidates. Using a general geometric framework as developed by Don Saari for preference aggregation, we show that antipodality of a unique maximin and a unique minisum...

This paper compares binary versions of two well-known preference aggregation methods designed to overcome problems occurring from voting cycles, Copeland's (1951) and Dodgson''s (1876) method. In particular it will first be shown that the Copeland winner can occur at any position in the Dodgson...