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 the Hospitals/Residents problem, every hospital has an upper quota thatlimits the number of residents assigned to it. While, in some applications,each hospital also has a lower quota for the number of residents it receives.In this setting, a stable matching may not exist. Envy-freeness is introducedas a relaxation of stability that allows blocking pairs involving a residentand an empty position of a hospital. While, envy-free matching might not existeither when lower quotas are introduced. We consider the problem of finding afeasible matching that satisfies lower quotas and upper quotas and minimizesenvy in terms of envy-pairs and envy-residents in the Hospitals/Residentproblem with Lower Quota. We show that the problem is NP-hard with both envymeasurement. We also give a simple exponential-time algorithm for theMinimum-Envy-Pair HRLQ problem.

Minimal Envy Matchings in the Hospitals/Residents Problem with Lower Quotas