English
Related papers

Related papers: Deepest voting on rankings

200 papers

Voting is a very general method of preference aggregation. A voting rule takes as input every voter's vote (typically, a ranking of the alternatives), and produces as output either just the winning alternative or a ranking of the…

Computer Science and Game Theory · Computer Science 2012-07-09 Vincent Conitzer , Tuomas Sandholm

Statistical depth is the act of gauging how representative a point is compared to a reference probability measure. The depth allows introducing rankings and orderings to data living in multivariate, or function spaces. Though widely applied…

Statistics Theory · Mathematics 2021-05-28 George Wynne , Stanislav Nagy

A method is given for quantitatively rating the social acceptance of different options which are the matter of a complete preferential vote. Completeness means that every voter expresses a comparison (a preference or a tie) about each pair…

Optimization and Control · Mathematics 2012-03-09 Rosa Camps , Xavier Mora , Laia Saumell

Perpetual voting was recently introduced as a framework for long-term collective decision making. In this framework, we consider a sequence of subsequent approval-based elections and try to achieve a fair overall outcome. To achieve…

Computer Science and Game Theory · Computer Science 2021-05-03 Martin Lackner , Jan Maly

The notion of statistical depth has been extensively studied in multivariate and functional data over the past few decades. In contrast, the depth on temporal point process is still under-explored. The problem is challenging because a point…

Methodology · Statistics 2021-05-24 Zishen Xu , Chenran Wang , Wei Wu

If uncertainty is modelled by a probability measure, decisions are typically made by choosing the option with the highest expected utility. If an imprecise probability model is used instead, this decision rule can be generalised in several…

Artificial Intelligence · Computer Science 2020-03-27 Jasper De Bock

Systems of decision rules and decision trees are widely used as a means for knowledge representation, as classifiers, and as algorithms. They are among the most interpretable models for classifying and representing knowledge. The study of…

Computational Complexity · Computer Science 2023-02-15 Kerven Durdymyradov , Mikhail Moshkov

Winner selection by majority, in an election between two candidates, is the only rule compatible with democratic principles. Instead, when the candidates are three or more and the voters rank candidates in order of preference, there are no…

Physics and Society · Physics 2016-04-19 Pierluigi Contucci , Emanuele Panizzi , Federico Ricci-Tersenghi , Alina Sîrbu

Classical latent-score ranking models often fail to distinguish objects' intrinsic scores from contextual effects, which are typically nonlinear and can dominate the observed outcomes. To address this, we introduce a semiparametric ranking…

Methodology · Statistics 2026-04-22 Yuanhang Luo , Shuxing Fang , Ruijian Han , Yiming Xu

An important aspect of AI design and ethics is to create systems that reflect aggregate preferences of the society. To this end, the techniques of social choice theory are often utilized. We propose a new social choice function motivated by…

Multiagent Systems · Computer Science 2021-03-02 Gergei Bana , Wojciech Jamroga , David Naccache , Peter Y. A. Ryan

Deep learning has arguably achieved tremendous success in recent years. In simple words, deep learning uses the composition of many nonlinear functions to model the complex dependency between input features and labels. While neural networks…

Machine Learning · Statistics 2019-04-16 Jianqing Fan , Cong Ma , Yiqiao Zhong

When aggregating preferences of agents via voting, two desirable goals are to incentivize agents to participate in the voting process and then identify outcomes that are Pareto efficient. We consider participation as formalized by Brandl,…

Computer Science and Game Theory · Computer Science 2017-05-02 Haris Aziz , Pang Luo , Christine Rizkallah

A method is given for quantitatively rating the social acceptance of different options which are the matter of a preferential vote. In contrast to a previous article, here the individual votes are allowed to be incomplete, that is, they…

Optimization and Control · Mathematics 2012-03-09 Rosa Camps , Xavier Mora , Laia Saumell

We consider elections where both voters and candidates can be associated with points in a metric space and voters prefer candidates that are closer to those that are farther away. It is often assumed that the optimal candidate is the one…

Computer Science and Game Theory · Computer Science 2019-01-23 Grzegorz Pierczyński , Piotr Skowron

In general, recommendation can be viewed as a matching problem, i.e., match proper items for proper users. However, due to the huge semantic gap between users and items, it's almost impossible to directly match users and items in their…

Machine Learning · Computer Science 2019-01-16 Zhi-Hong Deng , Ling Huang , Chang-Dong Wang , Jian-Huang Lai , Philip S. Yu

This work explores the novel idea of learning a submodular scoring function to improve the specificity/selectivity of existing feature attribution methods. Submodular scores are natural for attribution as they are known to accurately model…

Machine Learning · Computer Science 2022-02-23 Piyushi Manupriya , Tarun Ram Menta , J. Saketha Nath , Vineeth N Balasubramanian

Implicit deep learning prediction rules generalize the recursive rules of feedforward neural networks. Such rules are based on the solution of a fixed-point equation involving a single vector of hidden features, which is thus only…

Machine Learning · Computer Science 2020-08-10 Laurent El Ghaoui , Fangda Gu , Bertrand Travacca , Armin Askari , Alicia Y. Tsai

The data scarcity of user preferences and the cold-start problem often appear in real-world applications and limit the recommendation accuracy of collaborative filtering strategies. Leveraging the selections of social friends and foes can…

Machine Learning · Computer Science 2019-06-03 Dimitrios Rafailidis

We define a new class of set functions that in addition to being monotone and subadditive, also admit a very limited form of submodularity defined over a permutation of the ground set. We refer to this permutation as a submodular order.…

Optimization and Control · Mathematics 2024-03-01 Rajan Udwani

Multi-winner voting is the process of selecting a fixed-size set of representative candidates based on voters' preferences. It occurs in applications ranging from politics (parliamentary elections) to the design of modern computer…

Computer Science and Game Theory · Computer Science 2022-11-22 Martin Lackner , Piotr Skowron