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

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 aspect of strategic manipulation in the group activity selection problem GASP. In that problem, the goal is to assign agents to activities when the agents have preferences over the activities themselves and over the number of participants in the activities, that is preferences...

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

We consider a packing problem that arises in a direct-shipping system in the food and beverage industry: Trucks are the containers, and products to be distributed are the items. The packing is constrained by two independent quantities, weight (e.g., measured in kg) and volume (number of...

We consider the product knapsack problem, which is the variant of the classical 0-1 knapsack problem where the objective consists of maximizing the product of the profits of the selected items. These profits are allowed to be positive or negative. We present the first fully polynomial-time...