Partial Ranking
Partial ranking, focusing on ordering a subset of items rather than a complete list, addresses the challenges of efficiently handling large datasets and incorporating diverse evaluation criteria. Current research emphasizes developing robust ranking algorithms, including those based on hierarchical aggregation, transformer networks, and reinforcement learning, to improve accuracy and mitigate biases in various applications. This field is significant because it enhances decision-making in diverse areas such as process mining, metaheuristic optimization, and information retrieval, offering more efficient and reliable methods for handling complex ranking problems.
Papers
Soft Condorcet Optimization for Ranking of General Agents
Marc Lanctot, Kate Larson, Michael Kaisers, Quentin Berthet, Ian Gemp, Manfred Diaz, Roberto-Rafael Maura-Rivero, Yoram Bachrach, Anna Koop, Doina Precup
Auditing Google's Search Algorithm: Measuring News Diversity Across Brazil, the UK, and the US
Raphael Hernandes, Giulio Corsi
Ranking Over Scoring: Towards Reliable and Robust Automated Evaluation of LLM-Generated Medical Explanatory Arguments
Iker De la Iglesia, Iakes Goenaga, Johanna Ramirez-Romero, Jose Maria Villa-Gonzalez, Josu Goikoetxea, Ander Barrena
Ranking the Top-K Realizations of Stochastically Known Event Logs
Arvid Lepsien, Marco Pegoraro, Frederik Fonger, Dominic Langhammer, Milda Aleknonytė-Resch, Agnes Koschmider