Provides complexity results for deciding existence of Pareto optimal and high social welfare equilibria in multiplayer reachability games.
In: Logical Foundations of Computer Science, I nternational Sympo- sium, LFCS 2013, San Diego, CA, USA, January 6-8
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On Relevant Equilibria in Reachability Games
Provides complexity results for deciding existence of Pareto optimal and high social welfare equilibria in multiplayer reachability games.