Solver for the Stable Marriage problem in Pharo

Previous Topic Next Topic
 
classic Classic list List threaded Threaded
6 messages Options
Reply | Threaded
Open this post in threaded view
|

Solver for the Stable Marriage problem in Pharo

Julien Delplanque-2
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: '<a href="github://juliendelplanque/StableMarriage/repository" class="">github://juliendelplanque/StableMarriage/repository';
    load

Regards,

Julien

---
Julien Delplanque
Doctorant à l’Université de Lille 1
Bâtiment B 40, avenue Halley 59650 Villeneuve d'Ascq
Numéro de téléphone: +333 59 35 86 40

Reply | Threaded
Open this post in threaded view
|

Re: Solver for the Stable Marriage problem in Pharo

Sean P. DeNigris
Administrator
Julien wrote
> Continuing to announce what I have.

Hooray!!



-----
Cheers,
Sean
--
Sent from: http://forum.world.st/Pharo-Smalltalk-Users-f1310670.html

Cheers,
Sean
Reply | Threaded
Open this post in threaded view
|

Re: Solver for the Stable Marriage problem in Pharo

Guillermo Polito
Nice! But late :P I was looking for something like this to organize secret santa a couple of weeks ago. I'll star it though :)

Tx!

On Wed, Jan 3, 2018 at 12:23 AM, Sean P. DeNigris <[hidden email]> wrote:
Julien wrote
> Continuing to announce what I have.

Hooray!!



-----
Cheers,
Sean
--
Sent from: http://forum.world.st/Pharo-Smalltalk-Users-f1310670.html




--

   

Guille Polito

Research Engineer

Centre de Recherche en Informatique, Signal et Automatique de Lille

CRIStAL - UMR 9189

French National Center for Scientific Research - http://www.cnrs.fr


Web: http://guillep.github.io

Phone: +33 06 52 70 66 13

Reply | Threaded
Open this post in threaded view
|

Re: Solver for the Stable Marriage problem in Pharo

Julien Delplanque-2
Not sure you can use it for that.

I mean, you wanted random pairs of people no?

So no need to rank people according to some preferences?

Julien

---
Julien Delplanque
Doctorant à l’Université de Lille 1
Bâtiment B 40, avenue Halley 59650 Villeneuve d'Ascq
Numéro de téléphone: +333 59 35 86 40

Le 4 janv. 2018 à 10:08, Guillermo Polito <[hidden email]> a écrit :

Nice! But late :P I was looking for something like this to organize secret santa a couple of weeks ago. I'll star it though :)

Tx!

On Wed, Jan 3, 2018 at 12:23 AM, Sean P. DeNigris <[hidden email]> wrote:
Julien wrote
> Continuing to announce what I have.

Hooray!!



-----
Cheers,
Sean
--
Sent from: http://forum.world.st/Pharo-Smalltalk-Users-f1310670.html




--
   
Guille Polito
Research Engineer


Centre de Recherche en Informatique, Signal et Automatique de Lille
CRIStAL - UMR 9189
French National Center for Scientific Research - http://www.cnrs.fr

Phone: +33 06 52 70 66 13

Reply | Threaded
Open this post in threaded view
|

Re: Solver for the Stable Marriage problem in Pharo

Guillermo Polito
It depends. I wanted to customize the process a bit, and avoid that some people make gifts to some specific people.

On Thu, Jan 4, 2018 at 2:26 PM, Julien <[hidden email]> wrote:
Not sure you can use it for that.

I mean, you wanted random pairs of people no?

So no need to rank people according to some preferences?

Julien

---
Julien Delplanque
Doctorant à l’Université de Lille 1
Numéro de téléphone: <a href="tel:+33%203%2059%2035%2086%2040" value="+33359358640" target="_blank">+333 59 35 86 40

Le 4 janv. 2018 à 10:08, Guillermo Polito <[hidden email]> a écrit :

Nice! But late :P I was looking for something like this to organize secret santa a couple of weeks ago. I'll star it though :)

Tx!

On Wed, Jan 3, 2018 at 12:23 AM, Sean P. DeNigris <[hidden email]> wrote:
Julien wrote
> Continuing to announce what I have.

Hooray!!



-----
Cheers,
Sean
--
Sent from: http://forum.world.st/Pharo-Smalltalk-Users-f1310670.html




--
   
Guille Polito
Research Engineer


Centre de Recherche en Informatique, Signal et Automatique de Lille
CRIStAL - UMR 9189
French National Center for Scientific Research - http://www.cnrs.fr

Phone: <a href="tel:+33%206%2052%2070%2066%2013" value="+33652706613" target="_blank">+33 06 52 70 66 13




--

   

Guille Polito

Research Engineer

Centre de Recherche en Informatique, Signal et Automatique de Lille

CRIStAL - UMR 9189

French National Center for Scientific Research - http://www.cnrs.fr


Web: http://guillep.github.io

Phone: +33 06 52 70 66 13

Reply | Threaded
Open this post in threaded view
|

Re: Solver for the Stable Marriage problem in Pharo

Julien Delplanque-2
Oh, maybe it would have helped then… :-)

Julien

---
Julien Delplanque
Doctorant à l’Université de Lille 1
Bâtiment B 40, avenue Halley 59650 Villeneuve d'Ascq
Numéro de téléphone: +333 59 35 86 40

Le 4 janv. 2018 à 15:12, Guillermo Polito <[hidden email]> a écrit :

It depends. I wanted to customize the process a bit, and avoid that some people make gifts to some specific people.

On Thu, Jan 4, 2018 at 2:26 PM, Julien <[hidden email]> wrote:
Not sure you can use it for that.

I mean, you wanted random pairs of people no?

So no need to rank people according to some preferences?

Julien

---
Julien Delplanque
Doctorant à l’Université de Lille 1
Numéro de téléphone: <a href="tel:+33%203%2059%2035%2086%2040" value="+33359358640" target="_blank" class="">+333 59 35 86 40

Le 4 janv. 2018 à 10:08, Guillermo Polito <[hidden email]> a écrit :

Nice! But late :P I was looking for something like this to organize secret santa a couple of weeks ago. I'll star it though :)

Tx!

On Wed, Jan 3, 2018 at 12:23 AM, Sean P. DeNigris <[hidden email]> wrote:
Julien wrote
> Continuing to announce what I have.

Hooray!!



-----
Cheers,
Sean
--
Sent from: http://forum.world.st/Pharo-Smalltalk-Users-f1310670.html




--
   
Guille Polito
Research Engineer

Centre de Recherche en Informatique, Signal et Automatique de Lille
CRIStAL - UMR 9189
French National Center for Scientific Research - http://www.cnrs.fr

Phone: <a href="tel:+33%206%2052%2070%2066%2013" value="+33652706613" target="_blank" class="">+33 06 52 70 66 13




--
   
Guille Polito
Research Engineer


Centre de Recherche en Informatique, Signal et Automatique de Lille
CRIStAL - UMR 9189
French National Center for Scientific Research - http://www.cnrs.fr

Phone: +33 06 52 70 66 13