In this paper we introduce the s-monotone index selection rules for the well-known criss-cross method for solving the linear complementarity problem (LCP). Most LCP solution methods require a priori information about the properties of the input matrix. One of the most general matrix properties often required for finiteness of the pivot algorithms (or polynomial complexity of interior point algorithms) is sufficiency. However, there is no known polynomial time method for checking the sufficiency of a matrix (classification of column sufficiency of a matrix is co-NP-complete). Following the ideas of Fukuda, Namiki and Tamura, using Existentially Polynomial (EP)-type theorems, a simple extension of the crisscross algorithm is introduced for LCPs with general matrices. Computational results obtained using the extended version of the criss-cross algorithm for bi-matrix games and for the Arrow-Debreu market equilibrium problem with different market size is presented.
- linear complementarity problem
- sufficient matrix
- criss-cross algorithm
- alternative and EP theorems
- bi-matrix games
- Arrow-Debreu market equilibrium problems
Csizmadia, Z., Illes, T., & Nagy , A. (2013). The s-monotone index selection rule for criss-cross algorithms of linear complementarity problems. Acta Universitatis Sapientiae, Informatica, 5(1), 103-139. https://doi.org/10.2478/ausi-2014-0007