Approximative solutions of optimal stopping and selection problems
Journal Title: Mathematica Applicanda. Annales Societatis Mathematicae Polonae Series III . - Year 2016, Vol 44, Issue 1
Abstract
In this paper we review a series of developments over the last 15 years in which a general method for the approximative solution of finite discrete time optimal stopping and choice problems has been developed. This method also allows to deal with multiple stopping and choice problems and to deal with stopping or choice problems for some classes of dependent sequences. The basic assumption of this approach is that the sequence of normalized observations when embedded in the plane converges in distribution to a Poisson or to a cluster process. For various classes of examples the method leads to explicit or numerically accessible solutions.
Authors and Affiliations
Ludger Rüschendorf
Selected applications of differential equations in Vanilla Options valuation.
In financial models one of the basic assumptions about investors is that they want to gain as much as it is possible but they have aversion taking the risk. Each investing strategy can be considered as a compromise betwe...
Case study of the complex systems eciency
The subject of considerations shall be mathematical models describing the fluctuation of states of complex systems. The purpose of this work is to give a defined system (considering failures, the activation process and p...
Common-Knowledge and Bayesian Equilibrium in Network Game
In this paper we investigate equilibriums in the Bayesian routing problem of the network game introduced by Koutsoupias and Papadimitriou [LNCS 1563, pp.404-413. Springer (1999)]. We treat epistemic conditions for Nas...
On graduation of enrolment size in a multi-echelon educational system
This paper focuses on an educational system wherein demotion and double promotion are not allowed. The total enrolment in such a system is modelled as a linear model within the context of factor analysis. The goal is to...
On two-parameters generalization of Fibonacci numbers
In this paper we introduce a new two-parameters generalization of Fibonacci numbers – distance s-Fibonacci numbers Fs(k, n). We generalize the known distance Fibonacci numbers by adding an additional integer parameter s....