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

Linear complementarity programming is a generalization of linear programmingwhich encompasses the computation of Nash equilibria for bimatrix games. Whilethe latter problem is PPAD-complete, we show that the tropical analogue of thecomplementarity problem associated with Nash equilibria can be solved inpolynomial time. Moreover, we prove that the Lemke--Howson algorithm carriesover the tropical setting and performs a linear number of pivots in the worstcase. A consequence of this result is a new class of (classical) bimatrix gamesfor which Nash equilibria computation can be done in polynomial time.

Tropical complementarity problems and Nash equilibria