Pareto optimal matchings of students to courses in the presence of prerequisites
Download full text from publisher
References listed on IDEAS
- Monte, Daniel & Tumennasan, Norovsambuu, 2013. "Matching with quorums," Economics Letters, Elsevier, vol. 120(1), pages 14-17.
- 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-2271, August.
- Eric Budish & Estelle Cantillon, 2009. "The Multi-unit Assignment Problem: Theory and Evidence from Course Allocation at Harvard," Working Papers ECARES 2010-02, ULB -- Universite Libre de Bruxelles.
- 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.
- 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.
- Peter C. Fishburn, 1975. "Axioms for Lexicographic Preferences," Review of Economic Studies, Oxford University Press, vol. 42(3), pages 415-419.
- Atila Abdulkadiroglu & Tayfun Sonmez, 1998. "Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems," Econometrica, Econometric Society, vol. 66(3), pages 689-702, May.
- Manea, Mihai, 2007. "Serial dictatorship and Pareto optimality," Games and Economic Behavior, Elsevier, vol. 61(2), pages 316-330, November.
- Franz Diebold & Haris Aziz & Martin Bichler & Florian Matthes & Alexander Schneider, 2014. "Course Allocation via Stable Matching," Business & Information Systems Engineering: The International Journal of WIRTSCHAFTSINFORMATIK, Springer;Gesellschaft für Informatik e.V. (GI), vol. 6(2), pages 97-110, April.
- Craig Boutilier & Britta Dorn & Nicolas Maudet & Vincent Merlin, 2015. "Computational Social Choice: Theory and Applications," Post-Print halshs-01242312, HAL.
- Roth, Alvin E., 1985. "The college admissions problem is not equivalent to the marriage problem," Journal of Economic Theory, Elsevier, vol. 36(2), pages 277-288, August.
- Saban, Daniela & Sethuraman, Jay, 2014. "A note on object allocation under lexicographic preferences," Journal of Mathematical Economics, Elsevier, vol. 50(C), pages 283-289.
- Balinski, Michel & Sonmez, Tayfun, 1999. "A Tale of Two Mechanisms: Student Placement," Journal of Economic Theory, Elsevier, vol. 84(1), pages 73-94, January.
More about this item
Keywordsmany-to-many matching problem; course allocation; additive / lexicographic preferences; polynomial-time algorithm; NP-hardness;
- C63 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Computational Techniques
- C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory
NEP fieldsThis paper has been announced in the following NEP Reports:
- NEP-GTH-2016-04-04 (Game Theory)
StatisticsAccess and download statistics
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:lau:crdeep:16.04. 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: (Michèle Jaccoud Ramseier). General contact details of provider: http://edirc.repec.org/data/deelsch.html .
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.