Welfare-Maximizing Assignment of Agents to Hierarchical Positions
Isa Hafalir and
No 2015-E6, GSIA Working Papers from Carnegie Mellon University, Tepper School of Business
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 di§er and each one implements the optimal rule under di§erent 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.
References: View references in EconPapers View complete reference list from CitEc
Citations: Track citations by RSS feed
Downloads: (external link)
Our link check indicates that this URL is bad, the error code is: 404 Not Found
Journal Article: Welfare-maximizing assignment of agents to hierarchical positions (2015)
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:cmu:gsiawp:-1137660315
Ordering information: This working paper can be ordered from
http://student-3k.te ... /gsiadoc/GSIA_WP.asp
Access Statistics for this paper
More papers in GSIA Working Papers from Carnegie Mellon University, Tepper School of Business Tepper School of Business, Carnegie Mellon University, 5000 Forbes Avenue, Pittsburgh, PA 15213-3890.
Bibliographic data for series maintained by Steve Spear ().