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

In this paper we present two general results on the existence of a discrete zero point of a function from the n-dimensional integer lattice Zn to the n-dimensional Euclidean space Rn. Under two different boundary conditions, we give a constructive proof using a combinatorial argument based on a...

In this paper we study cooperative games with limited cooperation possibilities, represented by an undirected cycle-free communication graph. Players in the game can cooperate if and only if they are connected in the graph, i.e. they can communicate with one another. We introduce a new...

This paper deals with the optimal provision of infrastructure by means of public-private partnership contracts. Inthe economic literature infrastructure is characterized as a large, indivisible and non-rival capital good thatproduces services for its users. The non-rivalness or nonexcludability...

Many economic and social situations can be represented by a digraph. Both axiomatic and iterativemethods to determine the strength or power of all the nodes in a digraph have been proposed inthe literature. We propose a new method, where the power of a node is determined by both thenumber of its...

In a standard general equilibrium model it is assumed that there are no price restictionsand that prices adjust infinitely fast to their equilibrium values. In this paper the set ofadmissible prices is allowed to be an arbitrary convex set. For such an arbitrary set it cannotbe guaranteed that...

It is well known that an upper semi-continuous compact- and convex-valued mapping fi from a nonempty compact and convex set X to the Euclidean space of which X is a subset has at least one stationary point, being a point in X at which the image fi(x) has a nonempty intersection with the normal...

The triangular array of binomial coefficients, or Pascal's triangle, is formed by starting with an apex of 1. Every row of Pascal's triangle can be seen as a line-graph, to each node of which the corresponding binomial coefficient is assigned. We show that the binomial coefficient of a node is...

In this paper we introduce two values for cooperative games with communication graph structure. For cooperative games the shapley value distributes the worth of the grand coalition amongst the players by taking into account the worths that can be obtained by any coalition of players, but does...