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>

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>

In this paper we prove the following fixed point theorem. Consider a non-empty bounded polyhedron P and a function ƒ : P → P such that for every x є P for which ƒ (x) ≠ x there exists δ 0 such that for all y, z є B (x, δ) ∩ P it holds that (ƒ(y)-y)2 (ƒ(z)-z) ≤ 0, where B (x, δ)...

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

We study cooperative games with communication structure, represented by an undirectedgraph. 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 ofgames. Given the graph structure...

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

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