A commodity is divided among agents with single-peaked preferences. The commodity is either infinitely divisible or comes in indivisible units. Arationing methodelicits individual peaks (demands); if the commodity is overdemanded (resp. underdemanded), no agent receives more (resp. less) than his peak. Afixed-pathrationing method allocates an overdemanded “good” along a path independent of individual demands, except that an agent receives exactly his demand if it is below the path-generated share. An underdemanded “bad” is allocated similarly alonganotherpath. The four properties efficiency, strategyproofness, resource monotonicity, and consistency characterize the set of fixed path rationing methods
We consider the problem of allocating multiple social endowments (estates) of a perfectly divisible ...
Decentralized rationing problems are those in which the resource is not directly assigned to agents,...
We consider private good economies with single-plateaued preferences. A solution selects for each pr...
A commodity is divided among agents with single-peaked preferences. The commodity is either infinite...
In a rationing problem, each agent demands a quantity of a certain commodity and the available resou...
We consider the problem of allocating m commodities among n agents with single-peaked preferences. W...
The standard problem of rationing a single over-demanded commodity has a natural bipartite extension...
In the bipartite rationing problem, a set of agents share a single resource available in different “...
This dissertation consists of three chapters. In the first chapter, we are considering the problem o...
Thesis (Ph. D.)--University of Rochester. Dept. of Economics, 2013.This thesis considers the basic e...
Suppose a quantity t of a given resource is divided among two agents. If an additional quantity beco...
Decentralized rationing problems are those in which the resource is not directly assigned to agents,...
We consider the problem of alloting shares of a task or good among agents with single peaked prefere...
We consider the problem of (re)allocating the total endowment of an in-¯nitely divisible commodity a...
We consider the problem of (re)allocating the total endowment of an infinitely divisible commodity a...
We consider the problem of allocating multiple social endowments (estates) of a perfectly divisible ...
Decentralized rationing problems are those in which the resource is not directly assigned to agents,...
We consider private good economies with single-plateaued preferences. A solution selects for each pr...
A commodity is divided among agents with single-peaked preferences. The commodity is either infinite...
In a rationing problem, each agent demands a quantity of a certain commodity and the available resou...
We consider the problem of allocating m commodities among n agents with single-peaked preferences. W...
The standard problem of rationing a single over-demanded commodity has a natural bipartite extension...
In the bipartite rationing problem, a set of agents share a single resource available in different “...
This dissertation consists of three chapters. In the first chapter, we are considering the problem o...
Thesis (Ph. D.)--University of Rochester. Dept. of Economics, 2013.This thesis considers the basic e...
Suppose a quantity t of a given resource is divided among two agents. If an additional quantity beco...
Decentralized rationing problems are those in which the resource is not directly assigned to agents,...
We consider the problem of alloting shares of a task or good among agents with single peaked prefere...
We consider the problem of (re)allocating the total endowment of an in-¯nitely divisible commodity a...
We consider the problem of (re)allocating the total endowment of an infinitely divisible commodity a...
We consider the problem of allocating multiple social endowments (estates) of a perfectly divisible ...
Decentralized rationing problems are those in which the resource is not directly assigned to agents,...
We consider private good economies with single-plateaued preferences. A solution selects for each pr...