Re:How a matchmaking algorithm saved lives
by marketforlemmas on Thursday February 25, 2016 @10:16AM
(#11174928)
You are right that the general problem is intractable; a lot of the advances in these match making algorithms come from better heuristics and computing power.
Re:How a matchmaking algorithm saved lives
by pmiller2 on Thursday February 25, 2016 @11:38AM
(#11175571)
That is actually not related, but the beginning of an entirely different field of mathematics. Design theory is the study of mathematical objects called combinatorial designs[1], which are basically fancy ways of partitioning finite sets into subsets with a pre-specified structure. The thing you linked to is a specific instance that shows the existence of designs in a few specific cases.
While Kirkman essentially posed the first design theory question in the 1850's, both the authors of one of the standard textbooks[2] in the field are still alive and (IIRC) still working today!
http://www.npr.org/sections/health-shots/2015/06/11/41222485...
edit:
found a bit more information https://www.siam.org/news/news.php?id=1474
http://www.amazon.com/Two-Sided-Matching-Game-Theoretic-Econ...
To be fair, it is also studied by computer scientists, as in the other main book on the stable marriage:
http://www.amazon.com/The-Stable-Marriage-Problem-Foundation...
http://www.econtalk.org/archives/2015/07/alvin_roth_on_m.htm...
http://demonstrations.wolfram.com/SocialGolferProblem/
While Kirkman essentially posed the first design theory question in the 1850's, both the authors of one of the standard textbooks[2] in the field are still alive and (IIRC) still working today!
[1] https://en.wikipedia.org/wiki/Combinatorial_design . Incidentally, the field is called "design theory," but it's not a great search term outside of MathSciNet.
[2] http://www.amazon.com/Design-Edition-Discrete-Mathematics-Ap...
https://en.wikipedia.org/wiki/Stable_marriage_problem