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

In many-to-many matching models, substitutable preferences constitute thelargest domain for which a pairwise stable matching is guaranteed to exist. Inthis note, we extend the recently proposed algorithm of Hatfield et al. [3] totest substitutability of weak preferences. Interestingly, the algorithm isfaster than the algorithm of Hatfield et al. by a linear factor on the domainof strict preferences.

Testing Substitutability of Weak Preferences