Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2603.22814 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915886420459520 |
|---|---|
| author | Chen, Jiehua |
| author_facet | Chen, Jiehua |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_22814 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | MP-Aggregation MP(R,2-WO) is Polynomial-Time Solvable When the Output Should Be Dichotomous Weak Preference Order Chen, Jiehua Computational Complexity 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. |
| title | MP-Aggregation MP(R,2-WO) is Polynomial-Time Solvable When the Output Should Be Dichotomous Weak Preference Order |
| topic | Computational Complexity |
| url | https://arxiv.org/abs/2603.22814 |