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

Nash equilibrium is one of the most influential solution concepts in gametheory. With the development of computer science and artificial intelligence,there is an increasing demand on Nash equilibrium computation, especially forInternet economics and multi-agent learning. This paper reviews variousalgorithms computing the Nash equilibrium and its approximation solutions infinite normal-form games from both theoretical and empirical perspectives. Forthe theoretical part, we classify algorithms in the literature and presentbasic ideas on algorithm design and analysis. For the empirical part, wepresent a comprehensive comparison on the algorithms in the literature overdifferent kinds of games. Based on these results, we provide practicalsuggestions on implementations and uses of these algorithms. Finally, wepresent a series of open problems from both theoretical and practicalconsiderations.

A survey on algorithms for Nash equilibria in finite normal-form games