Extending Finite Memory Determinacy to Multiplayer Games

12 Jul 2016 Roux Stéphane Le Université Libre de Bruxelles Pauly Arno Université Libre de Bruxelles

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 Pril and Schewe... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • COMPUTER SCIENCE AND GAME THEORY
  • LOGIC IN COMPUTER SCIENCE