The computational complexity status for a problem of deciding on the quality of a committee is established. Starting with individual preferences over alternatives, we analyze when it can be determined efficiently if a given committee C satisfies a weak Condorcet criterion - i.e., if C is at...

In several situations agents need to be assigned to activities on basis of their preferences, and each agent can take part in at most one activity. Often, the preferences of the agents do not depend only on the activity itself but also on the number of participants in the respective activity. In...

We consider the situation in which group activities need to be organized for a set of agents when each agent can take part in at most one activity. The agents' preferences depend both on the activity and the number of participants in that activity. In particular, the preferences are given by...

We consider the problem of allocating indivisible goods to agents who have preferences over the goods. In such a setting, a central task is to maximize social welfare. In this paper, we assume the preferences to be additive, and measure social welfare by means of the Nash product. We focus on...

In recent years, many authors have analysed fair division aspects in problems containing network structures. Frequently, the connection of all vertices of the network, i.e., a minimum cost spanning tree, and the sharing of its cost was considered. In this paper we study the fair division of...

This paper combines social choice theory with discrete optimization. We assume that individuals have preferences over edges of a graph that need to be aggregated. The goal is to find a socially "best" spanning tree in the graph. As ranking all spanning trees is becoming infeasible even for small...

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

This paper provides a first insight into cost sharing rules for the continuous knapsack problem. Assuming a set of divisible items with weights from which a knapsack with a certain weight constraint is to be filled, different such (classes of) rules are discussed. Those - based on individual...

We consider a setting where one has to organize one or several group activities for a set of agents. Each agent will participate in at most one activity, and her preferences over activities depend on the number of participants in the activity. The goal is to assign agents to activities based on...