Stable Marriage Problem

Description
<span></span><p dir="ltr"><span><b>The Problem</b></span></p><p dir="ltr"><span>The stable marriage problem (</span><a href="http://en.wikipedia.org/wiki/Stable_marriage_problem"><span>http://en.wikipedia.org/wiki/Stable_marriage_problem</span></a><span>) is important in market design.</span></p><p dir="ltr"><span><b>The Interface</b></span></p><p dir="ltr"><span>Input should be an object of class Map&lt;String,List&lt;String&gt;&gt;, in which each key is a node name, and its value is an ordered list of names denoting preferences (the first element being the highest preference). The structure of the problem implies that the input contain 2n elements, n of which are &#8220;male&#8221; and include each of the n &#8220;female&#8221; nodes in their preference list, and vice versa. Output Map&lt;String,String&gt; where each key is paired with its value.</span></p><p dir="ltr"><span><b>The Algorithm</b></span></p><span>There are specific algorithms mentioned on wikipedia page, namely the Gale-Shapley algorithm.</span>
Fulfilled By
    • requests
Discussion
  • {{comment.username}}
Status
Fulfilled
Bounty expires in
Bounty expired
Bounty
150
Tags
(no tags)