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

We consider finite $n$-person deterministic graphical (DG) games. These gamesare modelled by finite directed graphs (digraphs) $G$ which may have directedcycles and, hence, infinite plays. Yet, it is assumed that all these plays areequivalent and form a single outcome $c$, while the terminal vertices $V_T =\{a_1, \ldots, a_p\}$ form $p$ remaining outcomes. We study the existence ofNash equilibria (NE) in pure stationary strategies. It is known that NE existwhen $n=2$ and may fail to exist when $n > 2$. Yet, the question becomes openfor $n > 2$ under the following extra condition: (C) For each of $n$ players,$c$ is worse than each of $p$ terminal outcomes. In other words, all playersare interested in terminating the play, which is a natural assumption.Moreover, Nash-solvability remains open even if we replace (C) by a weakercondition: (C22) There exist no two players for whom $c$ is better than (atleast) two terminal outcomes. We conjecture that such two players exist in eachNE-free DG game, or in other words, that (C22) implies Nash-solvability, forall $n$. Recently, the DG games were extended to a wider class of the DGmulti-stage (DGMS) games, whose outcomes are the strongly connected components(SCC) of digraph $G$. Merging all outcomes of a DGMS game that correspond toits non-terminal SCCs we obtain a DG game. Clearly, this operation respectsNash-solvability (NS). Basic conditions and conjectures related to NS can beextended from the DG to DGMS games: in both cases NE exist if $n=2$ and mayfail to exist when $n > 2$; furthermore, we modify conditions (C) and (C22) toadapt them for the DGMS games. Keywords: $n$-person deterministic graphical(multi-stage) games, Nash equilibrium, Nash-solvability, pure stationarystrategy, digraph, directed cycle, strongly connected component.

On Nash-solvability of finite $n$-person deterministic graphical games; Catch 22