An M/G/1 Retrial Queueing System with Two-Phase Service and Preemptive Resume

An M/G/1 retrial queueing system with additional phase of service and possible preemptive resume service discipline is considered. For an arbitrarily distributed retrial time distribution, the necessary and sufficient condition for the system stability is obtained, assuming that only the customer at the head of the orbit has priority access to the server. The steady-state distributions of the server state and the number of customers in the orbit are obtained along with other performance measures. The effects of various parameters on the system performance are analysed numerically. A general decomposition law for this retrial queueing system is established.     

Carathéodory's method for a class of dynamic games

The method of equivalent variational methods, originally due to Carathéodory for free problems in the calculus of variations is extended to investigate feedback Nash equilibria for a class of n-person differential games. Both the finite-horizon and infinite-horizon cases are considered. Examples are given to illustrate the presented results.     

A stochastic algorithm using one sample point per iteration and diminishing stepsizes

A stochastic algorithm for finding stationary points of real-valued functions defined on a Euclidean space is analyzed. It is based on the Robbins-Monro stochastic approximation procedure. Gradient evaluations are done by means of Monte Carlo simulations. At each iteratex _i , one sample point is drawn from an underlying probability space, based on which the gradient is approximated. The descent direction is against the approximation of the gradient, and the stepsize is 1/i. It is shown that, under broad conditions, w.p.1 if the sequence of iteratesx ₁,x ₂,...generated by the algorithm is bounded, then all of its accumulation points are stationary.     

Estimation of integrated volatility in stochastic volatility models

In the framework of stochastic volatility models we examine estimators for the integrated volatility based on the pth power variation (i.e. the sum of pth absolute powers of the log‐returns). We derive consistency and distributional results for the estimators given high‐frequency data, especially taking into account what kind of process we may add to our model without affecting the estimate of the integrated volatility. This may on the one hand be interpreted as a possible flexibility in modelling, for example adding jumps or even leaving the framework of semimartingales by adding a fractional Brownian motion, or on the other hand as robustness against model misspecification. We will discuss possible choices of p under different model assumptions and irregularly spaced data. Copyright © 2005 John Wiley & Sons, Ltd.     

Index Heuristics for Multiclass M/G/1 Systems with Nonpreemptive Service and Convex Holding Costs

We consider the optimal service control of a multiclass M/G/1 queueing system in which customers are served nonpreemptively and the system cost rate is additive across classes and increasing convex in the numbers present in each class. Following Whittle's approach to a class of restless bandit problems, we develop a Langrangian relaxation of the service control problem which serves to motivate the development of a class of index heuristics. The index for a particular customer class is characterised as a fair charge for service of that class. The paper develops these indices and reports an extensive numerical investigation which exhibits strong performance of the index heuristics for both discounted and average costs.     

合作联盟资源集成计划一种新方法

合作联盟里，资源集成计划往往是联盟成员群体谈判博弈的结果。本以两人博弈为例，对联盟的资源集成计划给出一个谈判博弈模型，能够较好地模仿和反映合作联盟资源整合计划的制订过程。     

On Non-Continuous Dirichlet Processes

We introduce here some Itô calculus for non-continuous Dirichlet processes. Such calculus extends what was known for continuous Dirichlet processes or for semimartingales. In particular we prove that non-continuous Dirichlet processes are stable under C ¹ transformation.     

NCD系统的数学理论

无索赔折扣系统(No Claim Discount system,简记为NCD系统)是世界各国机动车辆险中广泛采用的一种经验费率厘定机制.本文尝试建立了NCD系统严谨的数学理论, 重点讨论了NCD系统的数学建模和稳态分析.此外,作为本文必要的数学前提,首先在第2节着重探讨了随机矩阵间的随机优序关系,并将所得结论运用至齐次不可约且遍历的马尔科夫链的研究中,这些内容也有其独立的数学上的兴趣.     

The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study

The sample average approximation (SAA) method is an approach for solving stochastic optimization problems by using Monte Carlo simulation. In this technique the expected objective function of the stochastic problem is approximated by a sample average estimate derived from a random sample. The resulting sample average approximating problem is then solved by deterministic optimization techniques. The process is repeated with different samples to obtain candidate solutions along with statistical estimates of their optimality gaps.We present a detailed computational study of the application of the SAA method to solve three classes of stochastic routing problems. These stochastic problems involve an extremely large number of scenarios and first-stage integer variables. For each of the three problem classes, we use decomposition and branch-and-cut to solve the approximating problem within the SAA scheme. Our computational results indicate that the proposed method is successful in solving problems with up to 2¹⁶⁹⁴ scenarios to within an estimated 1.0% of optimality. Furthermore, a surprising observation is that the number of optimality cuts required to solve the approximating problem to optimality does not significantly increase with the size of the sample. Therefore, the observed computation times needed to find optimal solutions to the approximating problems grow only linearly with the sample size. As a result, we are able to find provably near-optimal solutions to these difficult stochastic programs using only a moderate amount of computation time.     

A virtual boundary method with improved computational efficiency using a multi‐grid method

The flow around spherical, solid objects is considered. The boundary conditions on the solid boundaries have been applied by replacing the boundary with a surface force distribution on the surface, such that the required boundary conditions are satisfied. The velocity on the boundary is determined by extrapolation from the flow field. The source terms are determined iteratively, as part of the solution. They are then averaged and are smoothed out to nearby computational grid points. A multi‐grid scheme has been used to enhance the computational efficiency of the solution of the force equations. The method has been evaluated for flow around both moving and stationary spherical objects at very low and intermediate Reynolds numbers. The results shows a second order accuracy of the method both at creeping flow and at Re=100. The multi‐grid scheme is shown to enhance the convergence rate up to a factor 10 as compared to single grid approach. Copyright © 2004 John Wiley & Sons, Ltd.