Matching in Practice: Junior Doctor Allocation and Kidney Exchange by Dr. David Manlove

Abstract:
Matching problems typically involve assigning agents to commodities, possibly on the basis of ordinal preferences or other metrics. These problems have large-scale applications to centralised matching schemes in many countries and contexts. In this talk I will describe the matching problems featuring in two such schemes in the UK that have involved collaborations between the National Health Service and the University of Glasgow. One of these dealt with the allocation of junior doctors to Scottish hospitals (1999-2012), and the other is concerned with finding kidney exchanges among incompatible donor-patient pairs across the UK (2007-date). In each case I will describe the applications, present the underlying algorithmic problems, outline the computational methods for their solution and give an overview of results arising from real data connected with the matching schemes in recent years.

BIO:
David Manlove is a Senior Lecturer at the School of Computing Science, University of Glasgow, where he has been since 1995. His research interests lie mainly in the field of algorithms and complexity, and include algorithms for matching problems involving preferences. These arise in applications such as the assignment of school leavers to universities, kidney patients to donors and junior doctors to hospitals. He and his colleagues have been involved in collaborations with the NHS in relation to the Scottish Foundation Allocation Scheme (for matching junior doctors to hospitals) and the National Living Donor Kidney Sharing Schemes (for enabling kidney “swaps” between incompatible donor-patient pairs) where optimal matching algorithms developed by him and colleagues have been deployed. He has over 50 publications in this area including his book “Algorithmics of Matching Under Preferences”, published in 2013.