Showing 1 - 10 of 18
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>
Persistent link: https://ebvufind01.dmz1.zbw.eu/10011256600
This discussion paper resulted in a publication in 'Mathematical Programming', ser. A, 2006, 108, 127-134. <P>
Persistent link: https://ebvufind01.dmz1.zbw.eu/10011256768
This discussion paper resulted in a publication in the 'Journal of Optimization Theory and Applications', 2010, 144, 391-407. <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...</p>
Persistent link: https://ebvufind01.dmz1.zbw.eu/10011257467
Any function from a non-empty polytope into itself that is locally gross direction preserving is shown to have the fixed point property. Brouwer's fixed point theorem for continuous functions is a special case. We discuss the application of the result in the area of non-cooperative game...</p>
Persistent link: https://ebvufind01.dmz1.zbw.eu/10011257532
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 integrally convex, which implies that the convex hull of the set can be subdivided in simplices such that...
Persistent link: https://ebvufind01.dmz1.zbw.eu/10004964458
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...
Persistent link: https://ebvufind01.dmz1.zbw.eu/10005137089
In this paper we present two general results on the existence of a discrete zero point of a function from the <I>n</I>-dimensional integer lattice Z<SUP><I>n</SUP></I> to the <I>n</I>-dimensional Euclidean space R<SUP><I>n</SUP></I>. Under two different boundary conditions, we give a constructive proof using a combinatorial argument based on a...</i></sup></i></i></sup></i>
Persistent link: https://ebvufind01.dmz1.zbw.eu/10005137126
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...
Persistent link: https://ebvufind01.dmz1.zbw.eu/10005137165
Any function from a non-empty polytope into itself that is locally gross direction preserving is shown to have the fixed point property. Brouwer's fixed point theorem for continuous functions is a special case. We discuss the application of the result in the area of non-cooperative game theory.
Persistent link: https://ebvufind01.dmz1.zbw.eu/10005137207
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...
Persistent link: https://ebvufind01.dmz1.zbw.eu/10005137267