Advanced Search
MyIDEAS: Login to save this paper or follow this series

College admissions with stable score-limits

Contents:

Author Info

  • Peter Biro

    ()
    (Institute of Economics Research Centre for Economic and Regional Studies Hungarian Academy of Sciences)

  • Sofya Kiselgof

    ()
    (Postgraduate Student, Lecturer Laboratory of Decision Choice and Analysis (DecAn), NRU Higher School of Economics, Moscow, Russia)

Abstract

A common feature of the Hungarian, Irish, Spanish and Turkish higher education admission systems is that the students apply for programmes and they are ranked according to their scores. Students who apply for a programme with the same score are in a tie. Ties are broken by lottery in Ireland, by objective factors in Turkey (such as date of birth) and other precisely defined rules in Spain. In Hungary, however, an equal treatment policy is used, students applying for a programme with the same score are all accepted or rejected together. In such a situation there is only one question to decide, whether or not to admit the last group of applicants with the same score who are at the boundary of the quota. Both concepts can be described in terms of stable score-limits. The strict rejection of the last group with whom a quota would be violated corresponds to the concept of H-stable (i.e. higher-stable) score-limits that is currently used in Hungary. We call the other solutions based on the less strict admission policy as L-stable (i.e. lower-stable) score-limits. We show that the natural extensions of the Gale-Shapley algorithms produce stable score-limits, moreover, the applicant-oriented versions result in the lowest score-limits (thus optimal for students) and the college-oriented versions result in the highest score-limits with regard to each concept. When comparing the applicant-optimal H-stable and L-stable score-limits we prove that the former limits are always higher for every college. Furthermore, these two solutions provide upper and lower bounds for any solution arising from a tie-breaking strategy. Finally we show that both the H-stable and the L-stable applicant-proposing score-limit algorithms are manipulable.

Download Info

If 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.
File URL: http://econ.core.hu/file/download/mtdp/MTDP1306.pdf
Download Restriction: no

Bibliographic Info

Paper provided by Institute of Economics, Centre for Economic and Regional Studies, Hungarian Academy of Sciences in its series IEHAS Discussion Papers with number 1306.

as in new window
Length: 20 pages
Date of creation: Jan 2013
Date of revision:
Handle: RePEc:has:discpr:1306

Contact details of provider:
Postal: 1112 Budapest, Budaorsi ut 45.
Phone: (+36-1) 309-2652
Fax: (36-1) 319-3136
Web page: http://econ.core.hu
More information through EDIRC

Related research

Keywords: college admissions; stable matching; mechanism design;

Find related papers by JEL classification:

References

References listed on IDEAS
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.:
as in new window
  1. Alvin E. Roth & Elliott Peranson, 1999. "The Redesign of the Matching Market for American Physicians: Some Engineering Aspects of Economic Design," NBER Working Papers 6963, National Bureau of Economic Research, Inc.
  2. Caterina Calsamiglia & Guillaume Haeringer & Flip Klijn, 2008. "Constrained School Choice: An Experimental Study," Working Papers 365, Barcelona Graduate School of Economics.
  3. Fuhito Kojima & Parag A. Pathak, 2009. "Incentives and Stability in Large Two-Sided Matching Markets," American Economic Review, American Economic Association, vol. 99(3), pages 608-27, June.
  4. 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.
  5. Antonio Romero-Medina, 1998. "Implementation of stable solutions in a restricted matching market," Review of Economic Design, Springer, vol. 3(2), pages 137-147.
  6. Sebastian Braun & Nadja Dwenger & Dorothea Kübler, 2007. "Telling the Truth May Not Pay Off: An Empirical Study of Centralised University Admissions in Germany," SFB 649 Discussion Papers SFB649DP2007-070, Sonderforschungsbereich 649, Humboldt University, Berlin, Germany.
  7. Roth, Alvin E, 1984. "The Evolution of the Labor Market for Medical Interns and Residents: A Case Study in Game Theory," Journal of Political Economy, University of Chicago Press, vol. 92(6), pages 991-1016, December.
  8. Paul Milgrom, 2003. "Matching with Contracts," Working Papers 03003, Stanford University, Department of Economics.
  9. Sebastian Braun & Nadja Dwenger & Dorothea Kübler, 2007. "Telling the Truth May Not Pay Off," Discussion Papers of DIW Berlin 759, DIW Berlin, German Institute for Economic Research.
  10. Balinski, Michel & Sonmez, Tayfun, 1999. "A Tale of Two Mechanisms: Student Placement," Journal of Economic Theory, Elsevier, vol. 84(1), pages 73-94, January.
  11. Péter Biró & Flip Klijn, 2013. "Matching With Couples: A Multidisciplinary Survey," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 15(02), pages 1340008-1-1.
  12. Sönmez, Tayfun & Pathak, Parag A. & Abdulkadiroglu, Atila & Roth, Alvin, 2005. "The Boston Public School Match," Scholarly Articles 2562764, Harvard University Department of Economics.
  13. Roth, Alvin E, 1984. "Stability and Polarization of Interests in Job Matching," Econometrica, Econometric Society, vol. 52(1), pages 47-57, January.
  14. Chung-Piaw Teo & Jay Sethuraman & Wee-Peng Tan, 2001. "Gale-Shapley Stable Marriage Problem Revisited: Strategic Issues and Applications," Management Science, INFORMS, vol. 47(9), pages 1252-1267, September.
Full references (including those not matched with items on IDEAS)

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
  1. Peter Biro & Tamas Fleiner & Rob Irving, 2013. "Matching Couples with Scarf's Algorithm," IEHAS Discussion Papers 1330, Institute of Economics, Centre for Economic and Regional Studies, Hungarian Academy of Sciences.

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:has:discpr:1306. 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: (Adrienn Foldi).

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 references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link 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 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.