This paper investigates an allocation rule that fairly assigns at most one indivisible object and a monetary compensation to each agent, Under the restriction that the monetary compensations do not exceed some exogenously given upper bound. A few properties of this allocation rule are stated and the main result demonstrates that the allocation rule is coalitionally strategy-proof. (C) 2008 Elsevier B.V. All rights reserved
We give a characterization of the set of group-strategyproof, Pareto-optimal, and reallocation-proof...
This paper considers the problem of allocating N indivisible objects among N agents according to the...
How should we allocate a social endowment of objects among a group of agents when monetary compensat...
This paper investigates an allocation rule that fairly assigns at most one indivisible object and a ...
We consider the allocation of heterogeneous indivisible objects without using monetary transfers. Ea...
We consider the allocation of heterogeneous indivisible objects without using monetary transfers. Ea...
We consider the allocation problem of a single indivisible object to one of several agents under the...
This paper investigates the problem of allocating two types of indivisible objects among a group of ...
In a unified framework of allocation problems with at least three en-tities (or agents), we show tha...
This paper studies an allocation problem with multiple assignments, indivisible objects, no endowmen...
We study a problem of dynamic allocation without money. Agents have arrivals and departures and stri...
This paper analyzes a way of allocating primarily three indivisible objects to the same number of in...
This paper revisits the fair and optimal allocation mechanism (Sun and Yang, Economics Letters 81:73...
We consider a problem of allocating indivisible objects when agents may desire to consume more than ...
We consider the problem of reallocating objects among a group of agents, each possibly endowed with ...
We give a characterization of the set of group-strategyproof, Pareto-optimal, and reallocation-proof...
This paper considers the problem of allocating N indivisible objects among N agents according to the...
How should we allocate a social endowment of objects among a group of agents when monetary compensat...
This paper investigates an allocation rule that fairly assigns at most one indivisible object and a ...
We consider the allocation of heterogeneous indivisible objects without using monetary transfers. Ea...
We consider the allocation of heterogeneous indivisible objects without using monetary transfers. Ea...
We consider the allocation problem of a single indivisible object to one of several agents under the...
This paper investigates the problem of allocating two types of indivisible objects among a group of ...
In a unified framework of allocation problems with at least three en-tities (or agents), we show tha...
This paper studies an allocation problem with multiple assignments, indivisible objects, no endowmen...
We study a problem of dynamic allocation without money. Agents have arrivals and departures and stri...
This paper analyzes a way of allocating primarily three indivisible objects to the same number of in...
This paper revisits the fair and optimal allocation mechanism (Sun and Yang, Economics Letters 81:73...
We consider a problem of allocating indivisible objects when agents may desire to consume more than ...
We consider the problem of reallocating objects among a group of agents, each possibly endowed with ...
We give a characterization of the set of group-strategyproof, Pareto-optimal, and reallocation-proof...
This paper considers the problem of allocating N indivisible objects among N agents according to the...
How should we allocate a social endowment of objects among a group of agents when monetary compensat...