One night in 2000, tired of delivering the heartbreaking news to patients and their loved ones that no suitable kidney could be found, a US nephrologist named Michael Rees lugged home several crates of files and spent the next few hours scrutinizing blood, antibody, and tissue data, and comparing patient charts. The work was mentally grueling. Eventually, he realized he had no viable matches—but also, that if the pool were bigger, pairs could be made. Working with his father Alan Rees, a computer scientist, Michael Rees created a simple computer program that did the work of pairing up donors and recipients, introducing AI to the matching process.
but on the topic of experts check out this paper by the same research group. This is much more of an 'AI' paper that does include expert domain knowledge and learning
"FutureMatch: Combining Human Value Judgments and Machine Learning to Match in Dynamic Environments" from AAI2015
Chill! Your refs are up-to-date :)
There's two versions of the paper, one published in the Proceedings of the ACM Conference on Electronic Commerce, in 2013, the other published in 2018, in, er, Informs PubsOnline (??) in 2018. The latter appears to be an online journal- sorry if I messed up the name, I don't know the journal.
this is wrong at least for UNOS (united network for organ sharing)-which is the main system in the article-the current computer program used to find matches is an integer linear program. I think it is an interesting question if some kind of rule based system could replicate their ability to find the matches. I tend to think not.
https://pdfs.semanticscholar.org/0837/80a157a7f8ebfa44dce0bc...
page 16 "To our knowledge, there is no solver that would scale to the nationwide steady-state size— including the CMU solver used by UNOS. This solver is based on the work of Abraham et al. (2007), with enhancements and generalizations by Dickerson and Sandholm, and uses integer linear programming (IP) with one decision variable for each cycle no longer than L (in practice, L = 3) and constraints that state that accepted cycles are vertex disjoint. With specialized branch-andprice IP solving techniques, Abraham et al. (2007) were able to solve the (3-cycle, no chains, deterministic) problem at the projected steady-state nationwide scale of 10,000 patients"
edit: wait wait this comment could be out of date. The google scholar for this paper says 2018 but the paper says 2013??