In this paper we will consider two-person zero-sum games and derive a general approach for solving them. We apply this approach to a queueing problem. In section 1 we will introduce the model and formulate the Key-theorem. In section 2 we develop the theory that we will use in section 3 to prove...

We study the applicability of the method of Dynamic Programming (DP) for the solution of a general class of sequential decision problems under uncertainty, that may more commonly be referred to as discrete-time control problems under uncertainty. The uncertainty is due to the fact that the...

Curiel, Potters, Prasad, Tijs and Veltman (1993) introduced component additive games which are cooperative TU games that arise by imposing an order on the player set. Further, they introduced the β-rule which allocates a core element to each component additive game. In this paper we consider...

The following variant of a classical selection problem is considered. Offers of random size are successively available to a decision-maker at discrete time instants, and he has to select one without having the possibility of recall. At any time he can accept or reject the current offer based on...