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...

We study cooperative games with communication structure, represented by an undirected graph. Players in the game are able to cooperate only if they can form a network in the graph. A single-valued solution, the average tree solution, is proposed for this class of games. Given the graph structure...