Abdulkadiroǧlu, A. (2005). College admissions with affirmative action. International Journal of Game Theory, 33(4), 535–549. http://doi.org/10.1007/s00182-005-0215-7
Abdulkadiroǧlu, A., Pathak, P. a, & Roth, E. (2006). Strategy-proofness versus Efficiency in Matching with Indifferences : Redesigning the NYC High School Match. The New York Times, 1–28. http://doi.org/10.1257/aer.99.5.1954
Abdulkadiroǧlu, A., & Sönmez, T. (2003). School choice: A mechanism design approach. American Economic Review, 93(3), 729–747. http://doi.org/10.1257/000282803322157061
Abdulkadiroğlu, A., & Sönmez, T. (2013). Matching Markets: Theory and Practice. In Daron Acemoglu, Manuel Arellano, & Eddie Dekel (Red.), Advances in economics and econometrics (1ste ed., pp. 3–47). Cambridge University Press. Geraadpleegd van http://dx.doi.org/10.1017/CBO9781139060011.002
Alsteens, L. (2016, februari 11). Betere sociale mix helpt alle leerlingen vooruit. De Standaard.
Ashlagi, I., & Nikzad, A. (2016). What matters in school choice tie-breaking? How competition guides design.
Belga. (2015a). Antwerps onderwijs heeft binnen 10 jaar 15.000 extra plaatsen nodig. De Morgen.
Belga. (2015b, september 15). Duizenden leerlingen geweigerd op school. Het Laatste Nieuws.
Bertsimas, D., & Tsitsiklis, J. (1997). Introduction to Linear Optimization (1ste ed.). Massachusetts: Athena Scientific.
Bezem, G. J., & van Leeuwen, J. (1987). Enumeration in graphs. Utrecht.
Biro, P., & McBride, I. (2014). Integer programming methods for special college admissions problems. Computer Science and Game Theory.
Budish, E. (2012). Matching “versus” mechanism design. ACM SIGecom Exchanges, 11(2), 4–15. http://doi.org/10.1145/2509002.2509005
Burkard, R., Dell’Amico, M., & Martello, S. (2009). Assignment Problems. Philadelphia, PA, USA: Society for Industrial and Applied Mathematics.
Cantillon, E. (2009). School choice in Brussels Dutch-speaking preschools : Evaluation of the effect of the use of a distance-based tie-breaker. Onderzoeksrapport voor LOP Brussels Hoofdstedelijk Gewest BASIS. Brussel.
Caron, G., Hansen, P., & Jaumard, B. (1999). The Assignment Problem with Seniority and Job Priority Constraints. Operations Research, 47(3), 449–453. http://doi.org/10.1287/opre.47.3.449
Dogan, B. (2015). Responsive Affirmative Action in School Choice (Cahiers de Recherches Economiques du Département d’Econométrie et d'Economie politique (DEEP No. 15.02). Lausanne.
Dubins, L. E., & Freedman, D. A. (1981). Machiavelli and the Gale-Shapley Algorithm. The American Mathematical Monthly, 88(7), 485–494.
Dur, U., Hammond, R. G., & Morrill, T. (2015). The Secure Boston Mechanism: Theory and Experiments.
Ehlers, L. (2006). Respecting Priorities when Assigning Students to Schools. Montréal, Québec, Canada: University of Montreal.
Erdil, A., & Ergin, H. (2008). What’s the matter with tie-breaking? Improving efficiency in school choice. American Economic Review, 98(3), 669–689. http://doi.org/10.1257/aer.98.3.669
Gale, D., & Shapley, L. S. (1962). College Admissions and the Stability of Marriage. The American Mathematical Monthly, 69(1), 9–15. http://doi.org/10.4236/tel.2012.23054
Gautier, P., De Haan, M., van der Klaauw, B., & Oosterbeek, H. (2014). Schoolkeuze Voorgezet Onderwijs in Amsterdam : Verslag van een Simulatiestudie. Amsterdam.
Groenez, S., & Surkyn, J. (2015). Een capaciteitsmonitor voor het leerplichtonderwijs.
Gusfield, D., & Irving, R. W. (1989). The stable marriage problem: structure and algorithms. Cambridge, MA, USA: MIT Press.
Haas, C. (2014). Incentives and Two-Sided Matching. Karlsruhe Institute of Technology.
Haeringer, G., & Klijn, F. (2009). Constrained school choice. Journal of Economic Theory, 144(5), 1921–1947. http://doi.org/10.1016/j.jet.2009.05.002
Hafalir, I. E., Yenmez, M. B., & Yildirim, M. a. (2013). Effective affirmative action in school choice. Theoretical Economics, 8(2), 325–363. http://doi.org/10.3982/TE1135
Halldórsson, M., Irving, R. W., Iwama, K., Manlove, D. F., Miyazaki, S., Morita, Y., & Scott, S. (2003). Approximability Results for Stable Marriage Problems with Ties.
Hatfield, J. W., & Kojima, F. (2009). Group incentive compatibility for matching with contracts. Games and Economic Behavior, 67(2), 745–749. http://doi.org/10.1016/j.geb.2009.01.007
Irving, R. W. (1994). Stable marriage and indifference. Discrete Applied Mathematics, 48(3), 261–272. http://doi.org/10.1016/0166-218X(92)00179-P
Irving, R. W., & Leather, P. (1986). The Complexity of Counting Stable Marriages. SIAM Journal on Computing, 15(3), 655–667. http://doi.org/10.1137/0215048
Johnson, D. B. (1975). Finding All the Elementary Circuits of a Directed Graph. SIAM Journal on Computing, 4(1), 77–84. http://doi.org/10.1137/0204007
Kesten, O. (2004). Student Placement to Public Schools in US : Two New Solutions. Rochester.
Kesten, O. (2010). school choice with consent. The Quarterly Journal of Economics, (August), 1297–1348. http://doi.org/10.1162/qjec.2010.125.3.1297
Klein, F., Pais, J., & Vorsatz, M. (2014). Affirmative Action through Minority Reserves : An Experimental Study on School Choice, 1–40.
Knuth, D. E. (1997). Stable Marriage and Its Relation to Other Combinatorial Problems: An Introduction to the Mathematical Analysis of Algorithms. Providence (R.I.): American Mathematical Soc.
Kuhn, H. W. (1955). The Hungarian method for the assignment problem. Naval Research Logistics Quarterly, 2(1-2), 83–97. http://doi.org/10.1002/nav.3800020109
Manlove, D. F., Irving, R. W., Iwama, K., Miyazaki, S., & Morita, Y. (2002). Hard Variants of Stable Marriage.
Ohta, N., & Kuwabara, K. (2014). An Integer Programming Approach for Two-Sided Matching with Indifferences. In D. Hwang, J. Jung, & N.-T. Nguyen (Red.), Computational Collective Intelligence. Technologies and Applications (pp. 563–572). Springer International Publishing. http://doi.org/http://dx.doi.org/10.1007/978-3-319-11289-3_57
Onderwijs Vlaanderen. (2012). Inschrijvingsrecht en aanmeldingsprocedures in het basisonderwijs. Geraadpleegd 15 augustus 2015, van http://data-onderwijs.vlaanderen.be/edulex/document.aspx?docid=14368
Pathak, P. a. (2011). Lotteries in student assignment. Theoretical Economics, 6, 1–17. http://doi.org/10.3982/TE816
Pathak, P. A., & Sönmez, T. (2013). School Admissions Reform in Chicago and England: Comparing Mechanisms by their Vulnerability to Manipulation. American Economic Review, 103(1), 80–106. http://doi.org/10.1257/aer.103.1.80
Pentico, D. W. (2007). Assignment problems: A golden anniversary survey. European Journal of Operational Research, 176(2), 774–793. http://doi.org/10.1016/j.ejor.2005.09.014
Roth, a. E. (1982). The Economics of Matching: Stability and Incentives. Mathematics of Operations Research, 7(4), 617–628. http://doi.org/10.1287/moor.7.4.617
Ruohonen, K. (2013). Graph theory. Tampere University of Technology.
Shapley, L., & Scarf, H. (1974). On cores and indivisibility. Journal of Mathematical Economics, 1(1), 23–37. http://doi.org/10.1016/0304-4068(74)90033-0
Tarjan, R. (1972). Depth-first search and linear graph algorithms. SIAM Journal on Computing, 1(2).
Tiernan, J. C. (1970). An efficient search algorithm to find the elementary circuits of a graph. Communications of the ACM, 13(12), 722–726.
Vulkan, N., Roth, A. E., & Neeman, Z. (2013). The handbook of market design (1ste ed.). Oxford: Oxford University Press.