Extending Finite Memory Determinacy to Multiplayer Games
Extending Finite Memory Determinacy to Multiplayer Games
We show that under some general conditions the finite memory determinacy of a class of two-player win/lose games played on finite graphs implies the existence of a Nash equilibrium built from finite memory strategies for the corresponding class of multi-player multi-outcome games. This generalizes a previous result by Brihaye, De …