Recommender systems aim to support decision-makers by providing decision advice. We review briefly tools of Multi-Criteria Decision Analysis (MCDA), including aggregation operators, that could be the basis for a recommender system. Then we develop a multi-criteria recommender system, STROMa...

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

In this paper we provide a binary extension of Dodgson’s non-binary preference aggregation rule. This new aggregation rule is then compared to two other rules which, as Dodgson’s rule, are also explicitly based on distance functions, namely Kemeny’s and Slater’s rule. It is shown that...