The Linear Complementarity Problem
AbstractThis study centers on the task of efficiently finding a solution of the linear complementarity problem: Ix - My = q, x \ge 0, y \ge 0, x \perp y. The main results are: (1) It is shown that Lemke's algorithm will solve (or show no solution exists) the problem for M \in L where L is a class of matrices, which properly includes (i) certain copositive matrices, (ii) certain matrices with nonnegative principal minors, (iii) matrices for bimatrix games. (2) If M \in L, if the system Ix - My = q, x \ge 0, y \ge 0 is feasible and nondegenerate, then the corresponding linear complementarity problem has an odd number of solutions. If M \in L and q > 0 then the solution is unique. (3) If for some M and every q \ge 0 the problem has a unique solution then M \in L and the problem has a solution for every q. (4) If M has nonnegative principal minors and if the linear complementarity with M and q has a nondegenerate complementary solution then the solution is unique. (5) If y TMy + y Tq is bounded below on y \ge 0 then the linear complementarity problem with M and q has a solution and Lemke's algorithm can be used to find such a solution. If, in addition, the problem is nondegenerate, then it has an odd number of solutions. (6) A procedure based on Lemke's algorithm is developed which either computes stationary points for general quadratic programs or else shows that the program has no optimum. (7) If a quadratic program has an optimum and satisfies a nondegeneracy condition then there are an odd number of stationary points.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by INFORMS in its journal Management Science.
Volume (Year): 17 (1971)
Issue (Month): 9 (May)
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Anne Balthasar, 2010. "Equilibrium tracing in strategic-form games," Economic Theory, Springer, vol. 42(1), pages 39-54, January.
- Herings, P.J.J. & Elzen, A.H. van den, 1998.
"Computation of the Nash Equilibrium Selected by the Tracing Procedure in N-Person Games,"
1998-04, Tilburg University, Center for Economic Research.
- Herings, P. Jean-Jacques & van den Elzen, Antoon, 2002. "Computation of the Nash Equilibrium Selected by the Tracing Procedure in N-Person Games," Games and Economic Behavior, Elsevier, vol. 38(1), pages 89-117, January.
- Herings, P. Jean-Jacques & Elzen, Antoon van den, 2002. "Computation of the Nash equilibrium selected by the tracing procedure in N-Person games," Open Access publications from Maastricht University urn:nbn:nl:ui:27-5797, Maastricht University.
- Govindan, Srihari & Wilson, Robert B., 2007.
"A Decomposition Algorithm for N-Player Games,"
1967, Stanford University, Graduate School of Business.
- Herings, P.J.J. & Laan, G. van der & Talman, A.J.J., 1998.
"Price-Quantity Adjustment in a Keynesian Economy,"
1998-118, Tilburg University, Center for Economic Research.
- Herings, P.J.J. & Laan, G. van der & Talman, A.J.J., 1999. "Price-Quantity Adjustment in a Keynesian Economy," Open Access publications from Maastricht University urn:nbn:nl:ui:27-5971, Maastricht University.
- Thomas Quint & Martin Shubik, 1994. "On the Number of Nash Equilibria in a Bimatrix Game," Cowles Foundation Discussion Papers 1089, Cowles Foundation for Research in Economics, Yale University.
- Christian Bidard & Guido Erreygers, 1998. "The number and type of long-term equilibria," Journal of Economics, Springer, vol. 67(2), pages 181-205, June.
- Thomas Quint & Martin Shubik, 1995.
"A Bound on the Number of Nash Equilibria in a Coordination Game,"
Cowles Foundation Discussion Papers
1095, Cowles Foundation for Research in Economics, Yale University.
- Quint, Thomas & Shubik, Martin, 2002. "A bound on the number of Nash equilibria in a coordination game," Economics Letters, Elsevier, vol. 77(3), pages 323-327, November.
- Richard Cottle, 2010. "A field guide to the matrix classes found in the literature of the linear complementarity problem," Journal of Global Optimization, Springer, vol. 46(4), pages 571-580, April.
- Govindan, Srihari & Wilson, Robert, 2003. "A global Newton method to compute Nash equilibria," Journal of Economic Theory, Elsevier, vol. 110(1), pages 65-86, May.
- Gailly, B. & Installe, M. & Smeers, Y., 2001. "A new resolution method for the parametric linear complementarity problem," European Journal of Operational Research, Elsevier, vol. 128(3), pages 639-646, February.
- Bernhard Stengel, 2010. "Computation of Nash equilibria in finite games: introduction to the symposium," Economic Theory, Springer, vol. 42(1), pages 1-7, January.
- Shu-Cherng Fang & Elmor L. Peterson, 1979. "A Unification and Generalization of the Eaves and Kojima Fixed Point Representations of the Complementarity Problem," Discussion Papers 365, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc).
If references are entirely missing, you can add them using this form.