Tight Inapproximability for Graphical Games.
Argyrios DeligkasJohn FearnleyAlexandros HollenderThemistoklis MelissourgosPublished in: CoRR (2022)
Keyphrases
- approximation algorithms
- lower bound
- worst case
- video games
- computer games
- nash equilibria
- nash equilibrium
- game playing
- game design
- game theory
- upper bound
- educational games
- game theoretic
- direct manipulation
- two player games
- data sets
- imperfect information
- human computation
- learning games
- board game
- weighted majority
- simulation game
- pure nash equilibria