Strategy-Proof Package Assignment
Albin Erlanson and
Karol Flores-Szwagrzak ()
No 2013:43, Working Papers from Lund University, Department of Economics
We examine the strategy-proof allocation of multiple divisible and indivisible resources; an application is the assignment of packages of tasks, workloads, and compensations among the members of an organization. We find that any allocation mechanism obtained by maximizing a separably concave function over a polyhedral extension of the set of Pareto-efficient allocations is strategy-proof. Moreover, these are the only strategy-proof and unanimous mechanisms satisfying a coherence property and responding well to changes in the availability of resources. These mechanisms generalize the parametric rationing mechanisms (Peyton Young, 1987, Mathematics of Operations Research 12 (3), 397-414.), some of which date back to the Babylonian Talmud.
Keywords: Package assignment; Indivisible objects; Strategy-proofness (search for similar items in EconPapers)
JEL-codes: C70 D47 D61 D63 D70 (search for similar items in EconPapers)
Pages: 41 pages
New Economics Papers: this item is included in nep-gth
References: View references in EconPapers View complete reference list from CitEc
Citations: Track citations by RSS feed
Downloads: (external link)
Working Paper: Strategy-proof package assignment (2014)
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:hhs:lunewp:2013_043
Access Statistics for this paper
More papers in Working Papers from Lund University, Department of Economics School of Economics and Management, Box 7080, S-22007 Lund, Sweden. Contact information at EDIRC.
Bibliographic data for series maintained by Prakriti Thami ().