College admissions with ties and common quotas: Integer programming approach
Admission to universities is organised in a centralised scheme in Hungary. In this paper we investigate two major specialities of this application: ties and common quotas. A tie occur when some students have the same score at a programme. If not enough seats are available for the last tied group of...
Uloženo v:
| Vydáno v: | European journal of operational research Ročník 299; číslo 2; s. 722 - 734 |
|---|---|
| Hlavní autoři: | , , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier B.V
01.06.2022
|
| Témata: | |
| ISSN: | 0377-2217, 1872-6860 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | Admission to universities is organised in a centralised scheme in Hungary. In this paper we investigate two major specialities of this application: ties and common quotas. A tie occur when some students have the same score at a programme. If not enough seats are available for the last tied group of applicants at a programme then there are three reasonable policies used in practice: 1) all must be rejected, as in Hungary 2) all can be accepted, as in Chile 3) a lottery decides which students are accepted from this group, as in Ireland. Even though student-optimal stable matchings can be computed efficiently for each of the above three cases, we developed (mixed) integer programming (IP) formulations for solving these problems, and compared the solutions obtained by the three policies for a real instance of the Hungarian application from 2008. In the case of Hungary common quotas arise from the faculty quotas imposed on their programmes and from the national quotas set for state-financed students in each subject. The overlapping structure of common quotas makes the computational problem of finding a stable solution NP-hard, even for strict rankings. In the case of ties and common quotas we propose two reasonable stable solution concepts for the Hungarian and Chilean policies. We developed (mixed) IP formulations for solving these stable matching problems and tested their performance on the large scale real instance from 2008 and also for one from 2009 under two different assumptions. We demonstrate that the most general case is also solvable in practice by IP technique. |
|---|---|
| AbstractList | Admission to universities is organised in a centralised scheme in Hungary. In this paper we investigate two major specialities of this application: ties and common quotas. A tie occur when some students have the same score at a programme. If not enough seats are available for the last tied group of applicants at a programme then there are three reasonable policies used in practice: 1) all must be rejected, as in Hungary 2) all can be accepted, as in Chile 3) a lottery decides which students are accepted from this group, as in Ireland. Even though student-optimal stable matchings can be computed efficiently for each of the above three cases, we developed (mixed) integer programming (IP) formulations for solving these problems, and compared the solutions obtained by the three policies for a real instance of the Hungarian application from 2008. In the case of Hungary common quotas arise from the faculty quotas imposed on their programmes and from the national quotas set for state-financed students in each subject. The overlapping structure of common quotas makes the computational problem of finding a stable solution NP-hard, even for strict rankings. In the case of ties and common quotas we propose two reasonable stable solution concepts for the Hungarian and Chilean policies. We developed (mixed) IP formulations for solving these stable matching problems and tested their performance on the large scale real instance from 2008 and also for one from 2009 under two different assumptions. We demonstrate that the most general case is also solvable in practice by IP technique. |
| Author | Biró, Péter Jankó, Zsuzsanna Kováts, Endre Ágoston, Kolos Csaba |
| Author_xml | – sequence: 1 givenname: Kolos Csaba surname: Ágoston fullname: Ágoston, Kolos Csaba email: kolos.agoston@uni-corvinus.hu organization: Department of Operations Research and Actuarial Sciences, Corvinus University of Budapest, H-1093, Fővám tér 13-15., Budapest, Hungary – sequence: 2 givenname: Péter orcidid: 0000-0001-7011-3463 surname: Biró fullname: Biró, Péter email: peter.biro@krtk.mta.hu organization: Department of Operations Research and Actuarial Sciences, Corvinus University of Budapest, H-1093, Fővám tér 13-15., Budapest, Hungary – sequence: 3 givenname: Endre surname: Kováts fullname: Kováts, Endre email: endre.kovats.92@gmail.com organization: Budapest University of Technology and Economics, H-1111, Műegyetem rakpart 3., Budapest, Hungary – sequence: 4 givenname: Zsuzsanna surname: Jankó fullname: Jankó, Zsuzsanna email: zsuzsanna.janko@uni-corvinus.hu organization: Department of Operations Research and Actuarial Sciences, Corvinus University of Budapest, H-1093, Fővám tér 13-15., Budapest, Hungary |
| BookMark | eNp9kM1KAzEUhYNUsK2-gKu8wIzJJDNJxY0UfwoFN7oOyZ1Mm2EmqUlUfHun6MpFV4cL57twvgWa-eAtQteUlJTQ5qYvbR9iWZGKlkSWhLEzNKdSVEUjGzJDc8KEKKqKigu0SKknhNCa1nO0XYdhsDuLdTu6lFzwCX-5vMfZ2YS1bzGEcQwev3-ErNMt3vg81SM-xLCLehyd32F9mC4N-0t03ukh2au_XKK3x4fX9XOxfXnarO-3BTDR5IIaBlxaLhphai70ikJnTL0SAIbomjEw0HSkralsuVxJzjsLFTct0ZpaydkSVb9_IYaUou3UIbpRx29FiTr6UL06-lBHH4pINfmYIPkPApd1nhbnqN1wGr37Re006tPZqBI468G2LlrIqg3uFP4Dlo5_jA |
| CitedBy_id | crossref_primary_10_1007_s10100_023_00898_6 crossref_primary_10_1016_j_artint_2023_103855 crossref_primary_10_1016_j_ejor_2022_09_031 crossref_primary_10_1016_j_cor_2025_107002 crossref_primary_10_1016_j_eswa_2025_129099 |
| Cites_doi | 10.1016/j.jet.2016.12.006 10.1257/000282805774670167 10.1016/j.ejor.2019.03.017 10.1086/261272 10.1007/s10878-016-0085-x 10.1016/j.tcs.2010.05.005 10.3390/a7010032 10.1016/j.orp.2018.01.003 10.1257/aer.p20171047 10.2139/ssrn.2478998 10.1007/s00182-005-0215-7 10.1257/aer.89.4.748 10.1016/j.geb.2016.03.003 10.1257/aer.20130929 10.1007/s101070050004 10.1016/j.ejor.2009.06.009 10.1016/j.ejor.2016.12.011 10.1007/s10100-013-0320-9 10.1257/aer.20101552 10.1016/j.ejor.2005.09.014 10.1145/3328526.3329620 10.1016/j.jet.2014.03.004 10.1016/j.ejor.2019.09.006 10.1007/s00453-009-9386-0 10.1007/s00453-018-0493-7 10.1257/000282805774669637 10.1086/687476 10.1016/j.geb.2017.12.016 10.1080/00029890.1962.11989827 10.1017/CCOL052139015X 10.1007/s10878-007-9133-x |
| ContentType | Journal Article |
| Copyright | 2021 The Authors |
| Copyright_xml | – notice: 2021 The Authors |
| DBID | 6I. AAFTH AAYXX CITATION |
| DOI | 10.1016/j.ejor.2021.08.033 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| EISSN | 1872-6860 |
| EndPage | 734 |
| ExternalDocumentID | 10_1016_j_ejor_2021_08_033 S0377221721007232 |
| GrantInformation_xml | – fundername: Hungarian Scientific Research Fund grantid: K129086 funderid: https://doi.org/10.13039/501100003549 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 4.4 457 4G. 5GY 5VS 6I. 6OB 7-5 71M 8P~ 9JN 9JO AAAKF AABNK AACTN AAEDT AAEDW AAFTH AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AARIN AAXUO AAYFN ABAOU ABBOA ABFNM ABFRF ABJNI ABMAC ABUCO ABYKQ ACAZW ACDAQ ACGFO ACGFS ACIWK ACNCT ACRLP ACZNC ADBBV ADEZE ADGUI AEBSH AEFWE AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIGVJ AIKHN AITUG AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM ARUGR AXJTR BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG EO8 EO9 EP2 EP3 F5P FDB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX IHE J1W KOM LY1 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 ROL RPZ RXW SCC SDF SDG SDP SDS SES SPC SPCBC SSB SSD SSV SSW SSZ T5K TAE TN5 U5U XPP ZMT ~02 ~G- 1OL 29G 41~ 9DU AAAKG AAQXK AATTM AAXKI AAYWO AAYXX ABWVN ABXDB ACLOT ACNNM ACRPL ACVFH ADCNI ADIYS ADJOM ADMUD ADNMO ADXHL AEIPS AEUPX AFFNX AFJKZ AFPUW AGQPQ AI. AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS EJD FEDTE FGOYB HVGLF HZ~ R2- SEW VH1 WUQ ~HD |
| ID | FETCH-LOGICAL-c376t-1b3c48e4767b547a91cfbb597ccb0a533cbc6f0d518d489844fec24bd0aa1e843 |
| ISICitedReferencesCount | 7 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000746049900003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0377-2217 |
| IngestDate | Tue Nov 18 20:47:29 EST 2025 Sat Nov 29 07:21:51 EST 2025 Fri Feb 23 02:41:19 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Keywords | Assignment Integer programming College admission Distributional constraints Stable matching |
| Language | English |
| License | This is an open access article under the CC BY-NC-ND license. |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c376t-1b3c48e4767b547a91cfbb597ccb0a533cbc6f0d518d489844fec24bd0aa1e843 |
| ORCID | 0000-0001-7011-3463 |
| OpenAccessLink | https://dx.doi.org/10.1016/j.ejor.2021.08.033 |
| PageCount | 13 |
| ParticipantIDs | crossref_primary_10_1016_j_ejor_2021_08_033 crossref_citationtrail_10_1016_j_ejor_2021_08_033 elsevier_sciencedirect_doi_10_1016_j_ejor_2021_08_033 |
| PublicationCentury | 2000 |
| PublicationDate | 2022-06-01 |
| PublicationDateYYYYMMDD | 2022-06-01 |
| PublicationDate_xml | – month: 06 year: 2022 text: 2022-06-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationTitle | European journal of operational research |
| PublicationYear | 2022 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Biró, van de Klundert, Manlove (bib0020) 2019; 291 Pentico (bib0045) 2007; 176 Kamada, Kojima (bib0036) 2014; 105 Gonczarowski, Y. A., Kovalio, L., Nisan, N., & Romm, A. (2019). Matching for the Israeli “mechinot” gap-year programs: Handling rich diversity requirements. Manlove (bib0042) 2013 Biró, P. (2014b). University admission practices - Hungary. Delorme, García, Gondzio, Kalcsics, Manlove, Pettersson (bib0025) 2019; 277 Roth, A. E., & Sotomayor, M. A. O. (1990). Two-sided matching: a study in game-theoretic modeling and analysis. Cambridge: Econometric Society monographs. Biró, McBride, Manlove (bib0021) 2014; vol. 8504 Chen, L. (2012). University admission practices Ireland. MiP Country Profile 8. Ehlers, Hafalir, Yenmez, Yildirim (bib0028) 2014; 153 Roth (bib0048) 1984; 6 Biró, P. (2014a). Matching practices for secondary schools – Hungary. Azevedo, Leshno (bib0012) 2016; 124 Rios, I., Larroucau, T., Parra, G., & Cominetti, R. (2014). College admissions problem with ties and flexible quotas. Working paper. Abdulkadiroğlu, Pathak, Roth, Sönmez (bib0004) 2005; 95 Abdulkadiroğlu, A., & Ehlers, L. (2007). Controlled school choice. Working paper. Biró (bib0017) 2017 Yokoi (bib0055) 2020; 82 Biró, Fleiner, Irving, Manlove (bib0018) 2010; 411 accessed on 23 August. Garg, Kavitha, Kumar, Mehlhorn, Mestre (bib0032) 2010; 58 Goto, Kojima, Kurata, Tamura, Yokoo (bib0034) 2017; 9 Abdulkadiroğlu, Pathak, Roth (bib0003) 2005; 95 Irving, Manlove (bib0035) 2008; 16 Ágoston, Biró, Szántó (bib0008) 2018; 5 Aygün, O., & Bo, I. (2013). College admission with multidimensional reserves: The Brazilian affirmative action case. Working paper. Baïou, Balinski (bib0013) 2000; 87 Echenique, Yenmez (bib0027) 2015; 105 Gale, Shapley (bib0031) 1962; 69 Ágoston, Biró (bib0005) 2017 Cao, Fragniére, Gautier, Sapin, Widmer (bib0023) 2010; 202 Diebold, Bichler (bib0026) 2017; 260 . Sönmez, T., & Yenmez, B. (2019b). Constitutional implementation of vertical and horizontal reservations in India: A unified mechanism for civil service allocation and college admissions. Working paper. Biró, Kiselgof (bib0019) 2015; 23 Fleiner, Jankó (bib0030) 2014; 7 Kamada, Kojima (bib0037) 2017; 107 Kamada, Kojima (bib0038) 2017; 168 Ágoston, Biró, McBride (bib0007) 2016; 32 Baswana, Chakrabarti, Chandran, Kanoria, Patange (bib0014) 2019 Kwanashie, Manlove (bib0041) 2014 Roth, Peranson (bib0050) 1999; 89 Bo (bib0022) 2016; 97 Abdulkadiroğlu (bib0001) 2005; 33 Wu, Roth (bib0054) 2018; 109 Sönmez, T., & Yenmez, B. (2019a). Affirmative action in india via vertical and horizontal reservations. Working paper. 10.1016/j.ejor.2021.08.033_bib0002 10.1016/j.ejor.2021.08.033_bib0024 10.1016/j.ejor.2021.08.033_bib0046 Kamada (10.1016/j.ejor.2021.08.033_bib0036) 2014; 105 Abdulkadiroğlu (10.1016/j.ejor.2021.08.033_bib0003) 2005; 95 Biró (10.1016/j.ejor.2021.08.033_bib0021) 2014; vol. 8504 Yokoi (10.1016/j.ejor.2021.08.033_bib0055) 2020; 82 Biró (10.1016/j.ejor.2021.08.033_bib0019) 2015; 23 Abdulkadiroğlu (10.1016/j.ejor.2021.08.033_bib0001) 2005; 33 Baïou (10.1016/j.ejor.2021.08.033_bib0013) 2000; 87 Gale (10.1016/j.ejor.2021.08.033_bib0031) 1962; 69 Kwanashie (10.1016/j.ejor.2021.08.033_bib0041) 2014 Ehlers (10.1016/j.ejor.2021.08.033_bib0028) 2014; 153 Irving (10.1016/j.ejor.2021.08.033_bib0035) 2008; 16 Echenique (10.1016/j.ejor.2021.08.033_bib0027) 2015; 105 Wu (10.1016/j.ejor.2021.08.033_bib0054) 2018; 109 Ágoston (10.1016/j.ejor.2021.08.033_bib0007) 2016; 32 Baswana (10.1016/j.ejor.2021.08.033_bib0014) 2019 Bo (10.1016/j.ejor.2021.08.033_bib0022) 2016; 97 Manlove (10.1016/j.ejor.2021.08.033_bib0042) 2013 Azevedo (10.1016/j.ejor.2021.08.033_bib0012) 2016; 124 Abdulkadiroğlu (10.1016/j.ejor.2021.08.033_bib0004) 2005; 95 10.1016/j.ejor.2021.08.033_bib0016 10.1016/j.ejor.2021.08.033_bib0015 Roth (10.1016/j.ejor.2021.08.033_bib0048) 1984; 6 10.1016/j.ejor.2021.08.033_bib0033 Ágoston (10.1016/j.ejor.2021.08.033_bib0005) 2017 10.1016/j.ejor.2021.08.033_bib0010 Fleiner (10.1016/j.ejor.2021.08.033_bib0030) 2014; 7 Roth (10.1016/j.ejor.2021.08.033_bib0050) 1999; 89 Pentico (10.1016/j.ejor.2021.08.033_bib0045) 2007; 176 Biró (10.1016/j.ejor.2021.08.033_bib0018) 2010; 411 Cao (10.1016/j.ejor.2021.08.033_bib0023) 2010; 202 Diebold (10.1016/j.ejor.2021.08.033_bib0026) 2017; 260 Garg (10.1016/j.ejor.2021.08.033_bib0032) 2010; 58 Kamada (10.1016/j.ejor.2021.08.033_bib0037) 2017; 107 10.1016/j.ejor.2021.08.033_bib0053 Biró (10.1016/j.ejor.2021.08.033_bib0020) 2019; 291 10.1016/j.ejor.2021.08.033_bib0052 Delorme (10.1016/j.ejor.2021.08.033_bib0025) 2019; 277 10.1016/j.ejor.2021.08.033_bib0051 Goto (10.1016/j.ejor.2021.08.033_bib0034) 2017; 9 Kamada (10.1016/j.ejor.2021.08.033_bib0038) 2017; 168 Biró (10.1016/j.ejor.2021.08.033_sbref0017) 2017 Ágoston (10.1016/j.ejor.2021.08.033_bib0008) 2018; 5 |
| References_xml | – volume: 124 start-page: 1235 year: 2016 end-page: 1268 ident: bib0012 article-title: A supply and demand framework for two-sided matching markets publication-title: Journal of Political Economy – volume: 32 start-page: 1371 year: 2016 end-page: 1399 ident: bib0007 article-title: Integer programming methods for special college admissions problems publication-title: Journal of Combinatorial Optimization – reference: Biró, P. (2014b). University admission practices - Hungary. – volume: 97 start-page: 54 year: 2016 end-page: 63 ident: bib0022 article-title: Fair implementation of diversity in school choice publication-title: Games and Economic Behavior – volume: 58 start-page: 119 year: 2010 end-page: 136 ident: bib0032 article-title: Assigning papers to referees publication-title: Algorithmica – volume: 277 start-page: 426 year: 2019 end-page: 441 ident: bib0025 article-title: Mathematical models for stable matching problems with ties and incomplete lists publication-title: European Journal of Operational Research – volume: 105 start-page: 67 year: 2014 end-page: 99 ident: bib0036 article-title: Efficient matching under distributional constraints: Theory and applications publication-title: American Economic Review – volume: 168 start-page: 107 year: 2017 end-page: 142 ident: bib0038 article-title: Stability concepts in matching under distributional constraints publication-title: Journal of Economic Theory – volume: 6 start-page: 991 year: 1984 end-page: 1016 ident: bib0048 article-title: The evolution of the labor market for medical interns and residents: A case study in game theory publication-title: Journal of Political Economy – volume: vol. 8504 start-page: 10 year: 2014 end-page: 21 ident: bib0021 article-title: The hospitals/residents problem with couples: Complexity and integer programming models publication-title: Proceedings of SEA 2014: the 13th international symposium on experimental algorithms – reference: Gonczarowski, Y. A., Kovalio, L., Nisan, N., & Romm, A. (2019). Matching for the Israeli “mechinot” gap-year programs: Handling rich diversity requirements. – year: 2013 ident: bib0042 article-title: Algorithms of matching under preferences – reference: Roth, A. E., & Sotomayor, M. A. O. (1990). Two-sided matching: a study in game-theoretic modeling and analysis. Cambridge: Econometric Society monographs. – volume: 33 start-page: 535 year: 2005 end-page: 549 ident: bib0001 article-title: College admissions with affirmative action publication-title: International Journal of Game Theory – volume: 153 start-page: 648 year: 2014 end-page: 683 ident: bib0028 article-title: School choice with controlled choice constraints: Hard bounds versus soft bounds publication-title: Journal of Economic Theory – reference: Rios, I., Larroucau, T., Parra, G., & Cominetti, R. (2014). College admissions problem with ties and flexible quotas. Working paper. – volume: 89 start-page: 748 year: 1999 end-page: 780 ident: bib0050 article-title: The redesign of the matching market for american physicians: Some engineering aspects of economic design publication-title: American Economic Review – volume: 16 start-page: 279 year: 2008 end-page: 292 ident: bib0035 article-title: Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems publication-title: Journal of Combinatorial Optimization – start-page: 323 year: 2019 end-page: 324 ident: bib0014 article-title: Centralized admissions for engineering colleges in India publication-title: Proceedings of EC-2019: the 2019 ACM conference on economics and computation – volume: 202 start-page: 547 year: 2010 end-page: 553 ident: bib0023 article-title: Optimizing the marriage market: An application of the linear assignment model publication-title: European Journal of Operational Research – reference: Sönmez, T., & Yenmez, B. (2019b). Constitutional implementation of vertical and horizontal reservations in India: A unified mechanism for civil service allocation and college admissions. Working paper. – reference: Abdulkadiroğlu, A., & Ehlers, L. (2007). Controlled school choice. Working paper. – reference: Chen, L. (2012). University admission practices Ireland. MiP Country Profile 8. – reference: , accessed on 23 August. – reference: Aygün, O., & Bo, I. (2013). College admission with multidimensional reserves: The Brazilian affirmative action case. Working paper. – start-page: 516 year: 2017 end-page: 522 ident: bib0005 article-title: Modelling preference ties and equal treatment policy publication-title: Proceedings of ECMS 2017: 31st European conference on modelling and simulation – volume: 107 start-page: 200 year: 2017 end-page: 204 ident: bib0037 article-title: Recent developments in matching with constraints publication-title: American Economic Review – start-page: 345 year: 2017 end-page: 373 ident: bib0017 article-title: Applications of matching models under preferences publication-title: Trends in computational social choice – volume: 176 start-page: 774 year: 2007 end-page: 793 ident: bib0045 article-title: Assignment problems: A golden anniversary survey publication-title: European Journal of Operational Research – volume: 82 start-page: 188 year: 2020 end-page: 211 ident: bib0055 article-title: Envy-free matchings with lower quotas publication-title: Algorithmica – reference: Biró, P. (2014a). Matching practices for secondary schools – Hungary. – volume: 23 start-page: 727 year: 2015 end-page: 741 ident: bib0019 article-title: College admissions with stable score-limit publication-title: Central European Journal of Operations Research – volume: 95 start-page: 368 year: 2005 end-page: 371 ident: bib0004 article-title: The Boston public school match publication-title: American Economic Review, Papers and Proceedings – volume: 260 start-page: 268 year: 2017 end-page: 282 ident: bib0026 article-title: Matching with indifferences: A comparison of algorithms in the context of course allocation publication-title: European Journal of Operational Research – volume: 7 start-page: 32 year: 2014 end-page: 59 ident: bib0030 article-title: Choice function-based two-sided markets: Stability, lattice property, path independence and algorithms publication-title: Algorithms – reference: . – volume: 109 start-page: 201 year: 2018 end-page: 211 ident: bib0054 article-title: The lattice of envy-free matchings publication-title: Games and Economic Behavior – volume: 87 start-page: 427 year: 2000 end-page: 439 ident: bib0013 article-title: The stable admissions polytope publication-title: Mathematical Programming – volume: 9 start-page: 226-262 year: 2017 ident: bib0034 article-title: Designing matching mechanisms under general distributional constraints publication-title: American Economic Journal: Microeconomics – volume: 105 start-page: 2679 year: 2015 end-page: 2694 ident: bib0027 article-title: How to control controlled school choice publication-title: American Economic Review – volume: 95 start-page: 364 year: 2005 end-page: 367 ident: bib0003 article-title: The New York City high school match publication-title: American Economic Review, Papers and Proceedings – volume: 291 start-page: 447 year: 2019 end-page: 456 ident: bib0020 article-title: Modelling and optimisation in European kidney exchange programmes publication-title: European Journal of Operational Research – volume: 69 start-page: 9 year: 1962 end-page: 15 ident: bib0031 article-title: College admissions and the stability of marriage publication-title: American Mathematical Monthly – volume: 5 start-page: 59 year: 2018 end-page: 68 ident: bib0008 article-title: Stable project allocation under distributional constraints publication-title: Operations Research Perspectives – volume: 411 start-page: 3136 year: 2010 end-page: 3153 ident: bib0018 article-title: The college admissions problem with lower and common quotas publication-title: Theoretical Computer Science – start-page: 263 year: 2014 end-page: 269 ident: bib0041 article-title: An integer programming approach to the hospitals/residents problem with ties publication-title: Proceedings of OR 2013: the international conference on operations research – reference: Sönmez, T., & Yenmez, B. (2019a). Affirmative action in india via vertical and horizontal reservations. Working paper. – volume: 168 start-page: 107 year: 2017 ident: 10.1016/j.ejor.2021.08.033_bib0038 article-title: Stability concepts in matching under distributional constraints publication-title: Journal of Economic Theory doi: 10.1016/j.jet.2016.12.006 – volume: 95 start-page: 364 issue: 2 year: 2005 ident: 10.1016/j.ejor.2021.08.033_bib0003 article-title: The New York City high school match publication-title: American Economic Review, Papers and Proceedings doi: 10.1257/000282805774670167 – volume: 277 start-page: 426 issue: 2 year: 2019 ident: 10.1016/j.ejor.2021.08.033_bib0025 article-title: Mathematical models for stable matching problems with ties and incomplete lists publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2019.03.017 – ident: 10.1016/j.ejor.2021.08.033_bib0016 – volume: 6 start-page: 991 issue: 4 year: 1984 ident: 10.1016/j.ejor.2021.08.033_bib0048 article-title: The evolution of the labor market for medical interns and residents: A case study in game theory publication-title: Journal of Political Economy doi: 10.1086/261272 – volume: 32 start-page: 1371 issue: 4 year: 2016 ident: 10.1016/j.ejor.2021.08.033_bib0007 article-title: Integer programming methods for special college admissions problems publication-title: Journal of Combinatorial Optimization doi: 10.1007/s10878-016-0085-x – volume: 411 start-page: 3136 year: 2010 ident: 10.1016/j.ejor.2021.08.033_bib0018 article-title: The college admissions problem with lower and common quotas publication-title: Theoretical Computer Science doi: 10.1016/j.tcs.2010.05.005 – volume: vol. 8504 start-page: 10 year: 2014 ident: 10.1016/j.ejor.2021.08.033_bib0021 article-title: The hospitals/residents problem with couples: Complexity and integer programming models – start-page: 516 year: 2017 ident: 10.1016/j.ejor.2021.08.033_bib0005 article-title: Modelling preference ties and equal treatment policy – volume: 7 start-page: 32 issue: 1 year: 2014 ident: 10.1016/j.ejor.2021.08.033_bib0030 article-title: Choice function-based two-sided markets: Stability, lattice property, path independence and algorithms publication-title: Algorithms doi: 10.3390/a7010032 – ident: 10.1016/j.ejor.2021.08.033_bib0010 – start-page: 323 year: 2019 ident: 10.1016/j.ejor.2021.08.033_bib0014 article-title: Centralized admissions for engineering colleges in India – volume: 5 start-page: 59 year: 2018 ident: 10.1016/j.ejor.2021.08.033_bib0008 article-title: Stable project allocation under distributional constraints publication-title: Operations Research Perspectives doi: 10.1016/j.orp.2018.01.003 – volume: 107 start-page: 200 issue: 5 year: 2017 ident: 10.1016/j.ejor.2021.08.033_bib0037 article-title: Recent developments in matching with constraints publication-title: American Economic Review doi: 10.1257/aer.p20171047 – ident: 10.1016/j.ejor.2021.08.033_bib0046 doi: 10.2139/ssrn.2478998 – volume: 33 start-page: 535 issue: 4 year: 2005 ident: 10.1016/j.ejor.2021.08.033_bib0001 article-title: College admissions with affirmative action publication-title: International Journal of Game Theory doi: 10.1007/s00182-005-0215-7 – volume: 9 start-page: 226-262 issue: 2 year: 2017 ident: 10.1016/j.ejor.2021.08.033_bib0034 article-title: Designing matching mechanisms under general distributional constraints publication-title: American Economic Journal: Microeconomics – volume: 89 start-page: 748 year: 1999 ident: 10.1016/j.ejor.2021.08.033_bib0050 article-title: The redesign of the matching market for american physicians: Some engineering aspects of economic design publication-title: American Economic Review doi: 10.1257/aer.89.4.748 – ident: 10.1016/j.ejor.2021.08.033_bib0052 – volume: 97 start-page: 54 year: 2016 ident: 10.1016/j.ejor.2021.08.033_bib0022 article-title: Fair implementation of diversity in school choice publication-title: Games and Economic Behavior doi: 10.1016/j.geb.2016.03.003 – ident: 10.1016/j.ejor.2021.08.033_bib0002 – volume: 105 start-page: 2679 issue: 8 year: 2015 ident: 10.1016/j.ejor.2021.08.033_bib0027 article-title: How to control controlled school choice publication-title: American Economic Review doi: 10.1257/aer.20130929 – volume: 87 start-page: 427 issue: 3 year: 2000 ident: 10.1016/j.ejor.2021.08.033_bib0013 article-title: The stable admissions polytope publication-title: Mathematical Programming doi: 10.1007/s101070050004 – volume: 202 start-page: 547 issue: 2 year: 2010 ident: 10.1016/j.ejor.2021.08.033_bib0023 article-title: Optimizing the marriage market: An application of the linear assignment model publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2009.06.009 – volume: 260 start-page: 268 issue: 1 year: 2017 ident: 10.1016/j.ejor.2021.08.033_bib0026 article-title: Matching with indifferences: A comparison of algorithms in the context of course allocation publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2016.12.011 – volume: 23 start-page: 727 issue: 4 year: 2015 ident: 10.1016/j.ejor.2021.08.033_bib0019 article-title: College admissions with stable score-limit publication-title: Central European Journal of Operations Research doi: 10.1007/s10100-013-0320-9 – volume: 105 start-page: 67 issue: 1 year: 2014 ident: 10.1016/j.ejor.2021.08.033_bib0036 article-title: Efficient matching under distributional constraints: Theory and applications publication-title: American Economic Review doi: 10.1257/aer.20101552 – volume: 176 start-page: 774 year: 2007 ident: 10.1016/j.ejor.2021.08.033_bib0045 article-title: Assignment problems: A golden anniversary survey publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2005.09.014 – ident: 10.1016/j.ejor.2021.08.033_bib0033 doi: 10.1145/3328526.3329620 – volume: 153 start-page: 648 year: 2014 ident: 10.1016/j.ejor.2021.08.033_bib0028 article-title: School choice with controlled choice constraints: Hard bounds versus soft bounds publication-title: Journal of Economic Theory doi: 10.1016/j.jet.2014.03.004 – volume: 291 start-page: 447 issue: 2 year: 2019 ident: 10.1016/j.ejor.2021.08.033_bib0020 article-title: Modelling and optimisation in European kidney exchange programmes publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2019.09.006 – volume: 58 start-page: 119 issue: 1 year: 2010 ident: 10.1016/j.ejor.2021.08.033_bib0032 article-title: Assigning papers to referees publication-title: Algorithmica doi: 10.1007/s00453-009-9386-0 – volume: 82 start-page: 188 year: 2020 ident: 10.1016/j.ejor.2021.08.033_bib0055 article-title: Envy-free matchings with lower quotas publication-title: Algorithmica doi: 10.1007/s00453-018-0493-7 – volume: 95 start-page: 368 issue: 2 year: 2005 ident: 10.1016/j.ejor.2021.08.033_bib0004 article-title: The Boston public school match publication-title: American Economic Review, Papers and Proceedings doi: 10.1257/000282805774669637 – start-page: 345 year: 2017 ident: 10.1016/j.ejor.2021.08.033_sbref0017 article-title: Applications of matching models under preferences – ident: 10.1016/j.ejor.2021.08.033_bib0015 – volume: 124 start-page: 1235 issue: 5 year: 2016 ident: 10.1016/j.ejor.2021.08.033_bib0012 article-title: A supply and demand framework for two-sided matching markets publication-title: Journal of Political Economy doi: 10.1086/687476 – volume: 109 start-page: 201 year: 2018 ident: 10.1016/j.ejor.2021.08.033_bib0054 article-title: The lattice of envy-free matchings publication-title: Games and Economic Behavior doi: 10.1016/j.geb.2017.12.016 – start-page: 263 year: 2014 ident: 10.1016/j.ejor.2021.08.033_bib0041 article-title: An integer programming approach to the hospitals/residents problem with ties – ident: 10.1016/j.ejor.2021.08.033_bib0053 – volume: 69 start-page: 9 issue: 1 year: 1962 ident: 10.1016/j.ejor.2021.08.033_bib0031 article-title: College admissions and the stability of marriage publication-title: American Mathematical Monthly doi: 10.1080/00029890.1962.11989827 – ident: 10.1016/j.ejor.2021.08.033_bib0051 doi: 10.1017/CCOL052139015X – ident: 10.1016/j.ejor.2021.08.033_bib0024 – year: 2013 ident: 10.1016/j.ejor.2021.08.033_bib0042 – volume: 16 start-page: 279 issue: 3 year: 2008 ident: 10.1016/j.ejor.2021.08.033_bib0035 article-title: Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems publication-title: Journal of Combinatorial Optimization doi: 10.1007/s10878-007-9133-x |
| SSID | ssj0001515 |
| Score | 2.4539165 |
| Snippet | Admission to universities is organised in a centralised scheme in Hungary. In this paper we investigate two major specialities of this application: ties and... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 722 |
| SubjectTerms | Assignment College admission Distributional constraints Integer programming Stable matching |
| Title | College admissions with ties and common quotas: Integer programming approach |
| URI | https://dx.doi.org/10.1016/j.ejor.2021.08.033 |
| Volume | 299 |
| WOSCitedRecordID | wos000746049900003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1872-6860 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001515 issn: 0377-2217 databaseCode: AIEXJ dateStart: 19950105 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1db9MwFLXKhtB44KOAGF_yA29VpiZxYpu3MQ0BQxMSQ6p4iWzHmVZGujVpNfHX-HNc59pptcEESLxElVWnTu6pfX18z72EvMx1rmNbqUiVchwxm6SRzDmLsiqTonKJKLnqik3ww0MxmciPg8GPoIVZnvK6FhcX8uy_mhrawNhOOvsX5u5vCg3wGYwOVzA7XP_I8IEKUCWYsOni3JBshT1xULHBYEbni1mruoA4xwo68a-P1frW6RZ9rvHfMvfei4WGeeATfeKgnmB2h_AiPp41PkT_ACbaZrTXKL1iAU66o_rXaefN4qn9WsDwwWzZtcUtqiZc9GUf86Pqr6u-X5rF90bVWAs80BiwA-7DrZBbu6KvQU0X51GSoLpzx-IULXgS5QKrEIQ5PMEqSx6sydqMzFH27Bd3jszplXUDKYzpjp3OXJLYBPO6YoqOS_m4P7lBuTElLsAEHNIbZDPhmYQpdXP33f7kfe8IOF-xO8TyD-E1WxheePmXfu0Xrfk6R_fIHb9JobsIrvtkYOshuRU0EkNyN9QCoX5pGJLba4ktH5APHoR0BULqQEgdCCmAkCIIKYLwFfUQpGsQpAGCD8nnN_tHe28jX7cjMrBctVGsU8OEZTznOmNcydhUWsPO1Rg9VrC_MNrk1bjMYlEyIQVjlTUJ0-VYqdgKlj4iG_Wsto8JdSS9FVra0uRM5UZzW1q4h2SZhLWHbZM4vLXC-KT2rrbKaRGiF6eFe9OFe9OFK7iapttk1Pc5w5Qu1347C8YovFOKzmYB2Lmm35N_7PeUbK3-Hs_IRjtf2Ofkplm2J838hYfYT_A5r6Y |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=College+admissions+with+ties+and+common+quotas%3A+Integer+programming+approach&rft.jtitle=European+journal+of+operational+research&rft.au=%C3%81goston%2C+Kolos+Csaba&rft.au=Bir%C3%B3%2C+P%C3%A9ter&rft.au=Kov%C3%A1ts%2C+Endre&rft.au=Jank%C3%B3%2C+Zsuzsanna&rft.date=2022-06-01&rft.pub=Elsevier+B.V&rft.issn=0377-2217&rft.eissn=1872-6860&rft.volume=299&rft.issue=2&rft.spage=722&rft.epage=734&rft_id=info:doi/10.1016%2Fj.ejor.2021.08.033&rft.externalDocID=S0377221721007232 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0377-2217&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0377-2217&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0377-2217&client=summon |