prove this we use a simplicial algorithm that terminates with a zero point within a finite number of iterations. The …

-called peer group games being non-negative additive games on a permission tree. We provide a polynomial time algorithm for …

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 …