The College Admissions problem with lower and common quotas-Reference-Cited by-同舟云学术

The College Admissions problem with lower and common quotas

Published:2010-07 Issue:34-36 Volume:411 Page:3136-3153
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Biró Péter,Fleiner Tamás,Irving Robert W.,Manlove David F.

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference24 articles.

1. The New York City high school match;Abdulkadiroğlu;American Economic Review, Papers and Proceedings,2005

2. The Boston public school match;Abdulkadiroğlu;American Economic Review, Papers and Proceedings,2005

3. Two algorithms for the student–project allocation problem;Abraham;Journal of Discrete Algorithms,2007

4. A tale of two mechanisms: student placement;Balinski;Journal of Economic Theory,1999

5. P. Biró, Student admissions in Hungary as Gale and Shapley envisaged. Technical Report, No. TR-2008-291, University of Glasgow, Department of Computing Science, 2008.

Cited by 112 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. "Smart University" project: fair matching of students to academic trajectories;Proceedings of Voronezh State University Series: Economics and management;2024-03-31

2. Refined computational complexities of Hospitals/Residents problem with regional caps;Theoretical Computer Science;2024-03

3. Identifying the most important facilitators of open research data sharing and reuse in Epidemiology: A mixed-methods study;PLOS ONE;2024-02-08

4. Strategyproof and fair matching mechanism for union of symmetric m-convex constraints;PLOS ONE;2024-02-08

5. Efficient and Strategy-proof Mechanism under General Constraints;SSRN Electronic Journal;2024