2 papers
cs.CC2025
MP-Aggregation MP(R,2-WO) is Polynomial-Time Solvable When the Output Should Be Dichotomous Weak Preference Order
Jiehua Chen
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 (po…
cs.MA2025
How Hard is it to Explain Preferences Using Few Boolean Attributes?
Clemens Anzinger, Jiehua Chen, Christian Hatschka +2
We study the computational complexity of explaining preference data through Boolean attribute models (BAMs), motivated by extensive research involving attribute models and their pr…