Supplement to Call Centers with Delay Information: Models and Insights

Save this PDF as:

Size: px
Start display at page:

Transcription

1 Supplement to Call Centers with Delay Information: Models and Insights Oualid Jouini 1 Zeynep Akşin 2 Yves Dallery 1 1 Laboratoire Genie Industriel, Ecole Centrale Paris, Grande Voie des Vignes, Châtenay-Malabry, France 2 College of Administrative Sciences and Economics, Koç University, Rumeli Feneri Yolu, Sariyer-Istanbul, Turkey Manufacturing & Service Operations Management, 13: , 2011 This is a supplement to the main paper Jouini et al. (2011), with the same title. 1. Performance Sensitivity in β This section supports the paragraph Effect of θ on the optimal announcement coverage β in Section 5 of the main paper Jouini et al. (2011). We would like to see how the call center performance measures under the optimal announcement coverage β are different from those under other β values. In other words, does it matter that a manager chooses a β that would be different from the optimal one, and to what extent? We consider Model 2 under the update case (θ = 0) with the same parameters as those in Table 1 of the main paper: µ = 1, γ = 0.5, α 0 = 5%, (s, λ) = (3,3), (5,5), (20,20), and (100,100). We compute the performance measures of Model 2 for different β, β =10%, 20%,..., 90%. Note from Table 1 of the main paper that for all call center sizes, β =90% is approximately optimal. The results are given in Table 1, and in Figures 1(a)-1(d). From Table 1, we see that there are considerable changes in the performance measures when we announce delays other than those under the optimal announcement coverage. These changes are particularly apparent when the pooling effect is absent. The pooling effect improves the performance measures thereby reducing the sensitivity to the choice of β. For s = 3, P B is divided by around 10 when moving from β = 10% to β = 90%. However for s = 100, it is only divided by around 2. In summary, for all call center sizes, all performance measures except P S vary considerably in β. When the probability of reneging does matter for a call center manager, choosing the correct β is important, especially 1

2 for small call centers in which customers update their patience to the announcements, as considered here. Table 1 reveals that the probability of service P S does not vary that much in β. As we can see from Figures 1(a)-1(d), the speed by which P B is decreasing is close to that with which P R is increasing. Then P S = 1 P B P R would not vary too much. This would make the choice of optimal β less critical when considering a throughput objective. Another observation is that the relative changes of E(X S) and σ(x S) are considerable. This may make a manager (considering a throughput objective) choose a small β that would, on the one hand, lead to a somewhat smaller value of P S, but on the other hand, would considerably improve E(X S) and σ(x S). 0.3 PB PR 0.3 PB PR β β % 10% 20% 30% 40% 50% 60% 70% 80% 90% 0% 10% 20% 30% 40% 50% 60% 70% 80% 90% (a) s = λ = 3 (b) s = λ = PB PR PB PR β β % 10% 20% 30% 40% 50% 60% 70% 80% 90% 0% 10% 20% 30% 40% 50% 60% 70% 80% 90% (c) s = λ = 20 (d) s = λ = 100 Figure 1: Impact of β on the probabilities of balking and reneging 2. Additional Experiments for a Strict Service Level In Table 2 we give the results for a stricter reneging constraint, δ = 1%. This supplements the paragraph Effect of system size and service level constraint on β in Section 5 of the main paper Jouini et al. (2011). 2

3 Table 1: Model 2 performance measures for different β s = λ = 3 s = λ = 5 β P B P R P S E(X S) σ(x S) P B P R P S E(X S) σ(x S) 10% 2.45% 30.96% 66.59% % 25.83% 72.34% % 3.33% 28.78% 67.88% % 24.41% 73.26% % 4.43% 26.28% 69.29% % 22.74% 74.30% % 5.99% 23.25% 70.76% % 20.66% 75.44% % 8.15% 19.66% 72.20% % 18.10% 76.67% % 10.97% 15.56% 73.47% % 14.96% 77.91% % 14.44% 11.16% 74.40% % 11.29% 79.02% % 18.38% 6.81% 74.81% % 7.28% 79.81% % 22.73% 2.89% 74.38% % 3.30% 79.97% s = λ = 20 s = λ = 100 β P B P R P S E(X S) σ(x S) P B P R P S E(X S) σ(x S) 10% 0.91% 14.72% 84.37% % 7.09% 92.49% % 1.04% 14.28% 84.68% % 6.97% 92.56% % 1.22% 13.73% 85.05% % 6.82% 92.65% % 1.47% 13.04% 85.49% % 6.62% 92.76% % 1.83% 12.13% 86.04% % 6.36% 92.91% % 2.39% 10.90% 86.71% % 5.99% 93.11% % 3.28% 9.19% 87.52% % 5.45% 93.39% % 4.73% 6.82% 88.45% % 4.56% 93.81% % 7.02% 3.65% 89.33% % 2.96% 94.45% Table 2: Results for Model 1, and for Model 2 with δ = 1% Model 2, θ = 0 Model 2, θ = 1/3 s = λ β 96% 97% 97% 98% 98% 98% 90% 89% 84% 75% 50% 20% γ P B 25.86% 20.08% 13.68% 9.74% 5.99% 4.20% 24.08% 18.27% 12.29% 8.32% 5.01% 3.46% P R 0.94% 0.82% 0.98% 0.70% 0.73% 0.72% 0.98% 0.91% 0.94% 0.93% 0.96% 0.98% P S 73.20% 79.09% 85.34% 89.56% 93.28% 95.08% 74.94% 80.82% 86.78% 90.75% 94.03% 95.56% E(X S) σ(x S) Model 2, θ = 2/3 Model 2, θ = 1 s = λ β 85% 81% 72% 55% 16% 3% 81% 75% 62% 41% 9% 1% γ P B 23.13% 17.27% 11.62% 7.81% 4.67% 3.28% 22.55% 16.75% 11.21% 7.55% 4.55% 3.27% P R 0.98% 0.99% 0.97% 0.99% 0.98% 0.97% 0.94% 0.97% 0.97% 0.97% 0.99% 0.78% P S 75.89% 81.73% 87.41% 91.19% 94.35% 95.75% 76.51% 82.29% 87.83% 91.48% 94.46% 95.95% E(X S) σ(x S) Model 2, θ = 5/3 Model 1 s = λ β 72% 63% 45% 24% 2% 1% γ P B 21.37% 15.84% 10.58% 7.22% 4.31% 3.50% 5.93% 5.68% 5.33% 4.94% 4.35% 3.82% P R 0.98% 0.99% 0.98% 0.93% 0.96% 0.48% 14.82% 10.97% 7.07% 4.38% 2.14% 1.15% P S 77.64% 83.17% 88.44% 91.86% 94.73% 96.01% 79.25% 83.36% 87.60% 90.68% 93.51% 95.02% E(X S) σ(x S)

4 3. Additional Experiments for the Announced Delays In this section we also give additional experiments to those of the paragraph Effect of system size and service level constraint on β in Section 5 of the main paper Jouini et al. (2011). In Figure 2, we give the announced delays as a function of the system size, for θ = 5/3. We omit the graphs for θ = 1/3, 2/3 and 1 because they are very similar. The main conclusion here is that the announced delays decrease in θ. The reason is simply that β decreases. 3.0 n=0 n = n=3 n = 3 n=5 n = 5 n=10 n = s = λ Figure 2: Announced delays in Model 2 with θ = 5/3 4. Details for the Analysis of the load Effect on β This section gives the details of Figure 7 of the paragraph Effect of increased system load on β in Section 5 of the main paper Jouini et al. (2011). In Figure 7 of the main paper, we draw the optimal announcement coverage β as a function of the arrival rate λ, while keeping the number of servers s unchanged. This allows us to study the behavior of the system under the efficiency driven regime. The details are given in Table 3. Recall that the parameters are s = 10, µ = 1, α 0 = 5%, γ = 0.5, and δ = 3%. 5. Analysis of Model 2-AVG This section is related to the paragraph Comparison of Model 1, Model 2, and Model 2 with mean delay announcement in Section 5 of the main paper Jouini et al. (2011). In what follows, we give the analysis of Model 2-AVG. Model 2-AVG is a version of Model 2 4

5 Table 3: Details of Figure 7 of the main paper θ = 0 θ = 1/3 λ β 85% 92% 95% 95% 92% 87% 26% 57% 74% 66% 54% 47% γ P B 4.29% 11.60% 32.23% 47.60% 63.77% 77.01% 2.78% 9.69% 31.34% 47.13% 64.41% 77.28% P R 2.93% 2.84% 2.76% 2.54% 2.90% 2.99% 2.96% 2.92% 2.92% 2.90% 2.26% 2.71% P S 92.78% 85.56% 65.02% 49.86% 33.33% 20.00% 94.26% 87.39% 65.74% 49.97% 33.33% 20.00% E(X S) σ(x S) θ = 2/3 θ = 1 λ β 6% 34% 59% 53% 42% 30% 1% 20% 44% 35% 31% 15% γ P B 2.22% 8.86% 31.27% 47.55% 63.90% 77.08% 1.87% 8.29% 30.89% 47.31% 64.21% 77.06% P R 2.92% 2.96% 2.76% 2.47% 2.77% 2.86% 2.83% 2.99% 2.99% 2.70% 2.45% 2.94% P S 94.86% 88.18% 65.96% 49.98% 33.33% 20.00% 95.30% 88.72% 66.12% 49.99% 33.33% 20.00% E(X S) σ(x S) θ = 5/3 λ β 1% 8% 27% 19% 10% 2% γ P B 2.09% 7.64% 31.01% 47.03% 64.36% 25.47% P R 1.95% 2.92% 2.70% 2.98% 2.31% 2.93% P S 95.95% 89.43% 66.29% 50.00% 33.33% 20.00% E(X S) σ(x S) where instead of announcing the delay ensuring β coverage, the mean delay is announced. As in Model 2, we let customers in Model 2-AVG renege even though they have elected to join the queue. This is argued by the fact that we announce the expected delay, so the actual delay may be larger than the announced one. In what follows, we particularly describe the difference in terms of the functioning and the performance evaluation. We use the same notations as in the main paper. Upon arrival, a customer is addressed by one of the available agents, if any. If not, i.e., all agents are busy and n customers are waiting in queue (n 0), then we announce to her the expected value of the random variable D n, denoted by E(D n ). This substitutes the announced delay d n = G 1 n (β) in Model 2. We have n E(D n ) = Also, it is easy to see that the balking probability p B (n) is given by i=0 1 sµ + iγ. (1) p B (n) = P (T < E(D n )) = 1 e γe(d n). (2) Using Equations (1) and (2), it suffices now to substitute d n by E(D n ) in the analysis of Model 2 in Sections 4.2 and 4.3 in the main paper Jouini et al. (2011) in order to get that of Model AVG. For the fixed point method we use to get the new reneging rate γ of Model AVG, we do as follows. We use the same method as the one of Model 2, except that here we don t have a single β, but β AV G,n which depends on the number of customers found in the queue. Note that this is not a parameter that we control. It is given by β AV G,n = P (D n < E(D n )) = G n (E(D n )). (3) 5

6 We know that the cdf G n (.) of D n is ( n n G n (t) = 1 i=0 j=0, j i ) sµ + jγ e (sµ+iγ )t, (4) (j i)γ for t 0, which easily gives β AV G,n. Following similar arguments as those in the main paper Jouini et al. (2011), we obtain r U n = P (E(D n ) < D n T E(D n )) = 1 β AV G,n, (5) for θ = 0 (the update case), and for the general modeling with θ > 0, we have ( n n ) sµ + jγ sµ + iγ r n (θ) = 1 β AV G,n (j i)γ sµ + γ )E(D n ) + e (sµ+iγ. (6) θ iγ Recall that r N n i=0 j=0, j i (the no-update case) is given using Equation (6) and setting θ = 1. Finally, it remains to apply the fixed point algorithm as given in Section 4.2 in the main paper Jouini et al. (2011). In Table 4, which is related to the paragraph Comparison of Model 1, Model 2, and Model 2 with mean delay announcement in Section 5 of the main paper, Jouini et al. (2011). we give the announced delays in Model 2 and Model 2-AVG. Table 4: Announced delays in Model 2 and Model 2-AVG θ = 0 θ = 1/3 θ = 5/3 n s Model 2 Model 2-AVG Model 2 Model 2-AVG Model 2 Model 2-AVG Validation of the Exponential Approximation In this section, we investigate the quality of the approximation we consider for new patience times in Model 2. To get a tractable analysis, we assumed in Section 4.2 in the main paper 6

7 Jouini et al. (2011). that new patience times are exponentially distributed with rate γ and we developed a numerical method to compute this parameter. To assess the exponential assumption, we compare in what follows the performance measures of Model 2 derived by the numerical method (exponential approximation) with those given by simulation. We conduct this study for the different cases of customer reactions, i.e., different values of θ. Consider the simulation of Model 2 under a given customer reaction (with parameter θ), which we will call the ideal simulation. A customer who joins the queue will renege as soon as her waiting time in queue reaches θt k + (1 θ)d n, where t k is her initial random threshold of patience and d n is the delay information. We underline a complexity associated with the computation of d n in simulation. It is very hard to derive in simulation the exact distribution of D n, based on which we determine the value d n with coverage probability β. This requires indeed the computation of the convolution of the distributions of the remaining patience times of the customers waiting ahead in queue. To simplify the analysis, we simulate an intermediate Model 2 in which we assume that D n is exponentially distributed with rate γ. In order to determine the value of γ, one would think to apply a fixed point algorithm using simulation at each step. This is again very heavy to do. Instead we use the value of γ derived from the numerical computation using the fixed-point algorithm as shown in Section 4.2 in the main paper Jouini et al. (2011). We label the latter as the approximate simulation model. In summary, we will simulate Model 2 such that we announce the same delay d n as in the exponential approximation model. Customers who join the queue will then renege exactly as soon as their waiting time in queue reaches θt k + (1 θ)d n (if they do not start service before that epoch). The resulting Model 2 that we simulate is intermediate between the ideal simulation and the exponential approximate model. We believe that the comparison between the approximate simulation model and the approximate exponential one (developed in Section 4 of the main paper) will give good indications about the quality of the exponential approximation made in the latter. We run simulations for several sets of the system parameters, with different system sizes, different coverage probabilities, and different types of customer reaction to delay announcement. For all cases, we choose µ = 1, γ = 0.5, and α 0 = 5%. The results are given in Table 5. For each set of parameters, we compare between the performance measures derived by simulation and those derived using the numerical approximation method. In what follows, we give some information about the accuracy of the simulation. For a given set of parameters, we consider a single replication that we run for a sufficiently long time. The lengths of the confidence intervals for the different performance measures derived by simulation are in the order of

8 Distribution of times before reneging in the simulation models: For each one of the various sets of parameters considered here, we have recorded the actual times before reneging. We then investigated whether their observed distribution fits with an exponential distribution. This is an approximate analysis, as reneging times will not be i.i.d. If the system is busy with many waiting customers, the generated times before reneging would tend to be large. And if the system has a few waiting customers in queue, the generated times before reneging would tend to be small. In our models with delay announcement as well, we make such an approximation that times before reneging are i.i.d., even though in reality they are not. We do not report the details of the results here, however we summarize them below. The best fitting function was typically a Pearson6 distribution followed sometimes by Gamma, Lognormal, or Inverse Gaussian, suggesting that there is no clear alternative to the exponential distribution we have assumed. We see that an exponential distribution fits best when we have θ values 1, followed by 5/3, especially for the larger examples (50 servers). Even though the fit deteriorates slightly as we decrease θ, even a very small θ value (1/3) suggests a relatively good fit by an exponential. The Q-Q plots are mostly linear, which lends support to the idea that for most quantiles the exponential distribution provides a good approximation. As θ decreases, the Q-Q plots become slightly steeper than x = y, implying that the exponential is a bit more dispersed than the data. Indeed, as θ decreases, customers are updating more, implying more clustering around the announced delays. For the particular case with update-type behavior (θ= 0), the reneging times will take the values of the announcements we are making as a function of the queue state. Thus we will observe clusters of reneging times around these delay announcements for n=1, 2, etc. As a result, the reneging time distribution we obtain will be discrete. Our model will approximate this discrete distribution by a continuous distribution. As such, the fit of the exponential distribution is clearly worse in this case compared to the above analyzed cases with θ > 0. Conclusions: In summary, the exponential approximation for the distribution fit of times before reneging seems quite good for some settings, and a rough approximation for others. When comparing the performance measures given by simulation and those given by the exponential approximation (see Table 5 below), it would seem that for the rougher cases, the distortion that is introduced is quite small. One can then conclude that the performance measures are not sensitive to the reneging time distribution. This is coherent with work by Avi Mandelbaum showing that the Erlang A is a robust model even though reneging 8

9 times are not necessarily exponential in practice. This can be explained using the results derived in Zeltyn and Mandelbaum (2005). Under the Quality-Efficiency-Driven regime where delays are short, it is pointed out that the patience distribution near the origin determines the behavior of the system. Similar results are found for patience distributions with a positive density at the origin (Theorem 4.1 in Zeltyn and Mandelbaum (2005)), as well as for patience distributions with an atom at the origin (Theorems 4.2 and 4.3 in Zeltyn and Mandelbaum (2005)). In Theorem 4.3 of Zeltyn and Mandelbaum (2005), the authors consider a scaled balking increasing in the queue state, which is somewhat similar to what we consider in this paper, p B (n). They conclude that approximate performance measures depend only on the patience distribution near the origin. For small systems as those in our experiments, waiting times are also relatively short thus giving the main importance to the behavior of the patience distribution at the origin rather than in the tail. Since in addition to that the balking behavior is the same for the simulated and exponential approximated models, the exponential approximation has a good quality. Recall that for both the no-update and the update cases the simulated model takes the random variable D n to be the same as that in the approximation (based on the same value of γ ). So, p B (n) is the same in the simulated and approximated models. Then, the patience distributions in both models have the same atom at the origin. 7. The case of Heterogeneous Customer reactions In the main paper Jouini et al. (2011), customers are assumed to react in the same way to delay information. We capture this by a single value for θ. In this section, we extend the analysis to the case of heterogeneous customer reactions. We capture this by substituting the real parameter θ by a random variable, denoted by Θ. A new arrival would react based on an outcome of Θ, denoted by θ. The objective of this section is to study the impact of having different customer reactions. More specifically, we want to answer the question: Is there any difference between having deterministic and random Θ? For simplicity and ease of interpretation, we consider examples of Θ with discrete distributions. We assume that Θ has a finite number k (k 0) of outcomes denoted by θ 1, k..., θ k (belonging to R + ) which occur with probabilities q 1,..., q k (with q i = 1), respectively. The analysis of the heterogenous case is similar to the homogeneous one developed in the main paper Jouini et al. (2011). The only difference is in the way of computing the i=1 9

10 Table 5: Simulation vs exponential approximation θ = 0, s = λ = 5 θ = 0, s = λ = 50 β 50% 80% 50% 80% γ App Sim App Sim App Sim App Sim P S P R P B E(X S) σ(x S) θ = 1/3, s = λ = 5 θ = 1/3, s = λ = 50 β 50% 80% 50% 80% γ App Sim App Sim App Sim App Sim P S P R P B E(X S) σ(x S) θ = 2/3, s = λ = 5 θ = 2/3, s = λ = 50 β 50% 80% 50% 80% γ App Sim App Sim App Sim App Sim P S P R P B E(X S) σ(x S) θ = 1, s = λ = 5 θ = 1, s = λ = 50 β 50% 80% 50% 80% γ App Sim App Sim App Sim App Sim P S P R P B E(X S) σ(x S) θ = 5/3, s = λ = 5 θ = 5/3, s = λ = 50 β 50% 80% 50% 80% γ App Sim App Sim App Sim App Sim P S P R P B E(X S) σ(x S)

11 conditional probability for a new arrival to renege, given the system state she finds upon k arrival. It is given by r n (Θ) = q i r n (θ i ), where r n (θ i ) is 1 β for θ i = 0, and is given i=1 by Equation (26) in the main paper Jouini et al. (2011) for θ i > 0. In what follows, we study the impact of having different customer reactions by considering various scenarios for the random variable Θ. All scenarios have the same expected value of Θ. We choose E[Θ]=2/3. The four scenarios are described in Table 6. Note that Scenario 1 is a particular case of a deterministic Θ. It corresponds to the case θ = 2/3, given in Table 1 in the main paper Jouini et al. (2011). Table 6: Description of the scenarios of Θ, E[Θ]=2/3 Scenarios Θ: (θ i, q i ) Coefficient of variation 1 (2/3, 1) 0 2 (1/2, 1/2); (5/6, 1/2) (1/3, 1/3); (2/3, 1/3); (1, 1/3) (0, 1/4); (1/3, 1/4); (1, 1/4); (4/3, 1/4) We consider now the same optimization problem as formulated in (29) of the main paper. We choose the same values of the other parameters as those in Table 1 in the main paper Jouini et al. (2011). The results are given in Table 7. Table 7: Results for Model 2 with heterogeneous customer reactions Scenario 1 Scenario 2 λ β 64% 54% 34% 13% 2% 1% 65% 56% 36% 14% 3% 1% γ P B 19.13% 13.89% 8.86% 5.62% 3.09% 2.86% 19.23% 14.04% 8.93% 5.63% 3.31% 2.25% P R 2.98% 2.97% 2.96% 2.93% 2.90% 1.40% 2.99% 2.93% 2.96% 2.96% 2.63% 2.57% P S 77.89% 83.14% 88.18% 91.45% 94.01% 95.74% 77.79% 83.03% 88.11% 91.41% 94.06% 95.18% E(X S) σ(x S) Scenario 3 Scenario 4 λ β 67% 59% 40% 18% 4% 1% 78% 77% 75% 73% 69% 63% γ P B 19.44% 14.24% 9.07% 5.77% 3.34% 3.03% 20.73% 15.53% 10.38% 6.91% 3.90% 2.44% P R 2.97% 2.91% 2.96% 2.93% 2.69% 1.13% 2.95% 2.95% 2.98% 2.95% 2.98% 2.96% P S 77.59% 82.85% 87.97% 91.30% 93.98% 95.84% 76.32% 81.52% 86.64% 90.14% 93.12% 94.60% E(X S) σ(x S) Consider the results in Table 7 here, and in Table 1 in the main paper Jouini et al. (2011). As one would expect, we observe that β for a random customer reaction (Θ) has a value in between the β s of two systems with deterministic customer reactions. The two systems correspond to the extreme cases with the lowest and highest outcomes of Θ. Also, the conclusions drawn in the main paper are still valid here. For example, it is important to increase the reliability of announcements for cases where some customers are likely to strongly update their patience. Also, pooling improves performance and as 11

12 a consequence makes the reliability of announcements less important. A new interesting observation from Table 7 is that although β varies as a function of random customer reaction, the performance of the optimized systems are quite insensitive to the variability in customer reactions. Thus, only E(Θ) seems to matter. 8. Numerical Computation In this section we describe the numerical methods used for the computation of the quantities involved in Section 5 of the main paper Jouini et al. (2011). State space truncation: For both Models 1 and 2, the expressions of the stationary probabilities, as well as those of the various performances measures, include infinite summations. These infinite summations are due to the infinite state spaces of our models. In order to compute an infinite summation, we truncate the state space, and transform the original model with infinite queue into one with a finite queue. We choose the truncation point by trial and error. This consists of increasing the truncation point up to the one for which the performance measures do no vary any more, with a sufficiently high precision (six digits beyond the decimal point). Computation of d n : We have d n = G 1 n (β). (7) Since G n (t) is strictly increasing in t, we use a bisection algorithm. We choose the following relative condition for the convergence of this algorithm: d n (i) d n (i 1) d n (i 1) < 10 6, where d n (i) is the value found at iteration i of the bisection algorithm. In each iteration, we need to compute G n (t) for a given t > 0. To do so we use the uniformization method. Let us denote by {Y (t)} the pure death process shown in Figure 4 of the main paper Jouini et al. (2011). Computing G n (t) is equivalent to computing the transient probability, denoted by π s (t), that {Y (t)} is in state s at time t given that it is in state s + n + 1 at time 0. In order to compute π s (t), we use the uniformization method. We define ν as the maximum of the rates of {Y (t)}, i.e., ν = sµ + nγ. We thereafter transform the process {Y (t)} into a probabilistically equivalent one, using the Poisson process with parameter ν. We refer the reader to Tijms (2003), for example, for the details of this standard method. Computation of r n (θ): For the computation of r n (θ) for θ > 0 (given in Equation (26) of the main paper Jouini et al. (2011)), we use some basic transformations in order to avoid 12

13 numerical instabilities. One major issue comes from the product in Equation (26) of the main paper. To fix this issue, we compute for an iteration i, for i 1, the logarithm of the absolute value of the product by relating it to that of iteration i 1. We have ( ) n sµ + jγ n sµ + jγ sµ + (i 1)γ = n i + 1. (8) (j i)γ (j i)γ sµ + iγ i Thus ln n j=0, j i j=0, j i sµ + jγ (j i)γ = ln n j=0, j i 1 j=0, j i 1 sµ + jγ ( ) sµ + (i 1)γ (j i)γ + ln + ln sµ + iγ ( n i + 1 i ), (9) where x denotes the absolute value of x, for x R. We then come back to the original product terms by applying the exponential. Another useful computational idea, suggested by an anonymous referee, is as follows. The numerator of r n (θ) as given in Equation (22) of the main paper Jouini et al. (2011) can be written as P (d n T < D n (1 θ)d n ) = θ = = d n d n d n P (t < D n (1 θ)d n )γe γt dt (10) θ P (D n > θt + (1 θ)d n )γe γt dt (1 π s (θt + (1 θ)d n ))γe γt dt, where π s (t) is the same transition probability as defined in the previous paragraph, and can again be computed using uniformization. To compute the integral, one can use numerical integration. We observed from the numerical experiments that we conducted, that our implementation is suitable for small and medium call centers. However, for large call centers with more than 200 agents for example, numerical problems of convergence of our algorithms may occur. In those cases, the truncation point needs to be very high which leads to death rates that are too large. References Jouini, O., Akşin, Z., and Dallery, Y Call Centers with Delay Information: Models and Insights. Manufacturing & Service Operations Management, 13: , Tijms, H.C A First Course in Stochastic Models. John Wiley and Sons. New Jersey, U.S.A. Zeltyn, S. and Mandelbaum, A Call Centers with Impatient Customers: Many- Servers Asymptotics of the M/M/n+G Queue. Queueing Systems, 51:

Queueing Models for Full-Flexible Multi-class Call Centers with Real-Time Anticipated Delays

Queueing Models for Full-Flexible Multi-class Call Centers with Real-Time Anticipated Delays Oualid Jouini 1 Zeynep Akşin 2 Yves Dallery 1 1 Laboratoire Genie Industriel, Ecole Centrale Paris, Grande Voie

ENGINEERING SOLUTION OF A BASIC CALL-CENTER MODEL

ENGINEERING SOLUTION OF A BASIC CALL-CENTER MODEL by Ward Whitt Department of Industrial Engineering and Operations Research Columbia University, New York, NY 10027 Abstract An algorithm is developed to

Online Scheduling Policies for Multiclass Call Centers. with Impatient Customers

Online Scheduling Policies for Multiclass Call Centers with Impatient Customers Oualid Jouini 1 Auke Pot 2 Ger Koole 3 Yves Dallery 1 1 Laboratoire Génie Industriel, Ecole Centrale Paris, Grande Voie des

Real-Time Scheduling Policies for Multiclass Call Centers with Impatient Customers

Real-Time Scheduling Policies for Multiclass Call Centers with Impatient Customers Oualid Jouini Auke Pot Yves Dallery Ger Koole Ecole Centrale Paris Vrije Universiteit Amsterdam Laboratoire Génie Industriel

SPARE PARTS INVENTORY SYSTEMS UNDER AN INCREASING FAILURE RATE DEMAND INTERVAL DISTRIBUTION

SPARE PARS INVENORY SYSEMS UNDER AN INCREASING FAILURE RAE DEMAND INERVAL DISRIBUION Safa Saidane 1, M. Zied Babai 2, M. Salah Aguir 3, Ouajdi Korbaa 4 1 National School of Computer Sciences (unisia),

Models for Count Data With Overdispersion

Models for Count Data With Overdispersion Germán Rodríguez November 6, 2013 Abstract This addendum to the WWS 509 notes covers extra-poisson variation and the negative binomial model, with brief appearances

Call Centers with Hyperexponential Patience Modeling

Call Centers with Hyperexponential Patience Modeling Alex Roubos 1 Oualid Jouini 2 1 Department of Mathematics, VU University Amsterdam, De Boelelaan 1081a, 1081 HV Amsterdam, The Netherlands 2 Laboratoire

A joint chance-constrained programming approach for call center workforce scheduling under uncertain call arrival forecasts

*Manuscript Click here to view linked References A joint chance-constrained programming approach for call center workforce scheduling under uncertain call arrival forecasts Abstract We consider a workforce

MATH4427 Notebook 2 Spring 2016. 2 MATH4427 Notebook 2 3. 2.1 Definitions and Examples... 3. 2.2 Performance Measures for Estimators...

MATH4427 Notebook 2 Spring 2016 prepared by Professor Jenny Baglivo c Copyright 2009-2016 by Jenny A. Baglivo. All Rights Reserved. Contents 2 MATH4427 Notebook 2 3 2.1 Definitions and Examples...................................

Errata and updates for ASM Exam C/Exam 4 Manual (Sixteenth Edition) sorted by page

Errata for ASM Exam C/4 Study Manual (Sixteenth Edition) Sorted by Page 1 Errata and updates for ASM Exam C/Exam 4 Manual (Sixteenth Edition) sorted by page Practice exam 1:9, 1:22, 1:29, 9:5, and 10:8

A Uniform Asymptotic Estimate for Discounted Aggregate Claims with Subexponential Tails

12th International Congress on Insurance: Mathematics and Economics July 16-18, 2008 A Uniform Asymptotic Estimate for Discounted Aggregate Claims with Subexponential Tails XUEMIAO HAO (Based on a joint

Nonparametric adaptive age replacement with a one-cycle criterion

Nonparametric adaptive age replacement with a one-cycle criterion P. Coolen-Schrijner, F.P.A. Coolen Department of Mathematical Sciences University of Durham, Durham, DH1 3LE, UK e-mail: Pauline.Schrijner@durham.ac.uk

When Promotions Meet Operations: Cross-Selling and Its Effect on Call-Center Performance

When Promotions Meet Operations: Cross-Selling and Its Effect on Call-Center Performance Mor Armony 1 Itay Gurvich 2 Submitted July 28, 2006; Revised August 31, 2007 Abstract We study cross-selling operations

Single item inventory control under periodic review and a minimum order quantity

Single item inventory control under periodic review and a minimum order quantity G. P. Kiesmüller, A.G. de Kok, S. Dabia Faculty of Technology Management, Technische Universiteit Eindhoven, P.O. Box 513,

α α λ α = = λ λ α ψ = = α α α λ λ ψ α = + β = > θ θ β > β β θ θ θ β θ β γ θ β = γ θ > β > γ θ β γ = θ β = θ β = θ β = β θ = β β θ = = = β β θ = + α α α α α = = λ λ λ λ λ λ λ = λ λ α α α α λ ψ + α =

When Promotions Meet Operations: Cross-Selling and Its Effect on Call-Center Performance

When Promotions Meet Operations: Cross-Selling and Its Effect on Call-Center Performance Mor Armony 1 Itay Gurvich 2 July 27, 2006 Abstract We study cross-selling operations in call centers. The following

Stochastic Models for Inventory Management at Service Facilities

Stochastic Models for Inventory Management at Service Facilities O. Berman, E. Kim Presented by F. Zoghalchi University of Toronto Rotman School of Management Dec, 2012 Agenda 1 Problem description Deterministic

Performance Indicators for Call Centers with Impatience

Performance Indicators for Call Centers with Impatience Oualid Jouini 1, Ger Koole 2 & Alex Roubos 2 1 Ecole Centrale Paris, Laboratoire Génie Industriel, Grande Voie des Vignes, 9229 Châtenay-Malabry,

Using pivots to construct confidence intervals. In Example 41 we used the fact that

Using pivots to construct confidence intervals In Example 41 we used the fact that Q( X, µ) = X µ σ/ n N(0, 1) for all µ. We then said Q( X, µ) z α/2 with probability 1 α, and converted this into a statement

Modelling the performance of computer mirroring with difference queues

Modelling the performance of computer mirroring with difference queues Przemyslaw Pochec Faculty of Computer Science University of New Brunswick, Fredericton, Canada E3A 5A3 email pochec@unb.ca ABSTRACT

Aachen Summer Simulation Seminar 2014

Aachen Summer Simulation Seminar 2014 Lecture 07 Input Modelling + Experimentation + Output Analysis Peer-Olaf Siebers pos@cs.nott.ac.uk Motivation 1. Input modelling Improve the understanding about how

ECON20310 LECTURE SYNOPSIS REAL BUSINESS CYCLE

ECON20310 LECTURE SYNOPSIS REAL BUSINESS CYCLE YUAN TIAN This synopsis is designed merely for keep a record of the materials covered in lectures. Please refer to your own lecture notes for all proofs.

The Exponential Distribution

21 The Exponential Distribution From Discrete-Time to Continuous-Time: In Chapter 6 of the text we will be considering Markov processes in continuous time. In a sense, we already have a very good understanding

Chapter 3 RANDOM VARIATE GENERATION

Chapter 3 RANDOM VARIATE GENERATION In order to do a Monte Carlo simulation either by hand or by computer, techniques must be developed for generating values of random variables having known distributions.

Sampling and Hypothesis Testing

Population and sample Sampling and Hypothesis Testing Allin Cottrell Population : an entire set of objects or units of observation of one sort or another. Sample : subset of a population. Parameter versus

Lecture 3: Linear methods for classification

Lecture 3: Linear methods for classification Rafael A. Irizarry and Hector Corrada Bravo February, 2010 Today we describe four specific algorithms useful for classification problems: linear regression,

Stochastic Inventory Control

Chapter 3 Stochastic Inventory Control 1 In this chapter, we consider in much greater details certain dynamic inventory control problems of the type already encountered in section 1.3. In addition to the

Principle of Data Reduction

Chapter 6 Principle of Data Reduction 6.1 Introduction An experimenter uses the information in a sample X 1,..., X n to make inferences about an unknown parameter θ. If the sample size n is large, then

Performance Analysis of Computer Systems

Performance Analysis of Computer Systems Introduction to Queuing Theory Holger Brunst (holger.brunst@tu-dresden.de) Matthias S. Mueller (matthias.mueller@tu-dresden.de) Summary of Previous Lecture Simulation

Performance Analysis of a Telephone System with both Patient and Impatient Customers

Performance Analysis of a Telephone System with both Patient and Impatient Customers Yiqiang Quennel Zhao Department of Mathematics and Statistics University of Winnipeg Winnipeg, Manitoba Canada R3B 2E9

Department of Mathematics, Indian Institute of Technology, Kharagpur Assignment 2-3, Probability and Statistics, March 2015. Due:-March 25, 2015.

Department of Mathematics, Indian Institute of Technology, Kharagpur Assignment -3, Probability and Statistics, March 05. Due:-March 5, 05.. Show that the function 0 for x < x+ F (x) = 4 for x < for x

A Simple Model of Price Dispersion *

Federal Reserve Bank of Dallas Globalization and Monetary Policy Institute Working Paper No. 112 http://www.dallasfed.org/assets/documents/institute/wpapers/2012/0112.pdf A Simple Model of Price Dispersion

Deployment of express checkout lines at supermarkets

Deployment of express checkout lines at supermarkets Maarten Schimmel Research paper Business Analytics April, 213 Supervisor: René Bekker Faculty of Sciences VU University Amsterdam De Boelelaan 181 181

Random access protocols for channel access. Markov chains and their stability. Laurent Massoulié.

Random access protocols for channel access Markov chains and their stability laurent.massoulie@inria.fr Aloha: the first random access protocol for channel access [Abramson, Hawaii 70] Goal: allow machines

Hypothesis Testing COMP 245 STATISTICS. Dr N A Heard. 1 Hypothesis Testing 2 1.1 Introduction... 2 1.2 Error Rates and Power of a Test...

Hypothesis Testing COMP 45 STATISTICS Dr N A Heard Contents 1 Hypothesis Testing 1.1 Introduction........................................ 1. Error Rates and Power of a Test.............................

Corrected Diffusion Approximations for the Maximum of Heavy-Tailed Random Walk

Corrected Diffusion Approximations for the Maximum of Heavy-Tailed Random Walk Jose Blanchet and Peter Glynn December, 2003. Let (X n : n 1) be a sequence of independent and identically distributed random

Estimating the Degree of Activity of jumps in High Frequency Financial Data. joint with Yacine Aït-Sahalia

Estimating the Degree of Activity of jumps in High Frequency Financial Data joint with Yacine Aït-Sahalia Aim and setting An underlying process X = (X t ) t 0, observed at equally spaced discrete times

Generating Random Numbers Variance Reduction Quasi-Monte Carlo. Simulation Methods. Leonid Kogan. MIT, Sloan. 15.450, Fall 2010

Simulation Methods Leonid Kogan MIT, Sloan 15.450, Fall 2010 c Leonid Kogan ( MIT, Sloan ) Simulation Methods 15.450, Fall 2010 1 / 35 Outline 1 Generating Random Numbers 2 Variance Reduction 3 Quasi-Monte

LOOKING FOR A GOOD TIME TO BET

LOOKING FOR A GOOD TIME TO BET LAURENT SERLET Abstract. Suppose that the cards of a well shuffled deck of cards are turned up one after another. At any time-but once only- you may bet that the next card

1 Sufficient statistics

1 Sufficient statistics A statistic is a function T = rx 1, X 2,, X n of the random sample X 1, X 2,, X n. Examples are X n = 1 n s 2 = = X i, 1 n 1 the sample mean X i X n 2, the sample variance T 1 =

Basics of Statistical Machine Learning

CS761 Spring 2013 Advanced Machine Learning Basics of Statistical Machine Learning Lecturer: Xiaojin Zhu jerryzhu@cs.wisc.edu Modern machine learning is rooted in statistics. You will find many familiar

Master s Theory Exam Spring 2006

Spring 2006 This exam contains 7 questions. You should attempt them all. Each question is divided into parts to help lead you through the material. You should attempt to complete as much of each problem

CHAPTER 2 Estimating Probabilities

CHAPTER 2 Estimating Probabilities Machine Learning Copyright c 2016. Tom M. Mitchell. All rights reserved. *DRAFT OF January 24, 2016* *PLEASE DO NOT DISTRIBUTE WITHOUT AUTHOR S PERMISSION* This is a

2WB05 Simulation Lecture 8: Generating random variables

2WB05 Simulation Lecture 8: Generating random variables Marko Boon http://www.win.tue.nl/courses/2wb05 January 7, 2013 Outline 2/36 1. How do we generate random variables? 2. Fitting distributions Generating

Information Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay

Information Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay Lecture - 17 Shannon-Fano-Elias Coding and Introduction to Arithmetic Coding

Dongfeng Li. Autumn 2010

Autumn 2010 Chapter Contents Some statistics background; ; Comparing means and proportions; variance. Students should master the basic concepts, descriptive statistics measures and graphs, basic hypothesis

Chapter 1. Introduction

Chapter 1 Introduction 1.1. Motivation Network performance analysis, and the underlying queueing theory, was born at the beginning of the 20th Century when two Scandinavian engineers, Erlang 1 and Engset

Multimedia Messaging Service: System Description and Performance Analysis

Multimedia Messaging Service: System Description and Performance Analysis Majid Ghaderi and Srinivasan Keshav School of Computer Science University of Waterloo, Waterloo, ON N2L 3G1, Canada {mghaderi,keshav}@uwaterloo.ca

Overview of Monte Carlo Simulation, Probability Review and Introduction to Matlab

Monte Carlo Simulation: IEOR E4703 Fall 2004 c 2004 by Martin Haugh Overview of Monte Carlo Simulation, Probability Review and Introduction to Matlab 1 Overview of Monte Carlo Simulation 1.1 Why use simulation?

THE NUMBER OF GRAPHS AND A RANDOM GRAPH WITH A GIVEN DEGREE SEQUENCE. Alexander Barvinok

THE NUMBER OF GRAPHS AND A RANDOM GRAPH WITH A GIVEN DEGREE SEQUENCE Alexer Barvinok Papers are available at http://www.math.lsa.umich.edu/ barvinok/papers.html This is a joint work with J.A. Hartigan

MATH 10: Elementary Statistics and Probability Chapter 5: Continuous Random Variables

MATH 10: Elementary Statistics and Probability Chapter 5: Continuous Random Variables Tony Pourmohamad Department of Mathematics De Anza College Spring 2015 Objectives By the end of this set of slides,

MINITAB ASSISTANT WHITE PAPER

MINITAB ASSISTANT WHITE PAPER This paper explains the research conducted by Minitab statisticians to develop the methods and data checks used in the Assistant in Minitab 17 Statistical Software. One-Way

Gambling Systems and Multiplication-Invariant Measures

Gambling Systems and Multiplication-Invariant Measures by Jeffrey S. Rosenthal* and Peter O. Schwartz** (May 28, 997.. Introduction. This short paper describes a surprising connection between two previously

The Analysis of Dynamical Queueing Systems (Background)

The Analysis of Dynamical Queueing Systems (Background) Technological innovations are creating new types of communication systems. During the 20 th century, we saw the evolution of electronic communication

Stationary random graphs on Z with prescribed iid degrees and finite mean connections

Stationary random graphs on Z with prescribed iid degrees and finite mean connections Maria Deijfen Johan Jonasson February 2006 Abstract Let F be a probability distribution with support on the non-negative

A Coefficient of Variation for Skewed and Heavy-Tailed Insurance Losses. Michael R. Powers[ 1 ] Temple University and Tsinghua University

A Coefficient of Variation for Skewed and Heavy-Tailed Insurance Losses Michael R. Powers[ ] Temple University and Tsinghua University Thomas Y. Powers Yale University [June 2009] Abstract We propose a

Gamma Distribution Fitting

Chapter 552 Gamma Distribution Fitting Introduction This module fits the gamma probability distributions to a complete or censored set of individual or grouped data values. It outputs various statistics

SYSM 6304: Risk and Decision Analysis Lecture 3 Monte Carlo Simulation

SYSM 6304: Risk and Decision Analysis Lecture 3 Monte Carlo Simulation M. Vidyasagar Cecil & Ida Green Chair The University of Texas at Dallas Email: M.Vidyasagar@utdallas.edu September 19, 2015 Outline

Adaptive Threshold Policies for Multi-Channel Call Centers

Adaptive Threshold Policies for Multi-Channel Call Centers Benjamin Legros a Oualid Jouini a Ger Koole b a Laboratoire Génie Industriel, Ecole Centrale Paris, Grande Voie des Vignes, 92290 Châtenay-Malabry,

EE384Y Project Final Report Load Balancing and Switch Scheduling Xiangheng Liu Department of Electrical Engineering Stanford University, Stanford CA 94305 Email: liuxh@systems.stanford.edu Abstract Load

Optimal shift scheduling with a global service level constraint

Optimal shift scheduling with a global service level constraint Ger Koole & Erik van der Sluis Vrije Universiteit Division of Mathematics and Computer Science De Boelelaan 1081a, 1081 HV Amsterdam The

t := maxγ ν subject to ν {0,1,2,...} and f(x c +γ ν d) f(x c )+cγ ν f (x c ;d).

1. Line Search Methods Let f : R n R be given and suppose that x c is our current best estimate of a solution to P min x R nf(x). A standard method for improving the estimate x c is to choose a direction

CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e.

CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e. This chapter contains the beginnings of the most important, and probably the most subtle, notion in mathematical analysis, i.e.,

Optimal order placement in a limit order book. Adrien de Larrard and Xin Guo. Laboratoire de Probabilités, Univ Paris VI & UC Berkeley

Optimal order placement in a limit order book Laboratoire de Probabilités, Univ Paris VI & UC Berkeley Outline 1 Background: Algorithm trading in different time scales 2 Some note on optimal execution

Distributionally robust workforce scheduling in call centers with uncertain arrival rates

Distributionally robust workforce scheduling in call centers with uncertain arrival rates S. Liao 1, C. van Delft 2, J.-P. Vial 3,4 1 Ecole Centrale, Paris, France 2 HEC. Paris, France 3 Prof. Emeritus,

INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS

INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS STEVEN P. LALLEY AND ANDREW NOBEL Abstract. It is shown that there are no consistent decision rules for the hypothesis testing problem

Hydrodynamic Limits of Randomized Load Balancing Networks

Hydrodynamic Limits of Randomized Load Balancing Networks Kavita Ramanan and Mohammadreza Aghajani Brown University Stochastic Networks and Stochastic Geometry a conference in honour of François Baccelli

STT315 Chapter 4 Random Variables & Probability Distributions KM. Chapter 4.5, 6, 8 Probability Distributions for Continuous Random Variables

Chapter 4.5, 6, 8 Probability Distributions for Continuous Random Variables Discrete vs. continuous random variables Examples of continuous distributions o Uniform o Exponential o Normal Recall: A random

GLMs: Gompertz s Law. GLMs in R. Gompertz s famous graduation formula is. or log µ x is linear in age, x,

Computing: an indispensable tool or an insurmountable hurdle? Iain Currie Heriot Watt University, Scotland ATRC, University College Dublin July 2006 Plan of talk General remarks The professional syllabus

Optimal Hiring of Cloud Servers A. Stephen McGough, Isi Mitrani. EPEW 2014, Florence

Optimal Hiring of Cloud Servers A. Stephen McGough, Isi Mitrani EPEW 2014, Florence Scenario How many cloud instances should be hired? Requests Host hiring servers The number of active servers is controlled

A Quantitative Approach to the Performance of Internet Telephony to E-business Sites

A Quantitative Approach to the Performance of Internet Telephony to E-business Sites Prathiusha Chinnusamy TransSolutions Fort Worth, TX 76155, USA Natarajan Gautam Harold and Inge Marcus Department of

Scientific Computing: An Introductory Survey

Scientific Computing: An Introductory Survey Chapter 10 Boundary Value Problems for Ordinary Differential Equations Prof. Michael T. Heath Department of Computer Science University of Illinois at Urbana-Champaign

Queueing Networks with Blocking - An Introduction -

Queueing Networks with Blocking - An Introduction - Jonatha ANSELMI anselmi@elet.polimi.it 5 maggio 006 Outline Blocking Blocking Mechanisms (BAS, BBS, RS) Approximate Analysis - MSS Basic Notation We

Fluid Approximation of Smart Grid Systems: Optimal Control of Energy Storage Units

Fluid Approximation of Smart Grid Systems: Optimal Control of Energy Storage Units by Rasha Ibrahim Sakr, B.Sc. A thesis submitted to the Faculty of Graduate and Postdoctoral Affairs in partial fulfillment

Experiment #1, Analyze Data using Excel, Calculator and Graphs.

Physics 182 - Fall 2014 - Experiment #1 1 Experiment #1, Analyze Data using Excel, Calculator and Graphs. 1 Purpose (5 Points, Including Title. Points apply to your lab report.) Before we start measuring

PARTIAL CROSS TRAINING IN CALL CENTERS WITH UNCERTAIN ARRIVALS AND GLOBAL SERVICE LEVEL AGREEMENTS. D. J. Medeiros

Proceedings of the 07 Winter Simulation Conference S. G. Henderson, B. Biller, M.-H. Hsieh, J. Shortle, J. D. Tew, and R. R. Barton, eds. PARTIAL CROSS TRAINING IN CALL CENTERS WITH UNCERTAIN ARRIVALS

M/M/1 and M/M/m Queueing Systems

M/M/ and M/M/m Queueing Systems M. Veeraraghavan; March 20, 2004. Preliminaries. Kendall s notation: G/G/n/k queue G: General - can be any distribution. First letter: Arrival process; M: memoryless - exponential

Analysis of Bayesian Dynamic Linear Models

Analysis of Bayesian Dynamic Linear Models Emily M. Casleton December 17, 2010 1 Introduction The main purpose of this project is to explore the Bayesian analysis of Dynamic Linear Models (DLMs). The main

Stochastic Processes and Queueing Theory used in Cloud Computer Performance Simulations

56 Stochastic Processes and Queueing Theory used in Cloud Computer Performance Simulations Stochastic Processes and Queueing Theory used in Cloud Computer Performance Simulations Florin-Cătălin ENACHE

IEOR 6711: Stochastic Models I Fall 2012, Professor Whitt, Tuesday, September 11 Normal Approximations and the Central Limit Theorem

IEOR 6711: Stochastic Models I Fall 2012, Professor Whitt, Tuesday, September 11 Normal Approximations and the Central Limit Theorem Time on my hands: Coin tosses. Problem Formulation: Suppose that I have

1 Portfolio mean and variance

Copyright c 2005 by Karl Sigman Portfolio mean and variance Here we study the performance of a one-period investment X 0 > 0 (dollars) shared among several different assets. Our criterion for measuring

, for x = 0, 1, 2, 3,... (4.1) (1 + 1/n) n = 2.71828... b x /x! = e b, x=0

Chapter 4 The Poisson Distribution 4.1 The Fish Distribution? The Poisson distribution is named after Simeon-Denis Poisson (1781 1840). In addition, poisson is French for fish. In this chapter we will

LOGNORMAL MODEL FOR STOCK PRICES

LOGNORMAL MODEL FOR STOCK PRICES MICHAEL J. SHARPE MATHEMATICS DEPARTMENT, UCSD 1. INTRODUCTION What follows is a simple but important model that will be the basis for a later study of stock prices as

Lecture 3: Growth with Overlapping Generations (Acemoglu 2009, Chapter 9, adapted from Zilibotti)

Lecture 3: Growth with Overlapping Generations (Acemoglu 2009, Chapter 9, adapted from Zilibotti) Kjetil Storesletten September 10, 2013 Kjetil Storesletten () Lecture 3 September 10, 2013 1 / 44 Growth

PERIODIC REVIEW INVENTORY POLICY FOR PERISHABLES WITH RANDOM LIFETIME

8 th International Conference of Modeling and Simulation - MOSIM 1 - May 1-12, 21 - Hammamet - unisia Evaluation and optimization of innovative production systems of goods and services PERIODIC REVIEW

CHAPTER 6: Continuous Uniform Distribution: 6.1. Definition: The density function of the continuous random variable X on the interval [A, B] is.

Some Continuous Probability Distributions CHAPTER 6: Continuous Uniform Distribution: 6. Definition: The density function of the continuous random variable X on the interval [A, B] is B A A x B f(x; A,

Simple Linear Regression Inference

Simple Linear Regression Inference 1 Inference requirements The Normality assumption of the stochastic term e is needed for inference even if it is not a OLS requirement. Therefore we have: Interpretation

Portfolio Using Queuing Theory

Modeling the Number of Insured Households in an Insurance Portfolio Using Queuing Theory Jean-Philippe Boucher and Guillaume Couture-Piché December 8, 2015 Quantact / Département de mathématiques, UQAM.

6 Scalar, Stochastic, Discrete Dynamic Systems

47 6 Scalar, Stochastic, Discrete Dynamic Systems Consider modeling a population of sand-hill cranes in year n by the first-order, deterministic recurrence equation y(n + 1) = Ry(n) where R = 1 + r = 1

Online Appendix to Stochastic Imitative Game Dynamics with Committed Agents

Online Appendix to Stochastic Imitative Game Dynamics with Committed Agents William H. Sandholm January 6, 22 O.. Imitative protocols, mean dynamics, and equilibrium selection In this section, we consider

INTEGRATED OPTIMIZATION OF SAFETY STOCK

INTEGRATED OPTIMIZATION OF SAFETY STOCK AND TRANSPORTATION CAPACITY Horst Tempelmeier Department of Production Management University of Cologne Albertus-Magnus-Platz D-50932 Koeln, Germany http://www.spw.uni-koeln.de/

Machine Learning and Pattern Recognition Logistic Regression

Machine Learning and Pattern Recognition Logistic Regression Course Lecturer:Amos J Storkey Institute for Adaptive and Neural Computation School of Informatics University of Edinburgh Crichton Street,

Maximum Likelihood Estimation

Math 541: Statistical Theory II Lecturer: Songfeng Zheng Maximum Likelihood Estimation 1 Maximum Likelihood Estimation Maximum likelihood is a relatively simple method of constructing an estimator for

Credit Risk Models: An Overview

Credit Risk Models: An Overview Paul Embrechts, Rüdiger Frey, Alexander McNeil ETH Zürich c 2003 (Embrechts, Frey, McNeil) A. Multivariate Models for Portfolio Credit Risk 1. Modelling Dependent Defaults:

Parametric Models Part I: Maximum Likelihood and Bayesian Density Estimation

Parametric Models Part I: Maximum Likelihood and Bayesian Density Estimation Selim Aksoy Department of Computer Engineering Bilkent University saksoy@cs.bilkent.edu.tr CS 551, Fall 2015 CS 551, Fall 2015

A Log-Robust Optimization Approach to Portfolio Management

A Log-Robust Optimization Approach to Portfolio Management Dr. Aurélie Thiele Lehigh University Joint work with Ban Kawas Research partially supported by the National Science Foundation Grant CMMI-0757983

Lectures on Stochastic Processes. William G. Faris

Lectures on Stochastic Processes William G. Faris November 8, 2001 2 Contents 1 Random walk 7 1.1 Symmetric simple random walk................... 7 1.2 Simple random walk......................... 9 1.3

For a partition B 1,..., B n, where B i B j = for i. A = (A B 1 ) (A B 2 ),..., (A B n ) and thus. P (A) = P (A B i ) = P (A B i )P (B i )

Probability Review 15.075 Cynthia Rudin A probability space, defined by Kolmogorov (1903-1987) consists of: A set of outcomes S, e.g., for the roll of a die, S = {1, 2, 3, 4, 5, 6}, 1 1 2 1 6 for the roll