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>

This discussion paper resulted in a publication in the 'Economic Theory', 2015, 58, 99-123.<P> In the literature various models of games with restricted cooperation can be found. In those models, instead of allowing for all subsets of the set of players to form, it is assumed that the set of...</p>

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 discussion paper led to a publication in 'Social Choice and Welfare', 2005, 24, 439-454.<P> 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...</p>

This discussion paper resulted in a publication in the 'SIAM Journal on Optimization', 2007, 18, 290-308. <P> 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...</p>

This discussion paper resulted in a publication in 'Mathematical Programming', ser. A, 2006, 108, 127-134. <P>