On the complexity of deciding degeneracy in a bimatrix game with sparse payoff matrix (Q1939257)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the complexity of deciding degeneracy in a bimatrix game with sparse payoff matrix |
scientific article; zbMATH DE number 6140785
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of deciding degeneracy in a bimatrix game with sparse payoff matrix |
scientific article; zbMATH DE number 6140785 |
Statements
On the complexity of deciding degeneracy in a bimatrix game with sparse payoff matrix (English)
0 references
4 March 2013
0 references
computational economics
0 references
bimatrix game
0 references
degeneracy
0 references
sparsity
0 references
NP-complete
0 references
0.8141728043556213
0 references
0.7925282120704651
0 references
0.7711530923843384
0 references
0.7597172260284424
0 references