Add to ORKGA set ranking method assigns to each tournament on a given set an ordering of the subsets of that set. Such a method is consistent if (i) the items in the set are ranked in the same order as the sets of items they beat and (ii) the ordering of the items fully determines the ordering of the sets of items. We describe two consistent set ranking methods
AbstractThe linear ordering problem consists in finding a linear order at minimum remoteness from a ...
The problem of ranking a set of elements, namely giving a ``rank'' to the elements of the set, may b...
We design the first polynomial time approximation schemes (PTASs) for the Mini-mum Betweenness probl...
A set ranking method assigns to each tournament on a given set an ordering of the subsets of that se...
The problem of ranking a set of elements, namely giving a “rank” to the elements of the set, may ari...
This paper examines the problem of rank ordering a set of players or objects on the basis of a set o...
In this paper we bring a novel approach to the theory of tournament rankings. We combine two differe...
The paper reviews some axioms of additivity concerning ranking methods used for generalized tourname...
Abstract. We examine three methods for ranking by pairwise comparison: Principal Eigen-vector, Hodge...
Each item in a given collection is characterized by a set of possible performances. A (ranking) meth...
In this paper we present an axiomatic analysis of several ranking methods for general tournaments. W...
In this paper we present an axiomatic analysis of several ranking methods for tournaments. We find t...
Ranking is a fundamental activity for organising and, later, understanding data. Advice of the form ...
AbstractSuppose n competitors each compete in r races and a ranking function F assigns a score F(j) ...
Ranking the participants of a tournament has applications in voting, paired comparisons analysis, sp...
AbstractThe linear ordering problem consists in finding a linear order at minimum remoteness from a ...
The problem of ranking a set of elements, namely giving a ``rank'' to the elements of the set, may b...
We design the first polynomial time approximation schemes (PTASs) for the Mini-mum Betweenness probl...
A set ranking method assigns to each tournament on a given set an ordering of the subsets of that se...
The problem of ranking a set of elements, namely giving a “rank” to the elements of the set, may ari...
This paper examines the problem of rank ordering a set of players or objects on the basis of a set o...
In this paper we bring a novel approach to the theory of tournament rankings. We combine two differe...
The paper reviews some axioms of additivity concerning ranking methods used for generalized tourname...
Abstract. We examine three methods for ranking by pairwise comparison: Principal Eigen-vector, Hodge...
Each item in a given collection is characterized by a set of possible performances. A (ranking) meth...
In this paper we present an axiomatic analysis of several ranking methods for general tournaments. W...
In this paper we present an axiomatic analysis of several ranking methods for tournaments. We find t...
Ranking is a fundamental activity for organising and, later, understanding data. Advice of the form ...
AbstractSuppose n competitors each compete in r races and a ranking function F assigns a score F(j) ...
Ranking the participants of a tournament has applications in voting, paired comparisons analysis, sp...
AbstractThe linear ordering problem consists in finding a linear order at minimum remoteness from a ...
The problem of ranking a set of elements, namely giving a ``rank'' to the elements of the set, may b...
We design the first polynomial time approximation schemes (PTASs) for the Mini-mum Betweenness probl...