In this chapter we give an overview on the theory of noncooperative games. In the first part we consider in detail for zero-sum (and constant-sum) noncooperative games under which necessary and sufficient conditions on the payoff function and different (extended) strategy sets for both players...

In this paper we will discuss a general framework for single item inventory models based on the theory of regenerative processes. After resenting without proof the main theorems for regenerative processes we analyze in detail how the different single item models can be embedded within this...

In this paper we analyse the optimal claim behaviour of a risk sensitive policy holder having a vehicle damage insurance. It is proved that the optimal decision is of the form: to claim for damages only if its amount exceeds a certain limit. Moreover, we also derive the optimal stopping rule to...

In this paper we review and unify some of the classes of generalized convex functions introduced by different authors to prove minimax results in infinite dimensional spaces and show the relations between those classes. We also list for the most general class already introduced by Jeyakumar an...

In this paper we consider stochastic purchase timing models used in marketing for low-involvement products and show that important characteristics of those models are easy to compute. As such these calculations are based on an elementary probabilistic argument and cover not only the well-known...

In this paper which will appear as a chapter in the Handbook of Generalized Convexity we discuss the basic ideas of convex and quasiconvex analysis in finite dimensional Euclidean spaces. To illustrate the usefulness of this branch of mathematics also applications to optimization theory and...

In this note we derive the expected total discounted profit of an insurer due to a single policy holder within a third-party liability insurance. We consider both a policy holder claiming optimally and non-optimally.

This paper proposes a deep cut version of the ellipsoid algorithm for solving a general class of continuous convex programming problems. In each step the algorithm does not require more computational effort to construct these deep cuts than its corresponding central cut version. Rules that...

In this note we review some known minimax theorems with applications in game theory and show that these results form an equivalent chain which includes the strong separation result in finite dimensional spaces between two disjoint closed convex sets of which one is compact. By simplifying the...

In this note we show that the strong duality theorem of an unconstrained (generalized) geometric programming problem as defined by Peterson (cf.[1]) is actually a special case of a Lagrangian duality result. Contrary to [1] we also consider the case that the set C is compact and convex and in...