Add to ORKGWe consider envy-free (and budget-balanced) rules that are least manipulable with respect to agents counting or with respect to utility gains. Recently it has been shown that for any profile of quasi-linear preferences, the outcome of any such least manipulable envy-free rule can be obtained via agent-k-linked allocations. This note provides an algorithm for identifying agent-k-linked allocations
A common real-life problem is to fairly allocate a number of indivisible objects and a fixed amount ...
International audienceIn this paper, we study the problem of matching a set of items to a set of age...
We consider the following sequential allocation process. A benevolent central authority has to al-lo...
We consider envy-free and budget-balanced rules that are least manipulable with respect to agents co...
We analyze the problem of allocating indivisible objects and monetary compensations to a set of agen...
We consider competitive and budget-balanced allocation rules for problems where a number of indivis...
A common real-life problem is to fairly allocate a number of indivisible objects and a fixed amount ...
This paper studies envy-free allocations for economies with indivisible objects, quasi-linear utilit...
We study the problem of allocating $m$ indivisible items to $n$ agents with additive utilities. It i...
One must allocate a finite set of indivisible goods among two agents without monetary compensation. ...
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 strategic aspects of the No-Envy solution for the problem of allocating a...
The problem of resource allocation among a group of agents naturally arises in a wide range of real-...
The problem of resource allocation among a group of agents naturally arises in a wide range of real-...
There have been several interesting results in the lit-erature on dividing up goods between self-int...
A common real-life problem is to fairly allocate a number of indivisible objects and a fixed amount ...
International audienceIn this paper, we study the problem of matching a set of items to a set of age...
We consider the following sequential allocation process. A benevolent central authority has to al-lo...
We consider envy-free and budget-balanced rules that are least manipulable with respect to agents co...
We analyze the problem of allocating indivisible objects and monetary compensations to a set of agen...
We consider competitive and budget-balanced allocation rules for problems where a number of indivis...
A common real-life problem is to fairly allocate a number of indivisible objects and a fixed amount ...
This paper studies envy-free allocations for economies with indivisible objects, quasi-linear utilit...
We study the problem of allocating $m$ indivisible items to $n$ agents with additive utilities. It i...
One must allocate a finite set of indivisible goods among two agents without monetary compensation. ...
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 strategic aspects of the No-Envy solution for the problem of allocating a...
The problem of resource allocation among a group of agents naturally arises in a wide range of real-...
The problem of resource allocation among a group of agents naturally arises in a wide range of real-...
There have been several interesting results in the lit-erature on dividing up goods between self-int...
A common real-life problem is to fairly allocate a number of indivisible objects and a fixed amount ...
International audienceIn this paper, we study the problem of matching a set of items to a set of age...
We consider the following sequential allocation process. A benevolent central authority has to al-lo...