Solution Concepts and Algorithms for Infinite Multiplayer Games

@inproceedings{Ummels2008SolutionCA,
  title={Solution Concepts and Algorithms for Infinite Multiplayer Games},
  author={Michael Ummels},
  year={2008}
}
We survey and discuss several solution concepts for infinite turn-based multiplayer games with qualitative (i.e. win-lose) objectives of the players. These games generalise in a natural way the common model of games in verification which are two-player, zero-sum games with ω-regular winning conditions. The generalisation is in two directions: our games may have more than two players, and the objectives of the players need not be completely antagonistic. The notion of a Nash equilibrium is the… CONTINUE READING