The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes
AbstractThis paper proposes a new mechanism for combinatorial assignment—for example, assigning schedules of courses to students—based on an approximation to competitive equilibrium from equal incomes (CEEI) in which incomes are unequal but arbitrarily close together. The main technical result is an existence theorem for approximate CEEI. The mechanism is approximately efficient, satisfies two new criteria of outcome fairness, and is strategyproof in large markets. Its performance is explored on real data, and it is compared to alternatives from theory and practice: all other known mechanisms are either unfair ex post or manipulable even in large markets, and most are both manipulable and unfair.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by University of Chicago Press in its journal Journal of Political Economy.
Volume (Year): 119 (2011)
Issue (Month): 6 ()
Pages: 1061 - 1103
Contact details of provider:
Web page: http://www.journals.uchicago.edu/JPE/
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Erel Segal-Halevi & Shmuel Nitzan, 2014. "Cake Cutting – Fair and Square," Working Papers 2014-01, Department of Economics, Bar-Ilan University.
- Erlanson, Albin & Szwagrzak, Karol, 2013. "Strategy-Proof Package Assignment," Working Papers 2013:43, Lund University, Department of Economics.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Journals Division).
If references are entirely missing, you can add them using this form.