In this paper we study Markov Decision Process (MDP) problems with the restriction that at decision epochs only a finite number of given Markovian decision rules may be applied. The elements of the finite set of allowed decision rules should be mixed to improve the performance. The set of...

A version of the classical secretary problem is studied, in which one is interested in selecting one of the <I>b</I> best out of a group of <I>n</I> differently ranked persons who are presented one by one in a random order. It is assumed that <I>b</I> is bigger than or equal to 1 is a preassigned number. It is...</i></i></i>

This discussion paper resulted in a publication in <A href="http://journals.cambridge.org/action/displayAbstract?fromPage=online&aid=8239378&fulltextType=RA&fileId=S026996481000032X">'Probability in the Engineering and Informational Sciences'</A>, 25(2), 157-69.<p>A version of the classical secretary problem is studied, in which one is interested in selecting one of the <I>b</I> best out of a group of <I>n</I> differently ranked persons who are...</i></i></p></a>

In this paper we study Markov Decision Process (MDP) problems with the restriction that at decision epochs only a finite number of given Markovian decision rules may be applied. The elements of the finite set of allowed decision rules should be mixed to improve the performance. The set of...

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>

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>

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

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>

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