English
Related papers

Related papers: Impartial Rank Aggregation

200 papers

Individuals often navigate several options with incomplete knowledge of their own preferences. Information provisioning tools such as public rankings and personalized recommendations have become central to helping individuals make choices,…

Theoretical Economics · Economics 2025-06-05 Omar Besbes , Yash Kanoria , Akshit Kumar

In complex scale-free networks, ranking the individual nodes based upon their importance has useful applications, such as the identification of hubs for epidemic control, or bottlenecks for controlling traffic congestion. However, in most…

Physics and Society · Physics 2007-05-23 Pan-Jun Kim , Hawoong Jeong

Let $M$ be an $n \times m$ matrix of independent Rademacher ($\pm 1$) random variables. It is well known that if $n \leq m$, then $M$ is of full rank with high probability. We show that this property is resilient to adversarial changes to…

Combinatorics · Mathematics 2021-07-01 Asaf Ferber , Kyle Luh , Gweneth McKinley

Traditionally, recommender systems operate by returning a user a set of items, ranked in order of estimated relevance to that user. In recent years, methods relying on stochastic ordering have been developed to create "fairer" rankings that…

Information Retrieval · Computer Science 2022-09-13 Amanda Bower , Kristian Lum , Tomo Lazovich , Kyra Yee , Luca Belli

We present a simple and versatile framework for evaluating ranked lists in terms of group fairness and relevance, where the groups (i.e., possible attribute values) can be either nominal or ordinal in nature. First, we demonstrate that, if…

Information Retrieval · Computer Science 2022-04-04 Tetsuya Sakai , Jin Young Kim , Inho Kang

We attack the problem of getting a strict ranking (i.e. a ranking without equally ranked items) of $n$ items from a pairwise comparisons matrix. Basic structures are described, a first heuristical approach based on a condition, the…

Information Theory · Computer Science 2026-04-14 Jean-Pierre Magnot

In a generalized tournament, players may have an arbitrary number of matches against each other and the outcome of the games is measured on a cardinal scale with a lower and upper bound. An axiomatic approach is applied to the problem of…

Computer Science and Game Theory · Computer Science 2019-06-20 László Csató

Quota-based fairness mechanisms like the so-called Rooney rule or four-fifths rule are used in selection problems such as hiring or college admission to reduce inequalities based on sensitive demographic attributes. These mechanisms are…

Computers and Society · Computer Science 2020-06-25 Vitalii Emelianov , Nicolas Gast , Krishna P. Gummadi , Patrick Loiseau

We consider the problem of learning over non-stationary ranking streams. The rankings can be interpreted as the preferences of a population and the non-stationarity means that the distribution of preferences changes over time. Our goal is…

Machine Learning · Statistics 2020-10-28 Ekhine Irurozki , Jesus Lobo , Aritz Perez , Javier Del Ser

Argumentation is a process of evaluating and comparing a set of arguments. A way to compare them consists in using a ranking-based semantics which rank-order arguments from the most to the least acceptable ones. Recently, a number of such…

Artificial Intelligence · Computer Science 2016-02-03 Elise Bonzon , Jérôme Delobelle , Sébastien Konieczny , Nicolas Maudet

Strategic classification studies the design of a classifier robust to the manipulation of input by strategic individuals. However, the existing literature does not consider the effect of competition among individuals as induced by the…

Computer Science and Game Theory · Computer Science 2022-02-23 Lydia T. Liu , Nikhil Garg , Christian Borgs

We axiomatically define a cardinal social inefficiency function, which, given a set of alternatives and individuals' vNM preferences over the alternatives, assigns a unique number -- the social inefficiency -- to each alternative. These…

Theoretical Economics · Economics 2026-02-10 Yannai A. Gonczarowski , Ella Segev

We consider the problem of exact low-rank matrix completion from a geometric viewpoint: given a partially filled matrix M, we keep the positions of specified and unspecified entries fixed, and study how the minimal completion rank depends…

Statistics Theory · Mathematics 2019-09-24 Daniel Irving Bernstein , Grigoriy Blekherman , Rainer Sinn

No feature ranking can be simultaneously faithful, stable, and complete when features are collinear. For collinear pairs, ranking reduces to a coin flip. We prove this impossibility, quantify it for four model classes, resolve it via…

Machine Learning · Computer Science 2026-05-22 Drake Caraker , Bryan Arnold , David Rhoads

Pressured by globalization and the increasing demand for public organisations to be accountable, efficient and transparent, university rankings have become an important tool for assessing the quality of higher education institutions. It is…

Social and Information Networks · Computer Science 2022-11-10 Friso Selten , Cameron Neylon , Chun-Kai Huang , Paul Groth

Aggregating multiple input rankings into a consensus ranking is essential in various fields such as social choice theory, hiring, college admissions, web search, and databases. A major challenge is that the optimal consensus ranking might…

Data Structures and Algorithms · Computer Science 2026-02-25 Diptarka Chakraborty , Himika Das , Sanjana Dey , Alvin Hong Yao Yan

When allocating indivisible objects via lottery, planners often use ordinal mechanisms, which elicit agents' rankings of objects rather than their full preferences over lotteries. In such an ordinal informational environment, planners…

Theoretical Economics · Economics 2025-08-21 Eun Jeong Heo , Vikram Manjunath , Samson Alva

Argumentation is one of society's foundational pillars, and, sparked by advances in NLP and the vast availability of text data, automated mining of arguments receives increasing attention. A decisive property of arguments is their strength…

Computation and Language · Computer Science 2022-05-23 Michael Fromm , Max Berrendorf , Johanna Reiml , Isabelle Mayerhofer , Siddharth Bhargava , Evgeniy Faerman , Thomas Seidl

Recent discussion of the success of feature selection methods has argued that focusing on a relatively small number of features has been counterproductive. Instead, it is suggested, the number of significant features can be in the thousands…

Statistics Theory · Mathematics 2014-07-10 Peter Hall , Jiashun Jin , Hugh Miller

Influence maximization, fundamental for word-of-mouth marketing and viral marketing, aims to find a set of seed nodes maximizing influence spread on social network. Early methods mainly fall into two paradigms with certain benefits and…

Social and Information Networks · Computer Science 2014-02-18 Suqi Cheng , Hua-Wei Shen , Junming Huang , Wei Chen , Xue-Qi Cheng