title: Job assignment with NO cost, would Hungarian method work?
body: <p>So I have a job assignment problem that doesn't have the traditional cost the Hungarian method requires.</p>
  
  <p>For example:</p>
  
  <pre><code>I have 3 workers - A, B and C
  I have 5 jobs -  1, 2, 3, 4 and 5
  </code></pre>
  
  <p>Each worker has a list of jobs he can perform, like so:</p>
  
  <pre><code>worker A can work on job 1, 2, 5
  worker B can work on job 1, 2
  worker C can work on job 1
  </code></pre>
  
  <p>The end result (since there's no cost) is the maximum number of assignments I can achieve. In this example, I can achieve a maximum of 3 assignments: </p>
  
  <pre><code>worker A on job 5
  worker B on job 2
  worker C on job 1
  </code></pre>
  
  <p>Is the Hungarian method a good way to solve this? Should I just use "dummy" costs? I was thinking maybe using the index of the job preference as the cost; is this a good idea?</p>