Penalty-Based Aggregation Beyond the Current Confinement to Real Numbers: The Method of Kemeny Revisited

摘要

The field of aggregation theory addresses the mathematical formalization of aggregation processes. Historically, the developed mathematical framework has been largely confined to the aggregation of real numbers, while the aggregation of other types of structures, such as rankings, has been independently considered in different fields of application. However, one could lately perceive an increasing interest in the study and formalization of aggregation processes on new types of data. Mostly, this aggregation outside the framework of real numbers is based on the use of a penalty function measuring the disagreement with a consensus element. Unfortunately, there does not exist a comprehensive theoretical framework yet. In this paper, we propose a natural extension of the definition of a penalty function to a more general setting based on the compatibility with a given betweenness relation. In particular, we revisit one of the most common methods for the aggregation of rankings - the method of Kemeny - which will be positioned in the penalty-based aggregation framework.