This discussion paper resulted in a publication in 'Games and Economic Behavior', 2010, 68, 626-633. <P> 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...</p>

In this paper we generalize the concept of coalitional games by allowingfor any organizational structure within coalitions represented by a graphon the set of players ot the coalition. A, possibly empty, set of payoffvectors is assigned to any graph on every subset of players. Such a gamewill be...

This discussion paper resulted in a publication in 'Discrete Optimization', 2007, 4, 315-321.<P> 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...</p>

This discussion paper resulted in a publication in the 'SIAM Journal on Optimization', 2006, 16, 854-870. <P> 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...</p>

This discussion paper led to a publication in <A href="http://www.sciencedirect.com/science/article/pii/S0377221711004498">'European Journal of Operational Research'</A>, 214(3), 493-500.<P>We study the existence problem of a zero point of a function defined on a finite set of elements of the integer lattice of the n-dimensional Euclidean space. It is assumed that the set is...</p></a>

<I>Abstract</I><p> See document.<p>

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

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

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

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