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

The theory of algorithmic fair allocation is within the center of multi-agentsystems and economics in the last decade due to its industrial and socialimportance. At a high level, the problem is to assign a set of items that areeither goods or chores to a set of agents so that every agent is happy withwhat she obtains. Particularly, in this survey, we focus on indivisible items,for which absolute fairness such as envy-freeness and proportionality cannot beguaranteed. One main theme in the recent research agenda is about designingalgorithms that approximately achieve the fairness criteria. We aim atpresenting a comprehensive survey of recent progresses through the prism ofalgorithms, highlighting the ways to relax fairness notions and commontechniques to design algorithms, as well as the most interesting questions forfuture research.

Algorithmic Fair Allocation of Indivisible Items: A Survey and New Questions