From Incomplete Preferences to Ranking via Optimization
Pavel Chebotarev, Elena Shamis
Abstract
We consider methods for aggregating preferences that are based on the resolution of discrete optimization problems. The preferences are represented by arbitrary binary relations (possibly weighted) or incomplete paired comparison matrices. This incomplete case remains practically unexplored so far. We examine the properties of several known methods and propose one new method. In particular, we test whether these methods obey a new axiom referred to as Self-Consistent Monotonicity. Some results are established that characterize solutions of the related optimization problems.
Create a lesson
Related papers
Stable Movement for Nondual Lipschitz Convex Optimization: Efficiency and Nearly Optimal Oracle Rates
David Martínez-Rubio, Cristóbal Guzmán
The First-Order Oracle Complexity of Lipschitz Convex Optimization in Nondual Settings
David Martínez-Rubio, Brian Bullins, Cristóbal Guzmán et al.
Complexity Of Output Feedback Stabilization
Amir Ali Ahmadi, Abraar Chaudhry, Ijay Narang et al.
Convergence rate of the moment-SOS hierarchy for univariate polynomial optimization
Didier Henrion, Mohab Safey El Din
Geometry and Convergence of Quadratically Regularized Optimal Transport I
Alberto González-Sanz, Marcel Nutz
Constraint Qualifications and Gradient Flows for Block Vanishing Constraint Problems
Julian Niederer, Christoph Hansknecht, Andreas Potschka et al.