BARC talk by Claire Mathieu
Wednesday, November 7th, Claire Mathieu, Professor and research director at CNRS (Centre National de la Recherche Scientifique) in Paris, France, will give a talk in BARC "Approximation schemes for rank aggregation"
Approximation schemes for rank aggregation
Given a collection of rankings, how does one produce a satisfactory full ranking?
This comes up in faculty hiring committees for an example of small size: each committee member ranks the applicants, and the rankings must then be combined. The quality of the output is measured by its similarity to the input. I will present polynomial time approximation algorithms for several versions of the problem.
Claire Mathieu does research on the design and analysis of algorithms, with a focus on approximation algorithms, particularly approximation schemes for NP-hard problems. A former student of Ecole normale supérieure, she received a PhD in Computer Science in 1988 at Paris-Sud University. She has held research and faculty positions at CNRS, Paris-Sud University, Ecole Polytechnique, Brown University, and Collège de France. She is currently a CNRS research director in Paris, France.
BARC Professor Thore Husfeldt in talk with Clarie Mathieu