MP-Aggregation MP(R,2-WO) is Polynomial-Time Solvable When the Output Should Be Dichotomous Weak Preference Order

Read full text Summarise with VIRAT
Authors: Jiehua Chen
Cited by: 0
References: 4

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

We consider the median procedure (Barthelemy and Monjardet, 1981) that aggregates a sequence n of binary relations from some input class into a single binary relation from some (possibly different) output class, minimizing the number of disagreed order pairs. We show that if the output class should be a dichotomous weak order (2-WO), then the problem is polynomial-time solvable.

Fields of Study & Subjects

Game Theory and Voting Systems Complexity and Algorithms in Graphs Advanced Graph Theory Research

Publication details

Journal / source
arXiv (Cornell University)
Publication date
1 March 2026
Language
EN
Document type
Preprint