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...

A ranking method assigns to every weighted directed graph a (weak) orderingof the nodes. In this paper we axiomatize the ranking method that ranksthe nodes according to their outflow using four independent axioms. This outflowranking method generalizes the ranking by outdegree for directed...

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...

This discussion paper resulted in a publication in the <I>Siam Journal on Matrix Analysis and Applications (2011). Volume 32, issue 3, pages 665-684.<P> A sequence of real numbers (<I>x_n</I>) is Benford if the significands, i.e. the fractionparts in the floating-point representation of (<I>x_n</I>), are distributed...</i></i></p></i>

A sequence of real numbers (<I>x_n</I>) is Benford if the significands, i.e. the fraction

In this paper, we consider deterministic (both fluid and discrete) polling systems with <I>N</I> 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...</i>

A ranking method assigns to every weighted directed graph a (weak) ordering

This discussion paper led to a publication in 'Macroeconomic Dynamics' (2013). Vol. 17(8), pp. 1574-1604.<P> The recent macroeconomic literature stresses the importance of managing heterogeneous expectations in the formulation of monetary policy. We use a stylized macro model of Howitt (1992) to...</p>