相关论文: Nature and statistics of majority rankings in a dy…
The statistical properties of pairwise majority voting over S alternatives is analyzed in an infinite random population. We first compute the probability that the majority is transitive (i.e. that if it prefers A to B to C, then it prefers…
Rank aggregation is an essential approach for aggregating the preferences of multiple agents. One rule of particular interest is the Kemeny rule, which maximises the number of pairwise agreements between the final ranking and the existing…
Consider n individuals who, by popular vote, choose among q >= 2 alternatives, one of which is "better" than the others. Assume that each individual votes independently at random, and that the probability of voting for the better…
Proportional ranking rules aggregate approval-style preferences of agents into a collective ranking such that groups of agents with similar preferences are adequately represented. Motivated by the application of live Q&A platforms, where…
We introduce a probabilistic pairwise \emph{attraction--repulsion} model for opinion dynamics on multilayer social networks, in which agents hold layer-specific states and interact through random matchings that couple multiple, time-varying…
Aggregating a consensus ranking from multiple input rankings is a fundamental problem with applications in recommendation systems, search engines, job recruitment, and elections. Despite decades of research in consensus ranking aggregation,…
We present a new optimization-based method for aggregating preferences in settings where each voter expresses preferences over pairs of alternatives. Our approach to identifying a consensus partial order is motivated by the observation that…
We model a social network by a random graph whose nodes represent agents and links between two of them stand for a reciprocal interaction; each agent is also associated to a binary variable which represents a dichotomic opinion or…
This paper deals with interactions between committee members as they rank a large list of applicants for a given position and eventually reach consensus. We will see that for a natural deterministic model the ranking can be described by…
We study the problem of approximate ranking from observations of pairwise interactions. The goal is to estimate the underlying ranks of $n$ objects from data through interactions of comparison or collaboration. Under a general framework of…
Kemeny Consensus is a well-known rank aggregation method in social choice theory. In this method, given a set of rankings, the goal is to find a ranking $\Pi$ that minimizes the total Kendall tau distance to the input rankings. Computing a…
We construct and analyze a random graph model for discrete choice with social interaction and several groups of equal size. We concentrate on the case of two groups of equal sizes and we allow the interaction strength within a group to…
In social choice theory, (Kemeny) rank aggregation is a well-studied problem where the goal is to combine rankings from multiple voters into a single ranking on the same set of items. Since rankings can reveal preferences of voters (which a…
We consider systems of agents interacting through topological interactions. These have been shown to play an important part in animal andhuman behavior. Precisely, the system consists of a finite number of particles characterized by their…
We study mathematical models of the collaborative solving of a two-choice discrimination task. We estimate the difference between the shared performance for a group of n observers over a single person performance. Our paper is a theoretical…
Consider a consensus-driven multi-agent dynamic system. The interaction range, which defines the set of neighbors for each agent, plays a key role in influencing connectivity of the underlying network. In this paper, we assume the system is…
Consensus ranking is a technique used to derive a single ranking that best represents the preferences of multiple individuals or systems. It aims to aggregate different rankings into one that minimizes overall disagreement or distance from…
Many multi-agent systems evolve by repeatedly updating each state to a weighted average of its neighbors, a process known as averaging dynamics, whose behavior becomes difficult to analyze when the interaction network varies over time. In…
Social dynamics is concerned primarily with interactions among individuals and the resulting group behaviors, modeling the temporal evolution of social systems via the interactions of individuals within these systems. In particular, the…
The kinetic exchange model has gained popularity in the field of statistical mechanics for investigating wealth interaction. Traditionally, kinetic exchange models have been studied without considering preferential interactions. However, in…