59 citations · 165 across the 7 of their papers we have counts for
7 papers
From Incomplete Preferences to Ranking via Optimization
Pavel Chebotarev, Elena Shamis
We consider methods for aggregating preferences that are based on the resolution of discrete optimization problems. The preferences are represented by arbitrary binary relations (p…
Characterizations of scoring methods for preference aggregation
Pavel Chebotarev, Elena Shamis
The paper surveys more than forty characterizations of scoring methods for preference aggregation and contains one new result. A general scoring operator is {\it self-consistent} i…
On Proximity Measures for Graph Vertices
Pavel Chebotarev, Elena Shamis
We study the properties of several proximity measures for the vertices of weighted multigraphs and multidigraphs. Unlike the classical distance for the vertices of connected graphs…
The Matrix-Forest Theorem and Measuring Relations in Small Social Groups
Pavel Chebotarev, Elena Shamis
We propose a family of graph structural indices related to the Matrix-forest theorem. The properties of the basic index that expresses the mutual connectivity of two vertices are s…
Matrix-Forest Theorems
Pavel Chebotarev, Elena Shamis
The Laplacian matrix of a graph is , where is the adjacency matrix and is the diagonal matrix of vertex degrees. According to the Matrix-Tree Theo…
Preference fusion when the number of alternatives exceeds two: indirect scoring procedures
Pavel Chebotarev, Elena Shamis
We consider the problem of aggregation of incomplete preferences represented by arbitrary binary relations or incomplete paired comparison matrices. For a number of indirect scorin…