Resource allocation mechanisms based on strategy-proof symmetric anonymous voting procedures with delegation

The characterization of symmetric anonymous generalized median voting schemes which are suitable for resource allocation by voting with delegation – when any agent is allowed do announce not only whole allocation, which is the best to his opinion, but just several components of this vertex, is provided including the description of class of feasible delegation rules.