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/

Zendy Plus

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

Zendy Tools

Zendy Open

We describe a 3-person, 2-cut envy-free cake-cutting algorithm, inspired by a continuous moving-knife procedure, that does not require that the players continuously move knifes across the cake. By having the players submit their value functions over the cake to a referee—rather than move knives according to these functions—the referee can ensure that the division is not only envy-free but also maximin. In addition, the referee can use the value functions to find a maximally equitable division, whereby the players receive equally valued shares that are maximal, but this allocation may not be envy-free.

3 Persons, 2 Cuts: A Maximin Envy-Free and a Maximally Equitable Cake-Cutting Algorithm