English
Related papers

Related papers: On the additivity of preference aggregation method…

200 papers

We study here preference revision, considering both the monotonic case where the original preferences are preserved and the nonmonotonic case where the new preferences may override the original ones. We use a relational framework in which…

Databases · Computer Science 2007-05-23 Jan Chomicki , Joyce Song

This paper characterizes lexicographic preferences over alternatives that are identified by a finite number of attributes. Our characterization is based on two key concepts: a weaker notion of continuity called 'mild continuity' (strict…

Theoretical Economics · Economics 2021-08-10 Mridu Prabal Goswami , Manipushpak Mitra , Debapriya Sen

The rapid advancement and widespread adoption of machine learning-driven technologies have underscored the practical and ethical need for creating interpretable artificial intelligence systems. Feature importance, a method that assigns…

Machine Learning · Computer Science 2023-12-07 Nimrod Harel , Uri Obolski , Ran Gilad-Bachrach

In-degree, PageRank, number of visits and other measures of Web page popularity significantly influence the ranking of search results by modern search engines. The assumption is that popularity is closely correlated with quality, a more…

Information Retrieval · Computer Science 2009-09-29 Sandeep Pandey , Sourashis Roy , Christopher Olston , Junghoo Cho , Soumen Chakrabarti

Nowadays, several crowdsourcing projects exploit social choice methods for computing an aggregate ranking of alternatives given individual rankings provided by workers. Motivated by such systems, we consider a setting where each worker is…

Computer Science and Game Theory · Computer Science 2018-11-27 Ioannis Caragiannis , Xenophon Chatzigeorgiou , George A. Krimpas , Alexandros A. Voudouris

Combinatorial Scoring games, with the property `extra pass moves for a player does no harm', are characterized. The characterization involves an order embedding of Conway's Normal-play games. Also, we give a theorem for comparing games with…

Combinatorics · Mathematics 2015-05-11 Urban Larsson , Richard J. Nowakowski , Carlos P. Santos

This paper maps out the relation between different approaches for handling preferences in argumentation with strict rules and defeasible assumptions by offering translations between them. The systems we compare are: non-prioritized defeats…

Artificial Intelligence · Computer Science 2017-10-02 Jesse Heyninck , Christian Straßer , Pere Pardo

The connection between inequalities in additive combinatorics and analogous versions in terms of the entropy of random variables has been extensively explored over the past few years. This paper extends a device introduced by Ruzsa in his…

Combinatorics · Mathematics 2019-05-28 Alberto Espuny Díaz , Oriol Serra

Prior proposals for cumulative statistics suggest making tiny random perturbations to the scores (independent variables in a regression) in order to ensure the scores' uniqueness. Uniqueness means that no score for any member of the…

Methodology · Statistics 2022-08-23 Mark Tygert

The problem of relevance ranking consists of sorting a set of objects with respect to a given criterion. Since users may prefer different relevance criteria, the ranking algorithms should be adaptable to the user needs. Two main approaches…

Machine Learning · Computer Science 2023-11-06 Leonardo Rigutini , Tiziano Papini , Marco Maggini , Franco Scarselli

Rankings on online platforms help their end-users find the relevant information -- people, news, media, and products -- quickly. Fair ranking tasks, which ask to rank a set of items to maximize utility subject to satisfying group-fairness…

Computers and Society · Computer Science 2023-06-22 Sruthi Gorantla , Anay Mehrotra , Amit Deshpande , Anand Louis

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…

Multiagent Systems · Computer Science 2021-01-08 Joseph Singleton , Richard Booth

TOPSIS, a popular method for ranking alternatives is based on aggregated distances to ideal and anti-ideal points. As such, it was considered to be essentially different from widely popular and acknowledged `utility-based methods', which…

Artificial Intelligence · Computer Science 2025-04-14 Robert Susmaga , Izabela Szczech

As the issue of robustness in AI systems becomes vital, statistical learning techniques that are reliable even in presence of partly contaminated data have to be developed. Preference data, in the form of (complete) rankings in the simplest…

Machine Learning · Computer Science 2023-03-24 Morgane Goibert , Clément Calauzènes , Ekhine Irurozki , Stéphan Clémençon

We consider the problem of statistical inference for ranking data, specifically rank aggregation, under the assumption that samples are incomplete in the sense of not comprising all choice alternatives. In contrast to most existing methods,…

Machine Learning · Statistics 2017-12-05 Mohsen Ahmadi Fahandar , Eyke Hüllermeier , Inés Couso

This paper explores a novel way for analyzing the tournament structures to find a best suitable one for the tournament under consideration. It concerns about three aspects such as tournament conducting cost, competitiveness development and…

Artificial Intelligence · Computer Science 2016-11-28 Nhien Pham Hoang Bao , Hiroyuki Iida

Reasoning about agent preferences on a set of alternatives, and the aggregation of such preferences into some social ranking is a fundamental issue in reasoning about uncertainty and multi-agent systems. When the set of agents and the set…

Computer Science and Game Theory · Computer Science 2012-07-19 Moshe Tennenholtz

Many complex phenomena, from the selection of traits in biological systems to hierarchy formation in social and economic entities, show signs of competition and heterogeneous performance in the temporal evolution of their components, which…

In coalitional games, a player $i$ is regarded as strictly more desirable than player $j$ if substituting $j$ with $i$ within any coalition leads to a strict augmentation in the value of certain coalitions, while preserving the value of the…

Computer Science and Game Theory · Computer Science 2024-04-30 Michele Aleandri , Felix Fritz , Stefano Moretti

This paper analyses properties of conceptual hierarchy obtained via incremental concept formation method called "flexible prediction" in order to determine what kind of "relevance" of participating attributes may be requested for meaningful…

Artificial Intelligence · Computer Science 2020-05-26 Mieczyslaw A. Klopotek , Andrzej Matuszewski