Jump to content

Course allocation

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Erel Segal (talk | contribs) at 12:42, 13 November 2020 (https://pubsonline.informs.org/doi/abs/10.1287/opre.2016.1544). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Course allocation is the problem of allocating seats in university courses among students. [1][2][3][4][5][6][7][8][9][10][11][12][13][14][15]

References

  1. ^ Othman, Abraham; Sandholm, Tuomas; Budish, Eric (2010-05-10). "Finding approximate competitive equilibria: efficient and fair course allocation". Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1. AAMAS '10. Toronto, Canada: International Foundation for Autonomous Agents and Multiagent Systems: 873–880. doi:10.5555/1838206.1838323. ISBN 978-0-9826571-1-9. {{cite journal}}: Check |doi= value (help)
  2. ^ Budish, Eric; Cantillon, Estelle (2012-08-01). "The Multi-unit Assignment Problem: Theory and Evidence from Course Allocation at Harvard". American Economic Review. 102 (5): 2237–2271. doi:10.1257/aer.102.5.2237. ISSN 0002-8282.
  3. ^ Budish, Eric; Cachon, Gérard P.; Kessler, Judd B.; Othman, Abraham (2016-10-28). "Course Match: A Large-Scale Implementation of Approximate Competitive Equilibrium from Equal Incomes for Combinatorial Allocation". Operations Research. 65 (2): 314–336. doi:10.1287/opre.2016.1544. ISSN 0030-364X.
  4. ^ Budish, Eric; Che, Yeon-Koo; Kojima, Fuhito; Milgrom, Paul (2013-04-01). "Designing Random Allocation Mechanisms: Theory and Applications". American Economic Review. 103 (2): 585–623. doi:10.1257/aer.103.2.585. ISSN 0002-8282.
  5. ^ Budish, Eric; Kessler, Judd B. (2016-07-25). "Can Market Participants Report their Preferences Accurately (Enough)?". {{cite journal}}: Cite journal requires |journal= (help)
  6. ^ Budish, Eric (2011-12). "The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes". Journal of Political Economy. 119 (6): 1061–1103. doi:10.1086/664613. ISSN 0022-3808. {{cite journal}}: Check date values in: |date= (help)
  7. ^ Budish, Eric; Cantillon, Estelle (2007). Cramton, Peter; Müller, Rudolf; Tardos, Eva; Tennenholtz, Moshe (eds.). "Strategic Behavior in Multi-unit Assignment Problems: Theory and Evidence from Course Allocations". Computational Social Systems and the Internet. Dagstuhl Seminar Proceedings. Dagstuhl, Germany: Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany.
  8. ^ Budish, Eric B.; Kessler, Judd B. (2017-11-12). "Can Agents 'Report Their Types'? An Experiment that Changed the Course Allocation Mechanism at Wharton". Rochester, NY. {{cite journal}}: Cite journal requires |journal= (help)
  9. ^ Budish, Eric (2012-12-01). "Matching "versus" mechanism design". ACM SIGecom Exchanges. 11 (2): 4–15. doi:10.1145/2509002.2509005.
  10. ^ Kominers, Scott Duke; Ruberry, Mike; Ullman, Jonathan (2010). Saberi, Amin (ed.). "Course Allocation by Proxy Auction". Internet and Network Economics. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer: 551–558. doi:10.1007/978-3-642-17572-5_49. ISBN 978-3-642-17572-5.
  11. ^ Hoshino, Richard; Raible-Clark, Caleb (2014-07-27). "The quest draft: an automated course allocation algorithm". Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence. AAAI'14. Québec City, Québec, Canada: AAAI Press: 2906–2913. doi:10.5555/2892753.2892954. {{cite journal}}: Check |doi= value (help)
  12. ^ Diebold, Franz; Aziz, Haris; Bichler, Martin; Matthes, Florian; Schneider, Alexander (2014-04-01). "Course Allocation via Stable Matching". Business & Information Systems Engineering. 6 (2): 97–110. doi:10.1007/s12599-014-0316-6. ISSN 1867-0202.
  13. ^ Diebold, Franz; Bichler, Martin (2017-07-01). "Matching with indifferences: A comparison of algorithms in the context of course allocation". European Journal of Operational Research. 260 (1): 268–282. doi:10.1016/j.ejor.2016.12.011. ISSN 0377-2217.
  14. ^ Atef Yekta, Hoda; Day, Robert (2020-01-13). "Optimization-based Mechanisms for the Course Allocation Problem". INFORMS Journal on Computing. 32 (3): 641–660. doi:10.1287/ijoc.2018.0849. ISSN 1091-9856.
  15. ^ Li, Mengling (2020-10-01). "Ties matter: Improving efficiency in course allocation by allowing ties". Journal of Economic Behavior & Organization. 178: 354–384. doi:10.1016/j.jebo.2020.07.030. ISSN 0167-2681.
Retrieved from "https://en.wikipedia.org/w/index.php?title=Course_allocation&oldid=988478247"