Perfect information two-person zero-sum markov games with imprecise transition probabilities

Based on an extension of the controlled Markov set-chain model by Kurano et al. (in J Appl Prob 35:293–302, 1998) into competitive two-player game setting, we provide a model of perfect information two-person zero-sum Markov games with imprecise transition probabilities. We define an equilibrium value for the games formulated with the model in terms of a partial order and then establish the existence of an equilibrium policy pair that achieves the equilibrium value. We further analyze finite-approximation error bounds obtained from a value iteration-type algorithm and discuss some applications of the model.     

股票市场监管策略的一个随机模型

研究了股市在一段有可能给社会造成危害的上涨行情中，管理者监管股市的问题＋根据股市的运行规律，建立了一个随机最优化模型，讨论了参数对解的影响，并得出了一些对股市监管有意义的结论．     

Converging Marriage in Honey-Bees Optimization and Application to Stochastic Dynamic Programming

In this paper, we first refine a recently proposed metaheuristic called “Marriage in Honey-Bees Optimization” (MBO) for solving combinatorial optimization problems with some modifications to formally show that MBO converges to the global optimum value. We then adapt MBO into an algorithm called “Honey-Bees Policy Iteration” (HBPI) for solving infinite horizon-discounted cost stochastic dynamic programming problems and show that HBPI also converges to the optimal value.     

Discrete-time GI/Geo/1 queue with multiple working vacations

Consider the discrete time GI/Geo/1 queue with working vacations under EAS and LAS schemes. The server takes the original work at the lower rate rather than completely stopping during the vacation period. Using the matrix-geometric solution method, we obtain the steady-state distribution of the number of customers in the system and present the stochastic decomposition property of the queue length. Furthermore, we find and verify the closed property of conditional probability for negative binomial distributions. Using such property, we obtain the specific expression for the steady-state distribution of the waiting time and explain its two conditional stochastic decomposition structures. Finally, two special models are presented.      

SPAR: stochastic programming with adversarial recourse

We consider a general adversarial stochastic optimization model. Our model involves the design of a system that an adversary may subsequently attempt to destroy or degrade. We introduce SPAR, which utilizes mixed-integer programming for the design decision and a Markov decision process (MDP) for the modeling of our adversarial phase.     

葛仙米对丁草胺胁迫的响应

研究了丁草胺对可食用蓝藻葛仙米(Nostoc sphaeroides)生理和代谢活性的影响．用不同浓度的丁草胺处理葛仙米,结果显示低浓度(5 mg·L-1)丁草胺使其光合作用、呼吸作用和光合系统Ⅱ活性增强,高浓度丁草胺(>5 mg·L-1)限制其光合作用、呼吸作用和光合系统Ⅱ活性．同时丁草胺对葛仙米膜结构和功能具有破坏作用,随着丁草胺处理浓度增大,质膜透性不断增大,丙二醛和超氧自由基阴离子含量升高；在低浓度丁草胺处理时,类胡萝卜素含量增加,超氧化物歧化酶(SOD)活性增强,高浓度丁草胺处理时,类胡萝卜素含量降低,SOD活性下降；表明葛仙米对低浓度的丁草胺胁迫具有一定的耐受能力,但高浓度的丁草胺对其生理和代谢构成威胁；针对目前葛仙米野生生境中丁草胺的用量,建议限制丁草胺在葛仙米产地的使用,以保护日益稀缺的葛仙米资源．     

On error operators related to the arbitrary functions principle

The error on a real quantity Y due to the graduation of the measuring instrument may be asymptotically represented, when the graduation is regular and fines down, by a Dirichlet form on R whose square field operator does not depend on the probability law of Y as soon as this law possesses a continuous density. This feature is related to the “arbitrary functions principle” (Poincaré, Hopf). We give extensions of this property to Rd and to the Wiener space for some approximations of the Brownian motion. This gives new approximations of the Ornstein-Uhlenbeck gradient. These results apply to the discretization of some stochastic differential equations encountered in mechanics.     

价格波动对进出初级产品行业的影响

初级产品生产行业有两大特点：一是其初级投资有较大的不可逆转性，二是其产品价格具有较大的随机性（不确定性）。这两点的同时存在，给进入和退出初级产品行业造成壁垒。     

Sample-path optimization of convex stochastic performance functions

In this paper we propose a method for optimizing convex performance functions in stochastic systems. These functions can include expected performance in static systems and steady-state performance in discrete-event dynamic systems; they may be nonsmooth. The method is closely related to retrospective simulation optimization; it appears to overcome some limitations of stochastic approximation, which is often applied to such problems. We explain the method and give computational results for two classes of problems: tandem production lines with up to 50 machines, and stochastic PERT (Program Evaluation and Review Technique) problems with up to 70 nodes and 110 arcs. Sponsored by the National Science Foundation under grant number CCR-9109345, by the Air Force Systems Command, USAF, under grant numbers F49620-93-1-0068 and F49620-95-1-0222, by the U.S. Army Research Office under grant number DAAL03-92-G-0408, and by the U.S. Army Space and Strategic Defense Command under contract number DASG60-91-C-0144. The U.S. Government has certain rights in this material, and is authorized to reproduce and distribute reprints for Governmental purposes notwithstanding any copyright notation thereon. Sponsored by a Wisconsin/Hilldale Research Award, by the U.S. Army Space and Strategic Defense Command under contract number DASG60-91-C-0144, and the Air Force Systems Command, USAF, under grant number F49620-93-1-0068. Sponsored by the National Science Foundation under grant number DDM-9201813.