A Note on the Complexity of P-Matrix LCP and Computing an Equilibrium
| Author(s) : | Nimrod Megiddo, |
| Publisher : | N/A |
| Publication Date : | 1988 |
| ISSN : | N/A |
| Abstract : | Abstract. It is proved that if it is NP-hard to solve the linear complementarity problemwith P-matrix or to compute a Nash-equilibrium point in a 2-player game, then NP = coNP. 1., |