Strategy-proof Assignment of Multiple Resources

Albin Erlanson*, Karol Flores-Szwagrzak

*Corresponding author for this work

Research output: Contribution to journalJournal articleResearchpeer-review

Abstract

We examine the strategy-proof allocation of multiple resources; an application is the assignment of packages of tasks, workloads, and compensations among the members of an organization. In the domain of multidimensional single-peaked preferences, 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, unanimous, consistent, and resource-monotonic mechanisms. These mechanisms generalize the parametric rationing mechanisms (Young, 1987), some of which date back to the Babylonian Talmud.

Original languageEnglish
JournalJournal of Economic Theory
Volume159
Issue numberPART A
Pages (from-to)137-162
Number of pages26
ISSN0022-0531
DOIs
Publication statusPublished - 1 Sep 2015
Externally publishedYes

Keywords

  • Consistency
  • Resource-monotonicity
  • Strategy-proofness

Cite this