English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We consider preferences which can be partially ordered and which need to be aggregated. We prove that, under certain conditions, if there are at least two agents and three outcomes, no aggregation system on partially ordered preferences can be fair. These result generalizes Arrow's impossibility theorem for combining total orders. We also provide two sufficient conditions which guarantee fairness for the majority rule over partial orders. This allows us to generalize Sen's theorem for total orders. Finally, we give a generalization of the Muller-Satterthwaite result for social choice functions over partial orders

Aggregating partially ordered preferences:impossibility and possibility results