On the complexity of deciding degeneracy in a bimatrix game with sparse payoff matrix (Q1939257): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2012.10.053 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1983879235 / rank | |||
Normal rank | |||
Latest revision as of 19:36, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of deciding degeneracy in a bimatrix game with sparse payoff matrix |
scientific article |
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
