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

Contemporary financial stochastic programs typically involve a trade-offbetween return and (downside)-risk. Using stochastic programming we characterize analytically (rather than numerically) the optimal decisions that follow from characteristic single-stage and multi-stage versions of such...

We study strategic negotiation models featuring costless delay, general recognition procedures, endogenous voting orders, and finite sets of alternatives. Two examples show: 1. non-existence of stationary subgame-perfect equilibrium (SSPE). 2. the recursive equations and optimality conditions...

In linear-quadratic control (LQC) problems with singular control cost matrix and/or singular transition matrix, we derive a reduction of the dimension of the Riccati matrix, simplifying iteration and solution. Employing a novel transformation, we show that, under a certain rank condition, the...

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

Response Surface Methodology (RSM) is a tool that was introduced in the early 50's by Box and Wilson (1951). It is a collection of mathematical and statistical techniques useful for the approximation and optimization of stochastic models. Applications of RSM can be found in e.g. chemical,...