Provides complexity results for the constrained existence problem of five equilibrium notions in multiplayer graph games.
Henzinger & Nir Piterman (2010): Strategy logic
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.GT 2verdicts
UNVERDICTED 2representative citing papers
Monadic fixed-point logic with counting is proposed as a natural specification language for properties on improvement graphs in social choice and games, with an efficient model checking algorithm whose complexity depends on graph size.
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.
-
Reasoning about Social Choice and Games in Monadic Fixed-Point Logic
Monadic fixed-point logic with counting is proposed as a natural specification language for properties on improvement graphs in social choice and games, with an efficient model checking algorithm whose complexity depends on graph size.