We consider the multi-object allocation problem with monetary transfers where each agent obtains at most one object (unit-demand). We focus on allocation rules satisfying individual rationality, non-wastefulness, equal treatment of equals, and strategy-proofness. Extending the result of Kazumura et al. (2020B), we show that for an arbitrary number of agents and objects, the minimum price Walrasian is the unique ex-post revenue maximizing rule among the rules satisfying no subsidy in addition to the four properties, and that no subsidy in this result can be replaced by no bankruptcy on the positive income effect domain
This paper finds welfare- and revenue-maximizing mechanisms for assigning a divisible good to a popu...
We consider allocation mechanisms in economies with a single indivisible good and money. First, we s...
A single object must be allocated to at most one of n agents. Money transfers are possible and prefe...
We consider the multi-object allocation problem with monetary transfers where each agent obtains at ...
A seller is selling multiple objects to a set of agents. Each agent can buy at most one object and h...
We consider the problem of allocating multiple units of an indivisible object among agents and colle...
We consider the multi-object allocation problem with monetary transfers where each agent obtains at ...
We consider the problem of allocating a single object to the agents with payments. Agents have prefe...
We consider the allocation problem of a single indivisible object to one of several agents under the...
We consider the problem of allocating objects to a group of agents and how much agents should pay. E...
Consider the problem of allocating objects to agents and how much they should pay. Each agent has a ...
We consider the problems of allocating objects to a group of agents and how much agents should pay. ...
We consider an allocation problem with a finite number of objects, and agents that demand at most on...
We study mechanism design problems in quasi-linear environments where the envelope theorem and reven...
We study mechanism design problems in quasi-linear environments where the en-velope theorem and reve...
This paper finds welfare- and revenue-maximizing mechanisms for assigning a divisible good to a popu...
We consider allocation mechanisms in economies with a single indivisible good and money. First, we s...
A single object must be allocated to at most one of n agents. Money transfers are possible and prefe...
We consider the multi-object allocation problem with monetary transfers where each agent obtains at ...
A seller is selling multiple objects to a set of agents. Each agent can buy at most one object and h...
We consider the problem of allocating multiple units of an indivisible object among agents and colle...
We consider the multi-object allocation problem with monetary transfers where each agent obtains at ...
We consider the problem of allocating a single object to the agents with payments. Agents have prefe...
We consider the allocation problem of a single indivisible object to one of several agents under the...
We consider the problem of allocating objects to a group of agents and how much agents should pay. E...
Consider the problem of allocating objects to agents and how much they should pay. Each agent has a ...
We consider the problems of allocating objects to a group of agents and how much agents should pay. ...
We consider an allocation problem with a finite number of objects, and agents that demand at most on...
We study mechanism design problems in quasi-linear environments where the envelope theorem and reven...
We study mechanism design problems in quasi-linear environments where the en-velope theorem and reve...
This paper finds welfare- and revenue-maximizing mechanisms for assigning a divisible good to a popu...
We consider allocation mechanisms in economies with a single indivisible good and money. First, we s...
A single object must be allocated to at most one of n agents. Money transfers are possible and prefe...