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 consider the task of computing an approximation of a trembling handperfect equilibrium for an n-player game in strategic form, n >= 3. We showthat this task is complete for the complexity class FIXP_a. In particular, thetask is polynomial time equivalent to the task of computing an approximation ofa Nash equilibrium in strategic form games with three (or more) players.

The complexity of approximating a trembling hand perfect equilibrium of a multi-player game in strategic form