Welfare-maximizing assignment of agents to hierarchical positions

Publication Type:
Journal Article
Citation:
Journal of Mathematical Economics, 2015, 61 pp. 253 - 270
Issue Date:
2015-01-01
Full metadata record
Files in This Item:
Filename Description Size
1-s2.0-S0304406815001123-main.pdfPublished Version591.65 kB
Adobe PDF
© 2015 Elsevier B.V. We allocate agents to three kinds of hierarchical positions: top, medium, and low. No monetary transfers are allowed. We solve for the incentive-compatible (IC) mechanisms that maximize a family of weighted social welfares that includes utilitarian and Rawlsian welfares. When the market is tough (all agents bear positive risk of obtaining a low position in any IC and feasible mechanism), then the pseudomarket mechanism with equal budgets (PM) and the Boston mechanism without priorities (BM) yield identical assignments which are always optimal. Otherwise, when the market is mild, PM and BM differ and each one implements the optimal rule under different assumptions on the curvature of virtual valuations. We also establish that both BM and PM mechanisms guarantee IC Pareto-optimal assignments for a domain of preference distributions satisfying weak assumptions.
Please use this identifier to cite or link to this item: