Related papers: Enumerating Flat Fubini Rankings
The central problem in this work is to compute a ranking of a set of elements which is "closest to" a given set of input rankings of the elements. We define "closest to" in an established way as having the minimum sum of Kendall-Tau…
Many of the existing approaches to assess and predict the performance of players, teams or products in competitive contests rely on the assumption that comparisons occur between pairs of such entities. There are, however, several real…
The scope of this work is the constraint-based synthesis of termination arguments for the restricted class of programs called linear lasso programs. A termination argument consists of a ranking function as well as a set of supporting…
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…
We study functions that produce a ranking of $n$ individuals from $n$ such rankings and are impartial in the sense that the position of an individual in the output ranking does not depend on the input ranking submitted by that individual.…
Let $T$ be a tournament with nondecreasing score sequence $R$ and $A$ be its tournament matrix. An upset of $T$ corresponds to an entry above the main diagonal of $A$. Given a feasible score sequence $R$, Fulkerson~(1965) gave a simple…
We give multiple proofs of two formulas concerning the enumeration of permutations avoiding a monotone consecutive pattern with a certain value for the inverse peak number or inverse left peak number statistic. The enumeration in both cases…
Concurrency and probability are both much studied extensions of sequential computation. Within concurrency theory, there is a broad divide between interleaving models and logics, which model concurrency by non-determinism, and `truly…
We present a new method for the constraint-based synthesis of termination arguments for linear loop programs based on linear ranking templates. Linear ranking templates are parametrized, well-founded relations such that an assignment to the…
We establish a fundamental theorem of orders (FTO) which allows us to express all orders uniquely as an intersection of `irreducible orders' along which the index and the conductor distributes multiplicatively. We define a subclass of…
The quality of the ranking function is an important factor that determines the quality of the Information Retrieval system. Each document is assigned a score by the ranking function; the score indicates the likelihood of relevance of the…
Query evaluation in tuple-independent probabilistic databases is the problem of computing the probability of an answer to a query given independent probabilities of the individual tuples in a database instance. There are two main approaches…
Interval parking functions are a generalization of parking functions in which cars have an interval preference for their parking. We generalize this definition to parking functions with $n$ cars and $m\geq n$ parking spots, which we call…
Ladder tournaments are widely used to rank individuals in real-world organizations and games. Their mathematical properties however are still poorly understood. We formalize the ranking rule generated by a ladder tournament, and we show…
Let $B$ be a finite set of natural numbers or complex numbers. Product set corresponding to $B$ is defined by $B.B:=\{ab:a,b\in B\}$. In this paper we give an upper bound for longest length of consecutive terms of a polynomial sequence…
Label ranking is a prediction task which deals with learning a mapping between an instance and a ranking (i.e., order) of labels from a finite set, representing their relevance to the instance. Boosting is a well-known and reliable ensemble…
This paper examines the problem of ranking a collection of objects using pairwise comparisons (rankings of two objects). In general, the ranking of $n$ objects can be identified by standard sorting methods using $n log_2 n$ pairwise…
The problem of finding the number of ordered commuting tuples of elements in a finite group is equivalent to finding the size of the solution set of the system of equations determined by the commutator relations that impose commutativity…
This paper considers the problem of inference after ranking. In our setting, we are interested in any population whose rank according to some random quantity, such as an estimated treatment effect, a measure of value-added, or benefit (net…
For better or for worse, rankings of institutions, such as universities, schools and hospitals, play an important role today in conveying information about relative performance. They inform policy decisions and budgets, and are often…