Rankings for Bipartite Tournaments via Chain Editing

01/07/2021
by   Joseph Singleton, et al.
0

Ranking the participants of a tournament has applications in voting, paired comparisons analysis, sports and other domains. In this paper we introduce bipartite tournaments, which model situations in which two different kinds of entity compete indirectly via matches against players of the opposite kind; examples include education (students/exam questions) and solo sports (golfers/courses). In particular, we look to find rankings via chain graphs, which correspond to bipartite tournaments in which the sets of adversaries defeated by the players on one side are nested with respect to set inclusion. Tournaments of this form have a natural and appealing ranking associated with them. We apply chain editing – finding the minimum number of edge changes required to form a chain graph – as a new mechanism for tournament ranking. The properties of these rankings are investigated in a probabilistic setting, where they arise as maximum likelihood estimators, and through the axiomatic method of social choice theory. Despite some nice properties, two problems remain: an important anonymity axiom is violated, and chain editing is NP-hard. We address both issues by relaxing the minimisation constraint in chain editing, and characterise the resulting ranking methods via a greedy approximation algorithm.

READ FULL TEXT

Authors

page 1

page 2

page 3

page 4

11/28/2019

Addressing Time Bias in Bipartite Graph Ranking for Important Node Identification

The goal of the ranking problem in networks is to rank nodes from best t...
04/21/2020

Rankings of countries based on rankings of universities

Although many methods have been designed for ranking universities, there...
11/02/2020

Aggregating Incomplete and Noisy Rankings

We consider the problem of learning the true ordering of a set of altern...
05/12/2018

Bipartite Graphs of Small Readability

We study a parameter of bipartite graphs called readability, introduced ...
04/19/2015

Computing a consensus journal meta-ranking using paired comparisons and adaptive lasso estimators

In a "publish-or-perish culture", the ranking of scientific journals pla...
12/06/2021

Modification-Fair Cluster Editing

The classic Cluster Editing problem (also known as Correlation Clusterin...
11/07/2008

Statistical ranking and combinatorial Hodge theory

We propose a number of techniques for obtaining a global ranking from da...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.