Simple Paired Combinatorial Assignment

Eric Gao

Papers from arXiv.org

Abstract: Consider a university assigning students to courses and dorms. While many mechanisms are available, they each have their own drawbacks. Running serial dictatorship once for all goods is highly unfair, but running serial dictatorship separately for each matching problem is inefficient-Pareto improvements can be found via students jointly trading their allocated course and dorm. Alternatively, competitive equilibrium from equal incomes scales combinatorially in the number of items, making implementation and preference elicitation difficult. This paper considers paired serial dictatorship: a novel mechanism where agents signal relative preferences that determine their priority in each market. Any deterministic allocation that arises in equilibrium is Pareto efficient and envy-free, highlighting how seemingly innocuous tie-breaking is the key barrier to optimality and fairness. When agents differ only in relative preferences, paired serial dictatorship ex-ante Pareto dominates running random serial dictatorship independently in each market. Such gains exist even when agents behave simplistically.

Date: 2025-01, Revised 2026-03
New Economics Papers: this item is included in nep-des
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://arxiv.org/pdf/2501.02686 Latest version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:arx:papers:2501.02686

Access Statistics for this paper

More papers in Papers from arXiv.org
Bibliographic data for series maintained by arXiv administrators ().