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 initiate the work on fair and strategyproof allocation of indivisiblechores. The fairness concept we consider in this paper is maxmin share (MMS)fairness. We consider three previously studied models of information elicitedfrom the agents: the ordinal model, the cardinal model, and the public rankingmodel in which the ordinal preferences are publicly known. We present bothpositive and negative results on the level of MMS approximation that can beguaranteed if we require the algorithm to be strategyproof. Our results uncoversome interesting contrasts between the approximation ratios achieved for choresversus goods.

Strategyproof and Approximately Maxmin Fair Share Allocation of Chores