Abstract. We consider the problem of fairly allocating a set of m indivisible objects to n agents having additive preferences over them. In this paper we propose an extension of this classical problem, where each object can possibly be in bad condition (e.g broken), in which case its actual value is zero. We assume that the central author-ity in charge of allocating the objects does not know beforehand the objects conditions, but only has probabilistic information. The aim of this work is to propose a formal model of this problem, to adapt some classical fairness criteria to this extended setting, and to in-troduce several approaches to compute optimal allocations for small instances as well as sub-optimal good allocations for real-world in...
In this paper, we study the problem of matching a set of items to a set of agents partitioned into t...
How should one allocate scarce resources among a group of people in a satisfactory manner when the p...
We study fair allocation of indivisible items, where the items are furnished with a set of conflicts...
We study a fair division problem, where a set of indivisible goods is to be allocated to a set of n ...
... problem of fairly dividing a common resource among agents having different —and sometimes antago...
We consider the problem of fairly dividing a set of items. Much of the fair division literature assu...
Abstract: "We consider the problem of fairly allocating a set of m indivisible goods to n agents, gi...
The problem of allocating divisible goods has enjoyed a lot of attention in both mathematics (e.g. t...
We study the problem of fairly allocating indivisible goods to groups of agents. Agents in the same ...
We study the problem of fairly allocating indivisible goods to groups of agents. Agents in the same ...
One must allocate a finite set of indivisible goods among two agents without monetary compensation. ...
International audienceIn this paper, we study the problem of matching a set of items to a set of age...
We study the problem of fairly allocating indivisible goods to groups of agents. Agents in the same ...
We study the problem of fairly allocating indivisible goods to groups of agents. Agents in the same ...
In this paper, we study the problem of matching a set of items to a set of agents partitioned into t...
In this paper, we study the problem of matching a set of items to a set of agents partitioned into t...
How should one allocate scarce resources among a group of people in a satisfactory manner when the p...
We study fair allocation of indivisible items, where the items are furnished with a set of conflicts...
We study a fair division problem, where a set of indivisible goods is to be allocated to a set of n ...
... problem of fairly dividing a common resource among agents having different —and sometimes antago...
We consider the problem of fairly dividing a set of items. Much of the fair division literature assu...
Abstract: "We consider the problem of fairly allocating a set of m indivisible goods to n agents, gi...
The problem of allocating divisible goods has enjoyed a lot of attention in both mathematics (e.g. t...
We study the problem of fairly allocating indivisible goods to groups of agents. Agents in the same ...
We study the problem of fairly allocating indivisible goods to groups of agents. Agents in the same ...
One must allocate a finite set of indivisible goods among two agents without monetary compensation. ...
International audienceIn this paper, we study the problem of matching a set of items to a set of age...
We study the problem of fairly allocating indivisible goods to groups of agents. Agents in the same ...
We study the problem of fairly allocating indivisible goods to groups of agents. Agents in the same ...
In this paper, we study the problem of matching a set of items to a set of agents partitioned into t...
In this paper, we study the problem of matching a set of items to a set of agents partitioned into t...
How should one allocate scarce resources among a group of people in a satisfactory manner when the p...
We study fair allocation of indivisible items, where the items are furnished with a set of conflicts...