/pdf/convex-analysisnoer-san-nojin-zhan-nituite-5dl2rbmoyr.pdf

Convex Analysisの二,三の進展について

https://polymer.bu.edu/hes/cox79py538.pdf

Option pricing: A simplified approach☆

Convergence of Probability Measures. By P. Billingsley. Chichester, Sussex, Wiley, 1968. xii, 253 p. 9 1/4“. 117s.

Convergence of Probability Measures

This book is intended as an introduction to optimal stochastic control for continuous time Markov processes and to the theory of viscosity solutions. The authors approach stochastic control problems by the method of dynamic programming. The text provides an introduction to dynamic programming for deterministic optimal control problems, as well as to the corresponding theory of viscosity solutions. A new Chapter X gives an introduction to the role of stochastic optimal control in portfolio optimization and in pricing derivatives in incomplete markets. Chapter VI of the First Edition has been completely rewritten, to emphasize the relationships between logarithmic transformations and risk sensitivity. A new Chapter XI gives a concise introduction to two-controller, zero-sum differential games. Also covered are controlled Markov diffusions and viscosity solutions of Hamilton-Jacobi-Bellman equations. The authors have tried, through illustrative examples and selective material, to connect stochastic control theory with other mathematical areas (e.g. large deviations theory) and with applications to engineering, physics, management, and finance. In this Second Edition, new material on applications to mathematical finance has been added. Concise introductions to risk-sensitive control theory, nonlinear H-infinity control and differential games are also included.

/pdf/controlled-markov-processes-and-viscosity-solutions-4n8p6ywj5v.pdf

Controlled Markov processes and viscosity solutions

The author's preface gives an outline: "This book is about weakconvergence methods in metric spaces, with applications sufficient to show their power and utility. The Introduction motivates the definitions and indicates how the theory will yield solutions to problems arising outside it. Chapter 1 sets out the basic general theorems, which are then specialized in Chapter 2 to the space C[0, l ] of continuous functions on the unit interval and in Chapter 3 to the space D [0, 1 ] of functions with discontinuities of the first kind. The results of the first three chapters are used in Chapter 4 to derive a variety of limit theorems for dependent sequences of random variables. " The book develops and expands on Donsker's 1951 and 1952 papers on the invariance principle and empirical distributions. The basic random variables remain real-valued although, of course, measures on C[0, l ] and D[0, l ] are vitally used. Within this framework, there are various possibilities for a different and apparently better treatment of the material. More of the general theory of weak convergence of probabilities on separable metric spaces would be useful. Metrizability of the convergence is not brought up until late in the Appendix. The close relation of the Prokhorov metric and a metric for convergence in probability is (hence) not mentioned (see V. Strassen, Ann. Math. Statist. 36 (1965), 423-439; the reviewer, ibid. 39 (1968), 1563-1572). This relation would illuminate and organize such results as Theorems 4.1, 4.2 and 4.4 which give isolated, ad hoc connections between weak convergence of measures and nearness in probability. In the middle of p. 16, it should be noted that C*(S) consists of signed measures which need only be finitely additive if 5 is not compact. On p. 239, where the author twice speaks of separable subsets having nonmeasurable cardinal, he means "discrete" rather than "separable." Theorem 1.4 is Ulam's theorem that a Borel probability on a complete separable metric space is tight. Theorem 1 of Appendix 3 weakens completeness to topological completeness. After mentioning that probabilities on the rationals are tight, the author says it is an

Convergence of probability measures

The QNET method for two-moment analysis of multiclass open networks is extended to allow complex workstations of various types. For example, the extension described here allows one to treat stations where several unreliable machines are tended by a small number of repair technicians, or stations where several machines that require setups are tended by a small number of operators. To illustrate the general concepts, a four-station manufacturing example is discussed in detail. In the QNET method, one first replaces the original queueing network by an approximating Brownian system model. The Brownian approximation is motivated by heavy traffic theory, and to achieve a unified treatment of complex workstations within the QNET framework we apply the following principle: For purposes of heavy traffic analysis, a workstation can be characterized by just two parameters, the asymptotic mean and asymptotic variance of its cumulative potential output process. This heavy traffic principle has long been known to researchers in the field, but we show that it has power and utility even in circumstances where the mean and variance parameters cannot be determined analytically. We explain how the heavy traffic principle can be applied successfully under certain conditions, and show by example that those conditions are not always met.

Two-Moment Analysis of Open Queueing Networks with General Workstation Capabilities

On the virtual and actual waiting time distributions of a GI/G/ 1 queue

Generalizing earlier work on staffing and routing in telephone call centers, we consider a processing network model with large server pools and doubly stochastic input flows. In this model the processing of a job may involve several distinct operations. Alternative processing modes are also allowed. Given a finite planning horizon, attention is focused on the two-level problem of capacity choice and dynamic system control. A pointwise stationary fluid model (PSFM) is used to approximate system dynamics, which allows development of practical policies with a manageable computational burden. Earlier work in more restrictive settings suggests that our method is asymptotically optimal in a parameter regime of practical interest, but this paper contains no formal limit theory. Rather, it develops a PSFM calculus that is broadly accessible, with an emphasis on modeling and practical computation.

/pdf/pointwise-stationary-fluid-models-for-stochastic-processing-5epdyd2kli.pdf

Pointwise Stationary Fluid Models for Stochastic Processing Networks

This state-of-the-art account unifies material developed in journal articles over the last 35 years, with two central thrusts: It describes a broad class of system models that the authors call 'stochastic processing networks' (SPNs), which include queueing networks and bandwidth sharing networks as prominent special cases; and in that context it explains and illustrates a method for stability analysis based on fluid models. The central mathematical result is a theorem that can be paraphrased as follows: If the fluid model derived from an SPN is stable, then the SPN itself is stable. Two topics discussed in detail are (a) the derivation of fluid models by means of fluid limit analysis, and (b) stability analysis for fluid models using Lyapunov functions. With regard to applications, there are chapters devoted to max-weight and back-pressure control, proportionally fair resource allocation, data center operations, and flow management in packet networks. Geared toward researchers and graduate students in engineering and applied mathematics, especially in electrical engineering and computer science, this compact text gives readers full command of the methods.

Processing Networks : Fluid Models and Stability

Consider a firm that markets multiple products, each manufactured using several resources representing various types of capital and labor, and a linear production technology. The firm faces uncertain product demand and has the option to dynamically readjust its resource investment levels, thereby changing the capacities of its linear manufacturing process. The cost to adjust a resource level either up or down is assumed to be linear. The model developed here explicitly incorporates both capacity investment decisions and production decisions, and is general enough to include reversible and irreversible investment. The product demand vectors for successive periods are assumed to be independent and identically distributed. The optimal investment strategy is determined with a multi-dimensional newsvendor model using demand distributions, a technology matrix, prices (product contribution margins), and marginal investment costs. Our analysis highlights an important conceptual distinction between deterministic and stochastic environments: the optimal investment strategy in our stochastic model typically involves some degree of capacity imbalance which can never be optimal when demand is known.

J. Michael Harrison

Papers

Two-Moment Analysis of Open Queueing Networks with General Workstation Capabilities

On the virtual and actual waiting time distributions of a GI/G/ 1 queue

Pointwise Stationary Fluid Models for Stochastic Processing Networks

Processing Networks : Fluid Models and Stability

Multi-Resource Investment Strategies: Operational Hedging Under Demand Uncertainty