Aggregating Incomplete Rankings
This study considers the method to derive a ranking of alternatives by aggregating the rankings submitted by several individuals who may not evaluate all of them. The collection of subsets of alternatives that individuals (can) evaluate is referred to as an evaluability profile. For a given evaluability profile, we define an aggregating ranking function whose inputs are the rankings of individuals on the alternatives they evaluate. We investigate the properties of aggregating ranking functions, which are modifications of those introduced in previous studies. Whether an aggregating ranking function satisfying a combination of properties exists depends on the evaluability profile. Thus, we identify the necessary and sufficient conditions on evaluability profiles to ensure the existence of the functions satisfying four different combinations of properties. Furthermore, to examine how frequently possible or impossible evaluability profiles occur, we derive the proportion of each type in specific cases.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Aggregating Incomplete and Noisy Rankings
We consider the problem of learning the true ordering of a set of alternatives from largely incomplete and noisy rankings. We introduce a natural generalization of both the classical Mallows model of ranking distribution…
ONEBench to Test Them All: Sample-Level Benchmarking Over Open-Ended Capabilities
Traditional fixed test sets fall short in evaluating open-ended capabilities of foundation models. To address this, we propose ONEBench(OpeN-Ended Benchmarking), a new testing paradigm that consolidates individual evalua…
AllBenchmarkingStatistical Inference for Incomplete Ranking Data: The Case of Rank-Dependent Coarsening
We consider the problem of statistical inference for ranking data, specifically rank aggregation, under the assumption that samples are incomplete in the sense of not comprising all choice alternatives. In contrast to mo…
Antithetic and Monte Carlo kernel estimators for partial rankings
In the modern age, rankings data is ubiquitous and it is useful for a variety of applications such as recommender systems, multi-object tracking and preference learning. However, most rankings data encountered in the rea…
Multi-Object TrackingObject TrackingRecommendation SystemsRevealed Incomplete Preferences
We elicit incomplete preferences over monetary gambles with subjective uncertainty. Subjects rank gambles, and these rankings are used to estimate preferences; payments are based on estimated preferences. About 40\% of s…