Analysis for some properties of discrete time Markov decision processes

This paper investigates properties of the optimality equation and optimal policies in discrete time Markov decision processes with expected discounted total rewards under weak conditions that the model is well defined and the optimality equation is true. The optimal value function is characterized as a solution of the optimality equation and the structure of optimal policies is also given.     

Ideal Free Distribution in Two Patches

In this paper, the formats of Julia sets for a class of nonlinear complex dynamic systems with variable coefficients were studied under certain conditions. For the complex dynamic systems in piecewise cases, we proposed some methods to control the forms of their Julia sets and stable domains analytically. What’s more, we illustrated that our methods worked well by computational simulations. Our work provides a better understanding about how to control the Julia sets of certain complex dynamic systems.     

Optimal recovery of integral operators and its applications

In this paper we present the solution to a problem of recovering a rather arbitrary integral operator based on incomplete information with error. We apply the main result to obtain optimal methods of recovery and compute the optimal error for the solutions to certain integral equations as well as boundary and initial value problems for various PDE’s.     

Optimal intervention under stress scenarios: A case of the Korean financial system

We consider optimal intervention methods under budget constraints when financial systems face economic shocks. We propose two policies formulated by mixed-integer linear programs where regulators inject cash into institutions. One is to minimize systemic losses, and the other is to minimize the number of defaulting institutions. Using publicly available data on the Korean financial system, we construct its entire network and apply stress scenarios to the system to compare the performances of intervention strategies and derive insights on their workings.     

A variational problem determined by probability measures

ABSTRACT

An optimization problem of maximizing an integral of a function over a family of probability measures is considered. The problem is a generalization of a well-studied variational problem in mathematical economics, concerning optimal allocations. The specific generalization that we examine arises also in the limit of singularly perturbed optimal control problems. We examine the mathematical problem and allude to the singular perturbation motivation.     

Comparison of Multivariate Matching Methods: Structures,Distances, and Algorithms

Abstract

A comparison and evaluation is made of recent proposals for multivariate matched sampling in observational studies, where the following three questions are answered: (1) Algorithms: In current statistical practice, matched samples are formed using “nearest available” matching, a greedy algorithm. Greedy matching does not minimize the total distance within matched pairs, though good algorithms exist for optimal matching that do minimize the total distance. How much better is optimal matching than greedy matching? We find that optimal matching is sometimes noticeably better than greedy matching in the sense of producing closely matched pairs, sometimes only marginally better, but it is no better than greedy matching in the sense of producing balanced matched samples. (2) Structures: In common practice, treated units are matched to one control, called pair matching or 1–1 matching, or treated units are matched to two controls, called 1–2 matching, and so on. It is known, however, that the optimal structure is a full matching in which a treated unit may have one or more controls or a control may have one or more treated units. Optimal 1 — k matching is compared to optimal full matching, finding that optimal full matching is often much better. (3) Distances: Matching involves defining a distance between covariate vectors, and several such distances exist. Three recent proposals are compared. Practical advice is summarized in a final section.     

生态平衡制约下离散尺度结构种群的最优收获

研究基于扩展Leslie投影矩阵的离散尺度结构种群模型的最优收获问题,约束条件包括生态平衡和开发成本等.运用凸优化理论证明了最优收获策略的存在性,导出了最优收获模式,应用模型参数给出了收获比率.结论显示:最优策略具有两阶段结构.     

Simple and Efficient Purification Protocol of 9-(Trifluoroacetyl)anthracene from Anthracene

A protocol has been developed to purify 9-(trifluoroacetyl)anthracene from anthracene, the major impurity associated in its synthesis. The protocol utilizes a chemoselective thermal Diels–Alder reaction, employing maleic anhydride as the dienophile. The resulting Diels–Alder adduct can then be removed by extractive workup followed by recrystallization to give 9-(trifluoroacetyl)anthracene with ≥99% chemical purity.