Hello, Continuing to announce what I have. Some time ago I implemented a solver for the Stable Marriage problem [1] in Pharo [2]. Basically, in the stable marriage problem, you have two list of n element: a list of men and a list of women. Each person rank people of the other gender according to its preferences. The stable marriage algorithm find the best matches between men and women according to all rankings. It can be installed using: Metacello new baseline: 'StableMarriage'; repository: 'github://juliendelplanque/StableMarriage/repository'; load Regards, Julien --- Julien Delplanque Doctorant à lâUniversité de Lille 1 http://juliendelplanque.be/phd.html Equipe Rmod, Inria Bâtiment B 40, avenue Halley 59650 Villeneuve d'Ascq Numéro de téléphone: +333 59 35 86 40