⇐ ” holds, we have to slightly change the arena of the game (see Figure 5): we add a vertex ⊥ that we add in the target set of the “existential player

There exists a ﬁnite-memory SPE σ with cost proﬁle c in (X, (v0,I 0)) such that its memory is in O(M + 2|Π | · |Π | · |V |(|Π |+1)·(|Π |+|V |)+1)

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

browse 1 citing papers

representative citing papers

cs.GT · 2019-07-11 · unverdicted · novelty 5.0

Provides complexity results for deciding existence of Pareto optimal and high social welfare equilibria in multiplayer reachability games.

Showing 1 of 1 citing paper.

On Relevant Equilibria in Reachability Games cs.GT · 2019-07-11 · unverdicted · none · ref 24
Provides complexity results for deciding existence of Pareto optimal and high social welfare equilibria in multiplayer reachability games.