Provides complexity results for the constrained existence problem of five equilibrium notions in multiplayer graph games.
In: Proceedings of the 12th European Conference on Multi-Agent Systems (EUMAS 2014), Revised Selected Papers, 8953, Springer, pp
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
This paper compiles and discusses several open problems in the modal logic for gossip protocols that use epistemic formulas.
citing papers explorer
-
Equilibria in Multiplayer Graph Games: An Algorithmic Study
Provides complexity results for the constrained existence problem of five equilibrium notions in multiplayer graph games.
-
Open Problems in a Logic of Gossips
This paper compiles and discusses several open problems in the modal logic for gossip protocols that use epistemic formulas.