"(In)Efficiency in Budget-Balanced, One-to-One Allotment Rules”

MAXIMILIANO G. MIRANDA ZANETTI

San Luis

Workshop; “Cooperation, Matching and Collective Goods”; 2011

Instituto de Matemática Aplicada de San Luis

We study the problem of allotting N goods among N agents.In particular, we focus our attention on feasible assignments, that is, allotments that have balanced monetary transfers, such that no external funding is needed and no money of agents is wasted.We reproduce the well-known approach of Mechanism Design over this decision problem under asymmetric information, assuming a linear utility function.