This paper is concerned with a finite-horizon optimal selling rule problem when the underlying stock price movements are modeled by a Markov switching Lévy process. Assuming that the transaction fee of the selling operation is a function of the underlying stock price, the optimal selling rule can be obtained by solving an optimal stopping problem. The corresponding value function is shown to be...

The Lindhard-Winther (LW) equipartition sum rule shows that within the linear response theory, the stopping power of an energetic point-charge projectile in a degenerate electron gas medium, receives equal contributions from single-particle and collective excitations in the medium. In this paper we show that the LW sum rule does not necessarily hold for an extended projectile ion and for ion-cl...

Tsetsos, Usher, and Chater (2010) presented several criticisms of decision field theory (DFT) involving its distance function, instability under externally controlled stopping times, and lack of robustness to various multialternative choice scenarios. Here, we counter those claims with a specification of a distance function based on the indifference and dominance dimensions. Using this distance...

Decomposition and Monte Carlo sampling-based algorithms hold much promise for solving stochastic programs with many scenarios. A critical component of such algorithms is a stopping criterion to ensure the quality of the solution. In this paper, we develop a stopping rule theory for a class of algorithms that estimate bounds on the optimal objective function value by sampling. We provide rules f...

A new method, the Dynamical Systems Method (DSM), justified recently, is applied to solving ill-conditioned linear algebraic system (ICLAS). The DSM gives a new approach to solving a wide class of ill-posed problems. In this paper a new iterative scheme for solving ICLAS is proposed. This iterative scheme is based on the DSM solution. An a posteriori stopping rules for the proposed method is ju...

In this work we solve inverse problems coming from the area of Computed Tomography by means of regularization methods based on conjugate gradient iterations. We develop a stopping criterion which is eecient for the computation of a regularized solution for the least{squares normal equations. The stopping rule can be suitably applied also to the Tikhonov regularization method. We report computat...

In the papers (Kaminskas, 1972; Kaminskas and Nemura, 1975; Yin, 1989) the stopping rules of recursive least squares (RLS) are worked out using the ellipsoidal confidence region for the respective parameter vector of a linear dynamic system. The aim of the given paper is the development of the technique for calculating threshold intervals of respective criterions, used in a stopping rule, which...

This paper studies a decentralized, randomized gossip algorithm for computing a majority vote amongst the binary decisions associated to n nodes organized in a fixed, ad-hoc network. It is indicated how this problem can be reduced to computing the global average using a standard, randomized gossip algorithm. Then, we illustrate how the majority vote problem allows one to formulate individual st...