{"id":4446,"date":"2022-03-20T19:23:40","date_gmt":"2022-03-20T18:23:40","guid":{"rendered":"https:\/\/sciences.brussels\/printemps\/?post_type=projet-expo&#038;p=4446"},"modified":"2022-03-21T00:29:01","modified_gmt":"2022-03-20T23:29:01","slug":"lalgorithme-de-gale-shapley","status":"publish","type":"projet-expo","link":"https:\/\/sciences.brussels\/printemps\/projet-expo\/lalgorithme-de-gale-shapley\/","title":{"rendered":"L&rsquo;algorithme de Gale-Shapley"},"content":{"rendered":"<p>T\u2019es-tu d\u00e9j\u00e0 retrouv\u00e9 dans la situation o\u00f9 ton professeur demande \u00e0 chacun une liste de pr\u00e9f\u00e9rences pour former des bin\u00f4mes en classe ? Ceci est un exemple du probl\u00e8me des mariages stables dont Gale et Shapley ont d\u00e9montr\u00e9 la solution en 1962. Leur algorithme est aujourd\u2019hui tr\u00e8s r\u00e9pandu, nous allons t&rsquo;expliquer comment \u00e7a marche et pourquoi dans notre vid\u00e9o.<\/p>\n","protected":false},"template":"","categorie-exo":[130,125,134],"class_list":["post-4446","projet-expo","type-projet-expo","status-publish","hentry","categorie-exo-faculte-des-sciences","categorie-exo-informatique","categorie-exo-ulb","description-off"],"_links":{"self":[{"href":"https:\/\/sciences.brussels\/printemps\/wp-json\/wp\/v2\/projet-expo\/4446"}],"collection":[{"href":"https:\/\/sciences.brussels\/printemps\/wp-json\/wp\/v2\/projet-expo"}],"about":[{"href":"https:\/\/sciences.brussels\/printemps\/wp-json\/wp\/v2\/types\/projet-expo"}],"wp:attachment":[{"href":"https:\/\/sciences.brussels\/printemps\/wp-json\/wp\/v2\/media?parent=4446"}],"wp:term":[{"taxonomy":"categorie-exo","embeddable":true,"href":"https:\/\/sciences.brussels\/printemps\/wp-json\/wp\/v2\/categorie-exo?post=4446"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}