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 Tools annual

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 Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

We study the problem of assigning objects to agents in the presence ofarbitrary linear constraints when agents are allowed to be indifferent betweenobjects. Our main contribution is the generalization of the (Extended)Probabilistic Serial mechanism via a new mechanism called the ConstrainedSerial Rule. This mechanism is computationally efficient and maintainsdesirable efficiency and fairness properties namely constrained ordinalefficiency and envy-freeness among agents of the same type. Our mechanism isbased on a linear programming approach that accounts for all constraints andprovides a re-interpretation of the bottleneck set of agents that form acrucial part of the Extended Probabilistic Serial mechanism.

Constrained Serial Rule on the Full Preference Domain