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 prove an $\Omega(n^2)$ lower bound on the query complexity of localproportionality in the Robertson-Webb cake-cutting model. Local proportionalityrequires that each agent prefer their allocation to the average of theirneighbors' allocations in some undirected social network. It is a weakerfairness notion than envy-freeness, which also has query complexity$\Omega(n^2)$, and generally incomparable to proportionality, which has querycomplexity $\Theta(n \log n)$. This result separates the complexity of localproportionality from that of ordinary proportionality, confirming the intuitionthat finding a locally proportional allocation is a more difficultcomputational problem.

Thou Shalt Covet The Average Of Thy Neighbors' Cakes