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 provides a distance based analysis of the Borda rule with respect to Condorcet’s criterion. It shows that the minimal Condorcet consistency present in the Borda rule, whenever a Condorcet winner (the alternative that wins against every other alternative in a pairwise contest)...

We analyze a class of proportional cake-cutting algorithms that use a minimal number of cuts (n-1 if there are n players) to divide a cake that the players value along one dimension. While these algorithms may not produce an envy-free or efficient allocation--as these terms are used in the...

A fair spanning tree of a graph maximizes the minimum satisfaction among individuals given their preferences over the edges of the graph. In this note we answer an open question about the computational complexity of determining fair spanning trees raised in Darmann et al. (2009). It is shown...

This paper analyzes the computational complexity involved in solving fairness issues on graphs, e.g., in the installation of networks such as water networks or oil pipelines. Based on individual rankings of the edges of a graph, we will show under which conditions solutions, i.e., spanning...

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...

Assignments of weak orders to complete binary relations are considered. Firstly, it is shown that assigning the transitive closure of a complete binary relation does not always assign the closest weak order according to any reasonable metric on complete binary relations. It is then shown that...