The s-monotone index selection rule for criss-cross algorithms of linear complementarity problems

Zsolt Csizmadia, Tibor Illes, Adrienn Nagy

Research output: Contribution to journalArticle

71 Downloads (Pure)

Abstract

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.
Original languageEnglish
Pages (from-to)103-139
Number of pages37
JournalActa Universitatis Sapientiae, Informatica
Volume5
Issue number1
DOIs
Publication statusPublished - 1 Jul 2013

    Fingerprint

Keywords

  • linear complementarity problem
  • sufficient matrix
  • criss-cross algorithm
  • alternative and EP theorems
  • bi-matrix games
  • Arrow-Debreu market equilibrium problems

Cite this