Equilibria in Schelling Games: Computational Complexity and Robustness.
Luca KreiselNiclas BoehmerVincent FroeseRolf NiedermeierPublished in: CoRR (2021)
Keyphrases
- computational complexity
- nash equilibria
- game theoretic
- game theory
- nash equilibrium
- pure nash equilibria
- decision problems
- computational efficiency
- extensive form games
- pure strategy
- pure nash equilibrium
- repeated games
- special case
- stochastic games
- cooperative
- solution concepts
- fixed point
- educational games
- long run
- incomplete information
- high computational complexity
- computer games
- weighted majority
- fictitious play
- np complete
- memory requirements
- game development
- multiagent learning
- computationally efficient
- data sets
- np hard
- computational cost
- games with incomplete information
- general game playing
- game play