On the complexity of deciding degeneracy in a bimatrix game with sparse payoff matrix.
Ye DuPublished in: Theor. Comput. Sci. (2013)
Keyphrases
- nash equilibrium
- game theory
- nash equilibria
- worst case
- game theoretic
- coefficient matrix
- high dimensional
- computational complexity
- sparse data
- video games
- singular value decomposition
- low rank
- rank minimization
- mixed strategy
- low rank matrix
- online game
- solution concepts
- stochastic games
- sparse matrix
- low rank matrices
- cooperative
- repeated games
- monte carlo
- linear algebra
- compressive sensing
- covariance matrix
- space complexity
- educational games