Jared D. Lichtman

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
We provide a problem definition of the stable marriage problem for a general number of parties p under a natural preference scheme in which each person has simple lists for the other parties. We extend the notion of stability in a natural way and present so called elemental and compound algorithms to generate matchings for a problem instance. We demonstrate(More)
  • 1