Claire Mathieu and Simon Mauras (IRIF) will present at SODA’20 several approximation algorithms for top-list aggregation, an optimization problem from the field of information retrieval: compute the output full-ranking which is closest to a collection of input top-lists.