In this paper an algorithm is proposed to find an integral solution of (nonlinear) complementarity problems. The … algorithm starts with a nonnegative integral point and generates a unique sequence of adjacent integral simplices of varying … dimension. Conditions are stated under which the algorithm terminates with a simplex one of whose vertices is an integral …

the triangulation lies in a cube of size one. With respect to this triangulation we assume that the function satisfies … prove this we use a simplicial algorithm that terminates with a zero point within a finite number of iterations. The …

the triangulation lies in a cube of size one. With respect to this triangulation we assume that the function satisfies … prove this we use a simplicial algorithm that terminates with a zero point within a finite number of iterations. The …

Tucker's well-known combinatorial lemma states that for any given symmetric triangulation of the n-dimensional unit … cube and for any integer labeling that assigns to each vertex of the triangulation a label from the set {1,2,...n,-1 …,-2,....-n} with the property that antipodal vertices on the boundary of the cube are assigned opposite labels, the triangulation …

of the triangulation lies in an n-dimensional cube of size one. With respect to this triangulation we assume that the … zero point. To prove this we use a simplicial algorithm that terminates with a zero point within a finite number of …

proof using a combinatorial argument based on a simplicial algorithm with vector labeling and lexicographic linear … programming pivot steps. We also adept the algorithm to prove the existence of a solution to the discrete complementarity problem. …

expositions of the Lemke-Howson algorithm and the Van den Elzen-Talman algorithm to compute Nash equilibria in 2-person games, and …