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 Tools annual

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 Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

We introduce the notion of linearly representable games. Broadly speaking,these are TU games that can be described by as many parameters as the number ofplayers, like weighted voting games, airport games, or bankruptcy games. Weshow that the Shapley value calculation is pseudo-polynomial for linearlyrepresentable games. This is a generalization of many classical and recentresults in the literature. Our method naturally turns into a strictlypolynomial algorithm when the parameters are polynomial in the number ofplayers.

Linearly representable games and pseudo-polynomial calculation of the Shapley value