Ties matter: improving efficiency in course allocation by introducing ties
We study the course allocation system at Nanyang Technological University, where students submit strict preferences for courses and courses have implicit preferences for students. This formulates a many-to-many matching problem. We show the inefficiencies of the current mechanism and propose new competing mechanisms called Pareto-improving draft and dictatorship mechanisms, which introduce ties into students' preferences. Our mechanisms generate (group) stable and Pareto-efficient allocations, and the dictatorship mechanism can be implemented truthfully. Simulations on real data show that introducing ties into students' preferences can significantly improve efficiency, and the draft mechanism outperforms the dictatorship mechanism despite that the former is non-strategyproof.
|Date of creation:||25 Apr 2013|
|Date of revision:|
|Contact details of provider:|| Postal: |
Web page: http://mpra.ub.uni-muenchen.de
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Aytek Erdil & Haluk Ergin, 2007.
"What`s the Matter with Tie-breaking? Improving Efficiency in School Choice,"
Economics Series Working Papers
349, University of Oxford, Department of Economics.
- Aytek Erdil & Haluk Ergin, 2008. "What's the Matter with Tie-Breaking? Improving Efficiency in School Choice," American Economic Review, American Economic Association, vol. 98(3), pages 669-89, June.
- Marilda Sotomayor, 2011. "The pareto-stability concept is a natural solution concept for discrete matching markets with indifferences," International Journal of Game Theory, Springer, vol. 40(3), pages 631-644, August.
- Ahmet Alkan, 2002. "A class of multipartner matching markets with a strong lattice structure," Economic Theory, Springer, vol. 19(4), pages 737-746.
- Tayfun Sonmez & M. Utku Unver, 2003.
"Course Bidding at Business Schools,"
Game Theory and Information
0306001, EconWPA, revised 02 Jan 2004.
- Tayfun Sönmez & M. Utku Ünver, 2005. "Course Bidding at Business Schools," Boston College Working Papers in Economics 618, Boston College Department of Economics.
- M.Utku Unver, 2003. "Course Bidding at Business Schools," Working Papers 257, University of Pittsburgh, Department of Economics, revised Jan 2003.
- Budish, Eric & Cantillon, Estelle, 2010.
"The Multi-unit Assignment Problem: Theory and Evidence from Course Allocation at Harvard,"
CEPR Discussion Papers
7641, C.E.P.R. Discussion Papers.
- Eric Budish & Estelle Cantillon, 2012. "The Multi-unit Assignment Problem: Theory and Evidence from Course Allocation at Harvard," American Economic Review, American Economic Association, vol. 102(5), pages 2237-71, August.
- Eric Budish & Estelle Cantillon, 2012. "The Multi-unit Assignment Problem: Theory and Evidence from Course Allocation at Harvard," ULB Institutional Repository 2013/99376, ULB -- Universite Libre de Bruxelles.
- Tayfun Sönmez & M. Utku Ünver, 2009. "Matching, Allocation, and Exchange of Discrete Resources," Boston College Working Papers in Economics 717, Boston College Department of Economics.
- Martinez, Ruth & Masso, Jordi & Neme, Alejandro & Oviedo, Jorge, 2004. "An algorithm to compute the full set of many-to-many stable matchings," Mathematical Social Sciences, Elsevier, vol. 47(2), pages 187-210, March.
- Roth, Alvin E, 1984. "Stability and Polarization of Interests in Job Matching," Econometrica, Econometric Society, vol. 52(1), pages 47-57, January.
When requesting a correction, please mention this item's handle: RePEc:pra:mprapa:47031. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Ekkehart Schlicht)
If references are entirely missing, you can add them using this form.