IDEAS home Printed from https://ideas.repec.org/a/vrs/ecothe/v57y2019i4p511-526n7.html
   My bibliography  Save this article

The Review of Methods for Assignment of Elective Courses at Universities

Author

Listed:
  • Trifunović Dejan

    (University of Belgrade, Faculty of Economics, Republic of Serbia)

Abstract

In this paper we present a review of matching algorithms that are used for matching students with elective courses at universities. This is an example of a market where price mechanism cannot be used to determine the equilibrium allocation. In the Random Serial Dictatorship students select courses based on their position in a random queue. This mechanism is not ex post Pareto-efficient and its drawback is overcome in the Probabilistic Serial Assignment, although this mechanism is not strategy-proof. In the auction mechanism, students’ bids for courses do not represent their true preferences, since bids depend on their beliefs about the popularity of courses. The efficient allocation is obtained when Deferred Acceptance Algorithm is used - where the priority of students is determined based on their bids. Harvard draft mechanism is based on changing the order of students in the random queue from one round to another and this mechanism is not strategy-proof; however, it is, by all means, better for students than Random Serial Dictatorship. The Wharton Business School mechanism is based on the calculation of approximate competitive equilibrium.

Suggested Citation

  • Trifunović Dejan, 2019. "The Review of Methods for Assignment of Elective Courses at Universities," Economic Themes, Sciendo, vol. 57(4), pages 511-526, December.
    • Handle: RePEc:vrs:ecothe:v:57:y:2019:i:4:p:511-526:n:7
    DOI: 10.2478/ethemes-2019-0029
    as

    Download full text from publisher

    File URL: https://doi.org/10.2478/ethemes-2019-0029
    Download Restriction: no
    File URL: https://libkey.io/10.2478/ethemes-2019-0029?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Tayfun Sönmez & Alvin E. Roth & M. Utku Ünver, 2007. "Efficient Kidney Exchange: Coincidence of Wants in Markets with Compatibility-Based Preferences," American Economic Review, American Economic Association, vol. 97(3), pages 828-851, June.
    2. Yeon-Koo Che & Fuhito Kojima, 2010. "Asymptotic Equivalence of Probabilistic Serial and Random Priority Mechanisms," Econometrica, Econometric Society, vol. 78(5), pages 1625-1672, September.
    3. 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.
    4. Alvin E. Roth & Tayfun Sönmez & M. Utku Ünver, 2004. "Kidney Exchange," The Quarterly Journal of Economics, President and Fellows of Harvard College, vol. 119(2), pages 457-488.
    5. Erdil, Aytek, 2014. "Strategy-proof stochastic assignment," Journal of Economic Theory, Elsevier, vol. 151(C), pages 146-162.
    6. Tayfun Sönmez & M. Utku Ünver, 2010. "Course Bidding At Business Schools," International Economic Review, Department of Economics, University of Pennsylvania and Osaka University Institute of Social and Economic Research Association, vol. 51(1), pages 99-123, February.
    7. Hugh-Jones, David & Kurino, Morimitsu & Vanberg, Christoph, 2014. "An experimental study on the incentives of the probabilistic serial mechanism," Games and Economic Behavior, Elsevier, vol. 87(C), pages 367-380.
    8. Bogomolnaia, Anna & Moulin, Herve, 2001. "A New Solution to the Random Assignment Problem," Journal of Economic Theory, Elsevier, vol. 100(2), pages 295-328, October.
    9. Atila Abdulkadiroglu & Parag A. Pathak & Alvin E. Roth, 2009. "Strategy-Proofness versus Efficiency in Matching with Indifferences: Redesigning the NYC High School Match," American Economic Review, American Economic Association, vol. 99(5), pages 1954-1978, December.
    10. Roth, Alvin E, 1986. "On the Allocation of Residents to Rural Hospitals: A General Property of Two-Sided Matching Markets," Econometrica, Econometric Society, vol. 54(2), pages 425-427, March.
    11. Eric Budish, 2011. "The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes," Journal of Political Economy, University of Chicago Press, vol. 119(6), pages 1061-1103.
    12. Eric Budish & Judd Kessler, 2016. "Bringing Real Market Participants' Real Preferences into the Lab: An Experiment that Changed the Course Allocation Mechanism at Wharton," Working Papers id:11135, eSocialSciences.
    13. Elliott Peranson & Alvin E. Roth, 1999. "The Redesign of the Matching Market for American Physicians: Some Engineering Aspects of Economic Design," American Economic Review, American Economic Association, vol. 89(4), pages 748-780, September.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Scott Duke Kominers & Alexander Teytelboym & Vincent P Crawford, 2017. "An invitation to market design," Oxford Review of Economic Policy, Oxford University Press and Oxford Review of Economic Policy Limited, vol. 33(4), pages 541-571.
    2. 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.
    3. Kojima, Fuhito, 2013. "Efficient resource allocation under multi-unit demand," Games and Economic Behavior, Elsevier, vol. 82(C), pages 1-14.
    4. Anno, Hidekazu & Kurino, Morimitsu, 2016. "On the operation of multiple matching markets," Games and Economic Behavior, Elsevier, vol. 100(C), pages 166-185.
    5. Kyle Greenberg & Parag A. Pathak & Tayfun Sönmez, 2020. "Mechanism Design meets Priority Design: Redesigning the US Army’s Branching Process Through Market Design," Boston College Working Papers in Economics 1035, Boston College Department of Economics.
    6. Kyle Greenberg & Parag A. Pathak & Tayfun Sonmez, 2021. "Mechanism Design meets Priority Design: Redesigning the US Army's Branching Process," Papers 2106.06582, arXiv.org.
    7. Miralles, Antonio & Pycia, Marek, 2021. "Foundations of pseudomarkets: Walrasian equilibria for discrete resources," Journal of Economic Theory, Elsevier, vol. 196(C).
    8. Alvin E. Roth, 2010. "Marketplace Institutions Related to the Timing of Transactions," NBER Working Papers 16556, National Bureau of Economic Research, Inc.
    9. Alvin Roth, 2008. "Deferred acceptance algorithms: history, theory, practice, and open questions," International Journal of Game Theory, Springer;Game Theory Society, vol. 36(3), pages 537-569, March.
    10. John Kennes & Daniel Monte & Norovsambuu Tumennasan, 2015. "Dynamic Matching Markets and the Deferred Acceptance Mechanism," Economics Working Papers 2015-23, Department of Economics and Business Economics, Aarhus University.
    11. Tayfun Sönmez & Tobias B. Switzer, 2013. "Matching With (Branch‐of‐Choice) Contracts at the United States Military Academy," Econometrica, Econometric Society, vol. 81(2), pages 451-488, March.
    12. Sönmez, Tayfun & Ünver, M. Utku & Yılmaz, Özgür, 2018. "How (not) to integrate blood subtyping technology to kidney exchange," Journal of Economic Theory, Elsevier, vol. 176(C), pages 193-231.
    13. Charness, Gary & Kuhn, Peter, 2011. "Lab Labor: What Can Labor Economists Learn from the Lab?," Handbook of Labor Economics, in: O. Ashenfelter & D. Card (ed.), Handbook of Labor Economics, edition 1, volume 4, chapter 3, pages 229-330, Elsevier.
    14. Haluk Ergin & Tayfun Sönmez & M. Utku Ünver, 2020. "Efficient and Incentive‐Compatible Liver Exchange," Econometrica, Econometric Society, vol. 88(3), pages 965-1005, May.
    15. Onur Kesten & Morimitsu Kurino & Alexander S. Nesterov, 2017. "Efficient lottery design," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 48(1), pages 31-57, January.
    16. Tayfun Sönmez, 2013. "Bidding for Army Career Specialties: Improving the ROTC Branching Mechanism," Journal of Political Economy, University of Chicago Press, vol. 121(1), pages 186-219.
    17. Haluk Ergin & Tayfun Sönmez & M. Utku Ünver, 2017. "Dual‐Donor Organ Exchange," Econometrica, Econometric Society, vol. 85, pages 1645-1671, September.
    18. Fragiadakis, Daniel E. & Troyan, Peter, 2019. "Designing mechanisms to focalize welfare-improving strategies," Games and Economic Behavior, Elsevier, vol. 114(C), pages 232-252.
    19. Aygün, Orhan & Turhan, Bertan, 2021. "How to De-reserve Reserves," ISU General Staff Papers 202103100800001123, Iowa State University, Department of Economics.
    20. Marek Pycia & Peter Troyan, 2021. "A theory of simplicity in games and mechanism design," ECON - Working Papers 393, Department of Economics - University of Zurich.

    More about this item

    Keywords

    Random serial dictatorship; probabilistic serial assignment; auctions; deferred acceptance algorithm; Harvard draft mechanism; Wharton business school mechanism;
    All these keywords.

    JEL classification:

    • C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory

    Statistics

    Access and download statistics

    Corrections

    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:vrs:ecothe:v:57:y:2019:i:4:p:511-526:n:7. See general information about how to correct material in RePEc.

    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 CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Peter Golla (email available below). General contact details of provider: https://www.sciendo.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.