We develop a methodology for studying large deviations type questions. Our approach does not require that the large deviations principle holds, and is thus applicable to a larg class of systems. We study a system of queues with exponential servers, which share an arrival stream. Arrivals are...

This discussion paper resulted in a publication in the <I>Mathematical Methods of Operations Research</I> (2005). Volume 62, issue 3, pages 467-483.<P> We develop a methodology for studying "large deviations type" questions. Our approach does not require that the large deviations principle holds, and is...</p></i>

We develop a methodology for studying "large deviations type" questions. Our approach does not require that the large deviations principle holds, and is thus applicable to a larg class of systems. We study a system of queues with exponential servers, which share an arrival stream. Arrivals are...

We develop a methodology for studying ''large deviations type'' questions. Our approach does not require that the large deviations principle holds, and is thus applicable to a larg class of systems. We study a system of queues with exponential servers, which share an arrival stream. Arrivals are...

We develop a methodology for studying ''large deviations type'' questions. Our approach does not require that the large deviations principle holds, and is thus applicable to a larg class of systems. We study a system of queues with exponential servers, which share an arrival stream. Arrivals are...

In this paper, we perform an in - depth investigation of relative merits of two adaptive learning algorithms with constant gain, Recursive Least Squares (RLS) and Stochastic Gradient (SG), using the Phelps model of monetary policy as a testing ground. The behavior of the two learning algorithms...

This paper provides a new technique for representing discrete time nonlinear dynamic stochastic time invariant maps. Using this new series representation, the paper augments the usual solution strategy with an additional set of constraints thereby enhancing algorithm reliability. The paper also...

For an increasing upper order hemi-continuous correspondence F selfmapping sigma-complete lattice A, we first provide tight fixed-point bounds for sufficiently large iterations on F starting from any initial point a in A. We use this result for conducting iterative fixed-point comparative...

In this paper, we consider deterministic (both fluid and discrete) polling systems with N queues with infinite buffers and we show how to compute the best polling sequence (minimizing the average total workload). With two queues, the best polling sequence is always periodic when the system is...

We provide an analytical approach that facilitates understanding the bifurcation mechanism of a wide class of economic models involving spatial agglomeration of economic activities. The proposed method overcomes the limitations of the Turing (1952) approach that has been used to analyze the...