The trade-off between equity and efficiency is analyzed in a geometric framework for the problem of committee selection, which has recently attracted interest in the social choice literature. It is shown that this trade-off can be maximal in the precise sense of the antipodality of the outcomes...

It is well known that the literature on judgement aggregation inherits the impossibility results from the aggregation of preferences that it generalises. This is due to the fact that the typical judgement aggregation problem induces an ultrafilter on the set of individuals. We propose a...

An impossibility result for completely abstract social aggregation rules is presented. It is shown that non-imposition and a new no-veto property (two properties in the spirit of the Pareto principle and non-dictatorship respectively) are incompatible with an inter-profile consistency condition...

In this paper we investigate the problem of selecting a committee consisting of k members from a list of m candidates. Each candidate has a certain cost or weight. The choice of the k-committee has to satisfy some budget or weight constraint: the sum of the weights of all committee members must...

This paper considers cost sharing rules for the continuous knapsack problem. We assume a knapsack with a weight constraint to be filled with items of different weights chosen from a set of items. The cost of the knapsack needs to be shared among the individuals who approve or disapprove of...

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

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