Français
Affectation dans l'enseignement supérieur : sélection et algorithmes
Post-edited
Authors : Courant, Judicaël (Author of the conference)
CIRM (Publisher )
05D15 - Transversal (matching) theory
68Q25 - Analysis of algorithms and problem complexity
91B68 - Matching models in economics
CIRM (Publisher )
Abstract :
Déléguer à une machine l'affectation des bacheliers dans le supérieur pose un certain nombre de questions : quels règles souhaite-t-on pour l'accès au supérieur ? Quels sont alors les objectifs assignés à la machine ? Quel algorithme permet de les atteindre ? Comment permettre à tous les citoyens de vérifier une exécution de l'algorithme ? On verra rapidement quels faux et vrais problèmes posait APB et pose Parcoursup. Je présenterai l'algorithme de Gale-Shapley et je montrerai comment on peut vérifier a posteriori que cet algorithme a été exécuté correctement, de façon plus ou moins complète selon le degré d'anonymat des candidatures et des classements.
In France, matching students who have passed the baccalaureat to higher education is a computer-based process. A new process is being used this year. Some questions arise: what are the rules that determine access to higher education? What goal is the computer-based process supposed to be aimed at? By what means? How are citizens allowed to check that the process runs smoothly and gives equitable results? This talk reviews some of the issues raised by both the former and the new processes, introduces the Gale-Shapley algorithm and explains how a run of the process can be independently verified.
MSC Codes : In France, matching students who have passed the baccalaureat to higher education is a computer-based process. A new process is being used this year. Some questions arise: what are the rules that determine access to higher education? What goal is the computer-based process supposed to be aimed at? By what means? How are citizens allowed to check that the process runs smoothly and gives equitable results? This talk reviews some of the issues raised by both the former and the new processes, introduces the Gale-Shapley algorithm and explains how a run of the process can be independently verified.
05D15 - Transversal (matching) theory
68Q25 - Analysis of algorithms and problem complexity
91B68 - Matching models in economics
|
Information on the Video
Film maker : Hennenfent, GuillaumeLanguage : French Available date : 15/05/2018 Conference Date : 09/05/2018 Subseries : Research talks arXiv category : Combinatorics ; Computer Science Mathematical Area(s) : Computer Science ; Combinatorics ; Mathematics in Science & Technology Format : MP4 (.mp4) - HD Video Time : 01:20:29 Targeted Audience : Researchers Download : https://videos.cirm-math.fr/2018-05-09_Courant.mp4 
|
Information on the Event
Event Title : Algorithm and programming / Algorithmique et programmationEvent Organizers : Boisson, François ; Gonnord, Stéphane ; Petit, Antoine Dates : 07/05/2018 - 11/05/2018 Event Year : 2018 Event URL : https://conferences.cirm-math.fr/1795.html
Citation Data
DOI : 10.24350/CIRM.V.19399503Cite this video as: Courant, Judicaël (2018). Affectation dans l'enseignement supérieur : sélection et algorithmes. CIRM. Audiovisual resource. doi:10.24350/CIRM.V.19399503 URI : http://dx.doi.org/10.24350/CIRM.V.19399503 |
See Also
- [Multi angle] SMT solving / Author of the conference Monniaux, David.
- [Multi angle] Méthodes probabilistes / Author of the conference Bonamy, Marthe.
Bibliography
- Abdulkadiroglu, A., & Sönmez, T. (2003). School choice: A mechanism design approach. American Economic Review, 93(3), 729–747 - https://doi.org/10.1257/000282803322157061
- Gale, D., & Shapley, L.S. (1962). College admissions and the stability of marriage. The American Mathematical Monthly, 69(1), 9–15 - http://dx.doi.org/10.2307/2312726
- Shapley, L., & Scarf, H. (1974). On cores and indivisibility. Journal of Mathematical Economics, 1(1), 23–37 - https://doi.org/10.1016/0304-4068(74)90033-0
