Maximum Likelihood Estimation of Isotonic Normal Means with Unknown Variances*
|
|
- Elwin Nicholson
- 5 years ago
- Views:
Transcription
1 Journal of Multvarate Analyss 64, (1998) Artcle No. MV Maxmum Lelhood Estmaton of Isotonc Normal Means wth Unnown Varances* Nng-Zhong Sh and Hua Jang Northeast Normal Unversty, Changchun,Chna Receved November 5, 1996; revsed June 3, 1997 To analyze the sotonc regresson problem for normal means, t s usual to assume that all varances are nown or unnown but equal. Ths paper then studes ths problem n the case that there are no condtons mposed on the varances. Suppose that we have data drawn from ndependent normal populatons wth unnown means + 's and unnown varances _ 's, n whch the means are restrcted by a gven partal orderng. Ths paper dscusses some propertes of the maxmum lelhood estmates of + 's and _ 's under the restrcton and proposes an algorthm for obtanng the estmates Academc Press AMS subject classfcatons 6H1, 6F10. Key words and phrases sotonc regresson, partal order, restrcted maxmum lelhood estmaton. 1. INTRODUCTION For ndependent normal populatons wth unnown means + and unnown varances _, =1,...,, ths paper studes the maxmum lelhood estmaton(mle) of +=(+ 1,..., + ) and _ =(_,..., 1 _) subject to the condton that the means + 's are restrcted by a gven partal orderng. Many nterestng partal orderngs may be consdered () a smple order on the means + 1 }}}+ ; () n the study of doseresponse relatonshps the means exhbt an unmodal trend + 1 }}}+ h }}}+, whch s called the umbrella order and ncludes the smple order wth h=; () a smple tree order on the means s of the form for =,...,, whch mples that some experments are desgned such that several treatments are sgnfcantly more effectve than a control. * Project supported by the Natonal Natural Scence Foundaton of Chna X Copyrght 1998 by Academc Press All rghts of reproducton n any form reserved.
2 184 SHI AND JIANG Let x j, j=1,..., n, be observatons from the th normal populaton. The log-lelhood functon s gven by l(+, _ )= =1{ &n ln _ & 1 _ n j=1 (x j &+ ) +c, (1.1) = where c s a constant whch does not depend on the parameters. By P denote a partal order defned on a fnte set 3=(% 1,..., % ). A -dmensonal vector + s sad to be an sotonc functon f % t, % s # 3, % t P% s mples + t + s.byd denote the set of all sotonc functons. The MLE of (+, _ ) s the maxmum soluton of (1.1) for + # D and _ # R +.If all varances are nown or unnown but equal, the MLE of + subject to the order restrcton s the maxmum soluton of (1.1) for + # D and equvalently s the soluton of mn =1 (x &+ ) w (1.) for + # D, where x = j x j n and w =n _ when varances are nown; w =n when all varances are unnown but equal. The soluton now s called the sotonc regresson of (x, w) wth x =(x 1,..., x ) and w= (w 1,..., w ). There are a number of elegant algorthms for obtanng the sotonc regresson, see for example, Barlow et al. (197) and Robertson et al. (1988). In the study of the sotonc regresson problem, the assumpton about varances must be needed. In practce, sometmes we cannot obtan much nformaton about the varances and ths paper deals wth the problem n the case that there are no condtons mposed on the varances. Sh (1994) consdered a smlar problem of estmatng the MLE of (+, _ ), n whch varances are also assumed to be restrcted by a gven partal order. The paper proposed an algorthm to compute the MLE and showed the convergence of the algorthm under the followng Condton A. For =1,...,, _ >(b&a), where _ denotes the sample varance of the th normal populatons, and a and b denote the mnmal and maxmal sample means respectvely. Secton 3 of ths paper proposes an algorthm of obtanng the MLE of (+, _ ) for our problem and shows that the convergence of the algorthm does not need any mposed condtons. However, we do not now f the algorthm converges to the true MLE and hence a condton as the Condton A s also necessary to show that the algorthm converges to the MLE, whch s dscussed n Secton 5. A numercal example usng the algorthm s gven n Secton 4. It s nown that the MLE s not unque for
3 ISOTONIC NORMAL MEANS 185 our problem and t s nterestng to study some propertes of the MLE, whch s gven n the next secton.. EXISTENCE OF THE MLE In ths secton, for convenence, we assume that the normal means are restrcted by the smple order, that s, + 1 }}}+. Note that smlar results gven n ths secton may be obtaned for any partal order restrctons. Let (+^, _^ ) be the MLE of (+, _ ) subject to the order restrcton. Then +^ # D and _^ # R +, whch satsfy l(+^, _^ )=sup[l(+, _ ); + # D, _ # R + ], (.1) where l(+, _ ) s gven n (1.1). For any fxed _ # R +, by the dscusson n Secton 1, the soluton of sup[l(+, _ ); + # D] must be the sotonc regresson of (x, w). From Theorem 1.6 of Barlow et al. (197) we have a+^ b (.) for =1,...,, where a and b are defned n Condton A. On the other hand, t s easy to chec that l(+, _ )l(+, _ (+)) for any fxed + # D, where _ (+)= j (x j &+ ) n and _ (+)=(_ 1(+),..., _ (+)). Then l(+^, _^ )=l(+^, _^ (+^ ))=sup[l(+, _ (+)); + # D 0 ], (.3) where D 0 =[+ # D; a+ b, =1,..., ]. Let L(+)= =1 &n ln[_ +(x &+ ) ], (.4) where the _ 's are defned n Condton A. Thus +^ s the soluton of (.3) f and only f +^ # D 0 and satsfes L(+^ )=sup[l(+); + # D 0 ]. (.5) Snce L(+) s a contnuous functon of + and D 0 s a compact set, the soluton of (.5) and then of (.1) exsts. It means that the MLE of (+, _ ) under the order restrcton exsts.
4 186 SHI AND JIANG As D s a polyhedral convex cone, for any gven + # D, there unquely exsts a subscrpt set [ 1,..., t ] wth 1 1 <}}}< t < such that + may be wrtten as + 1 =}}}=+ 1 <+ 1 +1=}}}=+ <}}}<+ t +1=}}}=+. (.6) Defnton. A vector + # D s sad to be a favorable pont f there s a subscrpt set [ 1,..., t ] such that + satsfes (.6) and s+1 = s +1 (x &+ ) w (+)=0 (.7) for s=0, 1,..., t, where w (+)=n _ (+), 0=0, and t+1 =. Theorem.1. If +^ s the soluton of (.5), there s a subscrpt set [ 1,..., t ] such that +^ satsfes (.6) and (.7), namely t s a favorable pont. The above theorem shows that the MLE of + must be a favorable pont and ts proof s gven n the Appendx. Because L( +) s not a concave functon, n general, the soluton of (.5) wll not be unque. However, we have the followng result. Theorem.. There are fntely many favorable ponts. Proof. For a fxed subscrpt set, the components + of a vector + wll be a constant for # [ s +1,..., s+1 ], s=0, 1,..., t, f the vector satsfes (.6). If % s+1 denotes the constant, then (.7) may be wrtten as s+1 = s +1 n (x &% s+1 ) g (% s+1 )=0, (.8) where g (% s+1 )=1 j (x j &% s+1 ) and s=0, 1,..., t. Snce the left-hand sde of (.8) s a polynomal of % s+1, the number of the soluton of (.8) s fnte. As there are fntely many subscrpt sets, the theorem follows. _ Condton B. For =1,...,, _ >max[(x &a),(x &b) ],, a, and b are as defned n Condton A. where Theorem.3. Proof. If Condton B holds, the favorable pont unquely exsts. Condton B mples L(+) =&_ + +(x &+ ) <0
5 ISOTONIC NORMAL MEANS 187 for all + satsfyng a+ b and =1,...,. Then L(+) s a concave functon on [a, b]. By (.), the soluton of (.5) unquely exsts and, by Theorem.1, the favorable pont unquely exsts. Let (+^, _^ ) be a MLE subject to the gven order restrcton. By Theorem.1, +^ must be a favorable pont and, from (.3), _^ =_ (+^ ) for =1,...,. Then Theorem. mples that the number of the MLE s fnte. If Condton B holds, by Theorem.3 the MLE s unque. 3. THE PROPOSED ALGORITHM For a gven subscrpt set, one can obtan all favorable ponts accordng to the subscrpt set usng (.6) and (.8), n whch all real roots of some polynomals need to be found. Then the MLE of (+, _ ) may be obtaned by comparng all favorable ponts for all subscrpt sets. However, ths procedure s very hard to carry out. Ths secton proposes an teraton algorthm. As n the dscusson n Secton 1, f the varance vector _ s gven the MLE of + may be obtaned as n the sotonc regresson problem, and f the mean vector + s gven the MLE of _ s just _ (+) as defned n (.3). The followng algorthm s based on ths consderaton. Algorthm. Step(0, 0). Let + (0) =x and _ (0) =_. Step(n, 1). Fnd + (n), the sotonc regresson of (x, w (n&1) ) for w (n&1) n _ (n&1). Step(n, ). Let _ (n) =_ (+(n) ) and _ (n) =(_ (n) 1,..., _(n) ). The above algorthm shows that = l(+ (n), _ (n&1) )l(+ (n), _ (n) )l(+ (n+1), _ (n) ) (3.1) and L(+ (n) )L(+ (n+1) ) for n1. By the monotoncty, L(+ ( p) )=L(+ ( p+q) ) for all ntegers q1 f L(+ ( p) )=L(+ ( p+1) ). Thus we can gve a termnaton crteron for the algorthm. For example, we stop the teraton at Step(n,) f max 1 + (n&1) &+ (n) 10 &m for some ntegers m1. The proof of the followng theorem s gven n the Appendx.
6 188 SHI AND JIANG Theorem 3.1. The pont sequence [+ (n) ] gven n the above algorthm converges to a favorable pont as n. Corollary 3.1 If Condton B holds and the lmtng pont of [+ (n) ]s +*, then the MLE of (+, _ ) s (+*, _ (+*)). The above corollary may be shown by usng Theorem.3. It must be noted that n the above corollary Condton B s not always needed. For example, f the sample means satsfy x 1 }}}x, the MLE wll be (+ (1), _ (1) ), the one step result of the algorthm. However, n general, the condton cannot be omtted. A detaled dscusson s gven n Secton NUMERICAL EXAMPLE For llustraton, the proposed algorthm s used to treat the data shown n Sh (1994). There are fve dstrcts n Jln Provnce of Chna Laoyuan (Group 1), Qanfu (Group ), Changchu (Group 3), Tonghua (Group 4), and Jln (Group 5). The data gave the scores of 100 students per dstrct obtaned n the Natonal Matrculaton Examnaton held n 199. Past experence showed that the condtons of educaton of the dstrct +1 was lely better than dstrct for =1,..., 4. We proceed to estmate the examnaton scores of students of the fve dstrcts. By X we denote the examnaton score of dstrct, then X follows a normal dstrbuton wth unnown mean + and unnown varance _ for =1,..., 5. Pror nformaton tells us that the means exhbt an ncreasng trend + 1 }}}+ 5. We use the proposed algorthm to estmate the MLE of + 's and _ 's subject to the smple order restrcton. It s easy to chec that Condton B s satsfed, and by Corollary 3.1 we can obtan the MLE by the proposed algorthm. The computed results of estmatng the means and the varances are lsted n Table I, n whch Cran's (1980) program was used as a subroutne to compute sotonc TABLE I Computng Results of Examnaton Scores =1 = =3 =4 =5 +(0) _(0) (1) _(1) () _()
7 ISOTONIC NORMAL MEANS 189 regresson and the teraton s termnated when max + (n&1) &+ (n) 10 &3. The computed results show that the teraton s termnated at n=. In the table, for the termnated crteron 10 &3, + (1) =+ () means that the MLE of + s the same as the sotonc regresson of (x, w ), wth w =n _ of _ s dfferent from the sample varance, that s, _ (0) {_ ().. The MLE 5. DISCUSSION Recall that our problem s to fnd the soluton (+^, _^ ) whch maxmzes l(+, _ ) subject to + # D and _ # R +, (5.1) where l(+, _ ) s gven n (1.1). For estmatng +, one may replace _ by _ n (1.) to obtan the sotonc regresson +$, say, of (x, w ) wth w =n _ for =1,...,. The estmate of _ wll be _ or, by the lelhood prncple, _ (+$) as defned n (.3). However, the estmates (+$, _ ) and (+$, _ (+$)) are the results of Step (1,1) and Step (1,) n the proposed algorthm respectvely. Furthermore, the expresson of L( +) n (.4) may be wrtten as L(+)= =1 &+ ) &n ln _1+(x _ & +c, where c s a constant whch does not depend on the parameters. If Condton B holds, by Taylor expanson, L(+)= =1 j=1 (&1) j [(x &+ ) w ] j. j Then the estmate +$, the sotonc regresson of (x, w ), s the frst approxmaton, j=1, for the soluton of (5.1). On the other hand, by (.3), a reasonable estmate of (+, _ ) s of the form (&, _ (&)) and satsfes =1 E(x &+ ) w (x )> =1 E(& &+ ) w (&) (5.) for any + # D, where w (})=n _ ( } ) and =1,..., ; see Brun (1965), Lee (1981, 1988) and Hwang and Peddada (1994). The Eq. (5.) mples that the mean square error of the estmate (&, _ (&)) s strctly less than that of the usual estmate. Let +* be the lmtng pont of the proposed algorthm. For every step n>1 of the algorthm, by (3.1) we have
8 190 SHI AND JIANG =1 E(x &+ ) w (x )> =1 =1 E(+ (1) &+ ) w (x ) E(+ (n) &+ ) w (+ (n&1) ), and then the estmate (+*, _ (+*)) satsfes (5.) even f t s not the MLE. Note that + (1) =+$ n the second port of the above expresson. It wll be very mportant to now the rato at whch Condton B s satsfed for some regular cases and to now how many favorable ponts, from the proposed algorthm, are the MLE even f Condton B s not satsfed. Therefore, some smulaton studes are needed. Some smulaton results are lsted n Table II, n whch =5 and 7 respectvely. The normal means are consdered n two cases (1) equal means + 1 =}}}=+ ; () equal spacng means + +1 &+ =, where TABLE II The Smulaton Results for Condton B Mean Varance NUNB NUNC n=10 n=15 n=0 n=10 n=15 n=0 = &. & = Note. The smulatons were run tmes. In the tables NUNB denotes the number of tmes that Condton B s not satsfed and NUNC denotes the number of tmes that the algorthm does not converge to true MLE.
9 ISOTONIC NORMAL MEANS 191 =1,..., &1 and =0.1. The varances are consdered n four cases, equal, ncreasng, unmodal, and decreasng, as lsted n the table. We tae the smulatons for equal sample szes n =10, n =15, and n =0 respectvely. The smulatons are run tmes for each case. In the table, NUNB denotes the number of tmes that Condton B s not satsfed and NUNC denotes the number of tmes that the favorable pont obtaned by the proposed algorthm s not the MLE. The NUNB depends on the relatonshp of szes of means and varances, and also depends on the sample sze. NUNC=0, almost everywhere, tells us that the favorable pont obtaned by the proposed algorthm s the MLE even f Condton B s not satsfed for the consdered regular cases. However, we can fnd some abnormal cases such that the NUNC does not equal zero, as lsted n Table III. In the table, for =5, the means are 1., 0.9, 0.6, 0.3, and 0.0, and t s anttonc wth respect to the smple order; the varances are 1.0, 0.8, 0.6, 0.4, and 0. respectvely. The smulatons are run tmes for equal sample sze n =0. It may be seen that Condton B s not satsfed for any of the cases. The favorable pont from the proposed algorthm s not the MLE for 3 cases. For these cases, let +^ denote the true MLE, +* denote the favorable pont obtaned from the proposed algorthm, and +$ denote the sotonc regresson of TABLE III The Smulaton Results for Abnormal Cases =5, n=0, NUNB=10000, NUNC=3 L(u^ ) L(u*) L(u$) L(u^ )L(u*) L(u^ )L(u$) L(u^ ) L(u*) L(u$) L(u^ )L(u*) L(u^ )L(u$) Note. The smulatons were run tmes. The values of the log-lelhood functon are lsted, n whch u^ denotes the true MLE, u* denotes the estmate from the algorthm, and u$ denotes the sotonc regresson usng the sample varances.
10 19 SHI AND JIANG (x, w ) wth the estmate of varances _ (+$), the result of Step (1,) n the algorthm. The values of L(+^ ), L(+*), and L(+$) are lsted n Table III. The dfferences L( +^ )&L( +*) and L( +^ )&L( +$) are also lsted n Table III. The dfferences, L( +^ )&L( +*), are very small, correspondng to the values of L(+^ ) and L(+*) for all cases. The value of L(+*) s greater than that of L(+$). Consequently, we recommend the teraton algorthm for practcal use because ts computaton s smple and t has good propertes of convergence. APPENDIX The Proof of Theorem.1. We need to fnd a vector +^ whch belongs to D and maxmzes L(+), gven n (.4), subject to + # D. The Lagrangan functon now s gven by &1 8(+, *)= 1 L(+)+ =1 * (+ +1 &+ ), where *=(* 1,..., * &1 ) and * 's are the Lagrangan multplers. The KuhnTucer condtons are usually used to deal wth such problems. If +^ maxmzes L( +) subject to + # D, then +^ satsfes the followng condtons 1. +^ 1 }}}+^ ;. 8+ +^ =0 for =1,..., ; 3. * 0 for =1,..., &1; 4. * (+^ +1&+^ )=0 for =1,..., &1. The second of these condtons corresponds to the equaton (x &+^ ) w (+^ )+* &1 &* =0 (A1) for =1,...,, where w (+^ ) s gven n (.7) and * 0 =* =0. Let [ 1,..., t ] be the subscrpt set such that * j =0, j=1,..., t; * >0, otherwse. Then the frst, thrd and fourth condtons gven n the above mply that +^ satsfes (.6) and, from (A1), we have (.7). The KuhnTucer condtons are necessarly satsfed for our problem. Furthermore, f L( +) s a concave functon, by the dscusson n Mangasaran (1969, p. 94) these are also suffcent condtons and there exsts unquely a favorable pont; see also Theorem.3 n ths paper. To prove Theorem 3.1, we need the followng lemmas.
11 ISOTONIC NORMAL MEANS 193 Lemma A.1. Let [ y n ] be a unformly bounded sequence n R. If y n & y n&1 0, as n, and the sequence s not convergent, then there are nfntely many accumulaton pont of the sequence, where 0 denotes the -dmensonal zero vector. Proof. At frst, we consder the case of =1. Let =lm nf [y n ] and ;=lm sup [y n ]. By the condton, <;. For any z #(, ;), we wll show that z s an accumulaton pont of [y n ], namely, there s a subsequence of [y n ] whch converges to z. For any = 1 >0, by the assumpton there s a postve nteger N 1 such that y n+1 & y n <= 1 f n>n 1. On the other hand, <z<; mples that there s a postve nteger n 1 >N 1 such that y n1 <z and y n1 +1>z. Then we have y n1 &z <y n1 +1& y n1 <= 1. Smlarly, for any = >0 wth = <= 1, there s a term y n wth n >n 1 such that y n &z <=. If one contnues ths procedure, a subsequence [y nj ] may be obtaned and t converges to z. For >1, denote y n =(y 1n,..., y n ). Let =lm nf[y n ] and ; =lm sup [y n ], =1,...,. Wthout loss of generalty, assume that 1 <; 1. For any z 1 #( 1, ; 1 ), from the above dscusson there s a subsequence [y 1nj ] of [y 1n ] wth y 1nj z 1,asn j. As the sequence s unformly bounded, for =, there s a subsequence of [y nj ] whch converges to z for some z n the nterval [, ; ]. So we can obtan a subsequence of [y n ] and a pont z, nr, wth the frst component z 1 such that the subsequence converges to z. Because there are nfntely many ponts n ( 1, ; 1 ), the proof of ths theorem s completed. Lemma A.. Let [+ (n) ] be the sequence from the proposed algorthm and let [+ (n j ) ] be a subsequence. If the subsequence s convergent, then + (n j ) & + (n j &1) 0, as n j. Proof. As _ (n) s a contnuous functon of + (n), _ (n j ) s also convergent. Recallng the expresson (1.1), l(+ (n j ), _ (n j ) ) s convergent. From n j&1 n j &1 and (3.1), we have 0l(+ (n j &1), _ (n j &1) )&l(+ (n j ), _ (n j &1) ) l(+ (n j&1 ), _ (n j&1 ) )&l(+ (n j ), _ (n j ) ) 0 (A)
12 194 SHI AND JIANG as n j. For smplfyng the notaton, denote n j by m. Snce the dfference of l(+ (m&1), _ (m&1) ) and l(+ (m), _ (m&1) ) may be wrtten as =1 [(x &+ (m) ) &(x &+ (m&1) ) ] w (m&1), where w (m&1) s defned n the Algorthm, (A) mples that the dfference converges to 0 when m tends to nfnte. Because + (m) s the sotonc regresson of (x, w (m&1) ), followng the dscusson n Sh (1994, p. 91), we have + (m) &+ (m&1) 0,asm. Lemma A.3. Let [+ (n) ] be the sequence from the proposed algorthm and [+ (m) ] be a subsequence. If the subsequence s convergent, then t converges to a favorable pont. Proof. Assume that + (m) &, asm. Snce & belongs to D, there s a subscrpt set [ 1,..., t ] such that & satsfes (.6). Now we show that & satsfes (.7). Let and (m) s+1 =mn[+(m) ; s +1 s+1 ] ; (m) s+1 =max[+(m) ; s +1 s+1 ], where s=0, 1,..., t, 0 =0, and t+1 =. Because + (m) converges to &, for any $>0, there s an nteger M$ such that max[; (m) s+1 &(m) s+1 ; s=0, 1,..., t]<$, (A3) for m>m$. From the proposed algorthm, + (m) s the sotonc regresson of (x, w(+ (m&1) )). Therefore for any =>0, by the lemma n Barlow et al. (197, p. 34) and (A3), there s an nteger M wth M>M$ such that s+1 (x } &+ (m) ) w (+ (m&1) ) (A4) }<= = s +1 for m>m and s=0, 1,..., t. Asw(+) s a contnuous functon of +, we have s+1 = s +1 (x && ) w (&)= lm s+1 m = s +1 = lm m =0 s+1 = s +1 (x &+ (m) ) w (+ (m) ) (x &+ (m) ) w (+ (m&1) )
13 ISOTONIC NORMAL MEANS 195 for s=0, 1,..., t. The second equaton of the above follows Lemma A and the last follows (A4). Then & satsfes (.7) and s a favorable pont. The Proof of Theorem 3.1. Let l n&1 =l(+ (n), _ (n&1) ) and l n = l(+ (n), _ (n) ), where n>1 and + (n) and _ (n) are as gven n the algorthm. From l(+ (n, ), _ (n) )l(x, _ ) and (3.1), the real number sequence [l m ; m=1,,...] s monotone ncreasng and bounded. Then the sequence s convergent and l n &l n&1 0, as n. By usng a method smlar to that shown n the proof of Lemma A, we can prove that + (n) &+ (n&1) 0, as n. Snce [+ (n) ] s unformly bounded, f t s not convergent, by Lemma Al, there are nfntely many accumulaton ponts and, by Lemma A3, they are all favorable ponts. Ths contradcts Theorem.. Therefore [+ (n) ] s convergent and, by Lemma A3 agan, t converges to a favorable pont. ACKNOWLEDGMENTS We than the referee for helpful comments. We rewrote Secton 5 tang hs comments nto account. We are also grateful to the edtors for ther help and support. REFERENCES 1. Barlow, R. E., Bartholomew, D. J., Bremner, J. M., and Brun, H. D. (197). Statstcal Inference under Order Restrctons. New Yor Wley.. Brun, H. D. (1965). Condtonal expectaton gven a _-lattce and applcatons. Ann. Math. Statst Cran, G. M. (1980). Amalgamaton of means n case of smple orderng. Appl. Statst Hwang, J. T. G., and Peddada, S. D. (1994). Confdence nterval estmaton subject to order restrctons. Ann. Statst Lee, C. I. C. (1981). The quadratc loss of sotonc regresson under normalty. Ann. Statst Lee, C. I.C. (1988). The quadratc loss of order restrcted estmatons for several treatment means and a control mean. Ann. Statst Mangasaran, O. L. (1969). Nonlnear Programmng. New Yor Wley. 8. Robertson, T., Wrght, F. T., and Dystra, R. L. (1988). Order Restrcted Statstcal Inference. New Yor Wley. 9. Sh, N.-Z. (1994). Maxmum lelhood estmaton of means and varances from normal populatons under smultaneous order restrctons. J. Multvarate Anal
Appendix for Solving Asset Pricing Models when the Price-Dividend Function is Analytic
Appendx for Solvng Asset Prcng Models when the Prce-Dvdend Functon s Analytc Ovdu L. Caln Yu Chen Thomas F. Cosmano and Alex A. Hmonas January 3, 5 Ths appendx provdes proofs of some results stated n our
More informationMgtOp 215 Chapter 13 Dr. Ahn
MgtOp 5 Chapter 3 Dr Ahn Consder two random varables X and Y wth,,, In order to study the relatonshp between the two random varables, we need a numercal measure that descrbes the relatonshp The covarance
More information4.4 Doob s inequalities
34 CHAPTER 4. MARTINGALES 4.4 Doob s nequaltes The frst nterestng consequences of the optonal stoppng theorems are Doob s nequaltes. If M n s a martngale, denote M n =max applen M. Theorem 4.8 If M n s
More informationProduction and Supply Chain Management Logistics. Paolo Detti Department of Information Engeneering and Mathematical Sciences University of Siena
Producton and Supply Chan Management Logstcs Paolo Dett Department of Informaton Engeneerng and Mathematcal Scences Unversty of Sena Convergence and complexty of the algorthm Convergence of the algorthm
More informationECE 586GT: Problem Set 2: Problems and Solutions Uniqueness of Nash equilibria, zero sum games, evolutionary dynamics
Unversty of Illnos Fall 08 ECE 586GT: Problem Set : Problems and Solutons Unqueness of Nash equlbra, zero sum games, evolutonary dynamcs Due: Tuesday, Sept. 5, at begnnng of class Readng: Course notes,
More informationTCOM501 Networking: Theory & Fundamentals Final Examination Professor Yannis A. Korilis April 26, 2002
TO5 Networng: Theory & undamentals nal xamnaton Professor Yanns. orls prl, Problem [ ponts]: onsder a rng networ wth nodes,,,. In ths networ, a customer that completes servce at node exts the networ wth
More informationEquilibrium in Prediction Markets with Buyers and Sellers
Equlbrum n Predcton Markets wth Buyers and Sellers Shpra Agrawal Nmrod Megddo Benamn Armbruster Abstract Predcton markets wth buyers and sellers of contracts on multple outcomes are shown to have unque
More informationAn Approximate E-Bayesian Estimation of Step-stress Accelerated Life Testing with Exponential Distribution
Send Orders for Reprnts to reprnts@benthamscenceae The Open Cybernetcs & Systemcs Journal, 25, 9, 729-733 729 Open Access An Approxmate E-Bayesan Estmaton of Step-stress Accelerated Lfe Testng wth Exponental
More informationElements of Economic Analysis II Lecture VI: Industry Supply
Elements of Economc Analyss II Lecture VI: Industry Supply Ka Hao Yang 10/12/2017 In the prevous lecture, we analyzed the frm s supply decson usng a set of smple graphcal analyses. In fact, the dscusson
More information/ Computational Genomics. Normalization
0-80 /02-70 Computatonal Genomcs Normalzaton Gene Expresson Analyss Model Computatonal nformaton fuson Bologcal regulatory networks Pattern Recognton Data Analyss clusterng, classfcaton normalzaton, mss.
More informationCyclic Scheduling in a Job shop with Multiple Assembly Firms
Proceedngs of the 0 Internatonal Conference on Industral Engneerng and Operatons Management Kuala Lumpur, Malaysa, January 4, 0 Cyclc Schedulng n a Job shop wth Multple Assembly Frms Tetsuya Kana and Koch
More informationEconomic Design of Short-Run CSP-1 Plan Under Linear Inspection Cost
Tamkang Journal of Scence and Engneerng, Vol. 9, No 1, pp. 19 23 (2006) 19 Economc Desgn of Short-Run CSP-1 Plan Under Lnear Inspecton Cost Chung-Ho Chen 1 * and Chao-Yu Chou 2 1 Department of Industral
More information15-451/651: Design & Analysis of Algorithms January 22, 2019 Lecture #3: Amortized Analysis last changed: January 18, 2019
5-45/65: Desgn & Analyss of Algorthms January, 09 Lecture #3: Amortzed Analyss last changed: January 8, 09 Introducton In ths lecture we dscuss a useful form of analyss, called amortzed analyss, for problems
More informationLecture 7. We now use Brouwer s fixed point theorem to prove Nash s theorem.
Topcs on the Border of Economcs and Computaton December 11, 2005 Lecturer: Noam Nsan Lecture 7 Scrbe: Yoram Bachrach 1 Nash s Theorem We begn by provng Nash s Theorem about the exstance of a mxed strategy
More informationProblem Set 6 Finance 1,
Carnege Mellon Unversty Graduate School of Industral Admnstraton Chrs Telmer Wnter 2006 Problem Set 6 Fnance, 47-720. (representatve agent constructon) Consder the followng two-perod, two-agent economy.
More informationMode is the value which occurs most frequency. The mode may not exist, and even if it does, it may not be unique.
1.7.4 Mode Mode s the value whch occurs most frequency. The mode may not exst, and even f t does, t may not be unque. For ungrouped data, we smply count the largest frequency of the gven value. If all
More informationApplications of Myerson s Lemma
Applcatons of Myerson s Lemma Professor Greenwald 28-2-7 We apply Myerson s lemma to solve the sngle-good aucton, and the generalzaton n whch there are k dentcal copes of the good. Our objectve s welfare
More informationAppendix - Normally Distributed Admissible Choices are Optimal
Appendx - Normally Dstrbuted Admssble Choces are Optmal James N. Bodurtha, Jr. McDonough School of Busness Georgetown Unversty and Q Shen Stafford Partners Aprl 994 latest revson September 00 Abstract
More informationMeasures of Spread IQR and Deviation. For exam X, calculate the mean, median and mode. For exam Y, calculate the mean, median and mode.
Part 4 Measures of Spread IQR and Devaton In Part we learned how the three measures of center offer dfferent ways of provdng us wth a sngle representatve value for a data set. However, consder the followng
More informationParallel Prefix addition
Marcelo Kryger Sudent ID 015629850 Parallel Prefx addton The parallel prefx adder presented next, performs the addton of two bnary numbers n tme of complexty O(log n) and lnear cost O(n). Lets notce the
More informationCOS 511: Theoretical Machine Learning. Lecturer: Rob Schapire Lecture #21 Scribe: Lawrence Diao April 23, 2013
COS 511: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture #21 Scrbe: Lawrence Dao Aprl 23, 2013 1 On-Lne Log Loss To recap the end of the last lecture, we have the followng on-lne problem wth N
More informationCS 286r: Matching and Market Design Lecture 2 Combinatorial Markets, Walrasian Equilibrium, Tâtonnement
CS 286r: Matchng and Market Desgn Lecture 2 Combnatoral Markets, Walrasan Equlbrum, Tâtonnement Matchng and Money Recall: Last tme we descrbed the Hungaran Method for computng a maxmumweght bpartte matchng.
More information3: Central Limit Theorem, Systematic Errors
3: Central Lmt Theorem, Systematc Errors 1 Errors 1.1 Central Lmt Theorem Ths theorem s of prme mportance when measurng physcal quanttes because usually the mperfectons n the measurements are due to several
More informationPrice and Quantity Competition Revisited. Abstract
rce and uantty Competton Revsted X. Henry Wang Unversty of Mssour - Columba Abstract By enlargng the parameter space orgnally consdered by Sngh and Vves (984 to allow for a wder range of cost asymmetry,
More informationMultifactor Term Structure Models
1 Multfactor Term Structure Models A. Lmtatons of One-Factor Models 1. Returns on bonds of all maturtes are perfectly correlated. 2. Term structure (and prces of every other dervatves) are unquely determned
More informationOPERATIONS RESEARCH. Game Theory
OPERATIONS RESEARCH Chapter 2 Game Theory Prof. Bbhas C. Gr Department of Mathematcs Jadavpur Unversty Kolkata, Inda Emal: bcgr.umath@gmal.com 1.0 Introducton Game theory was developed for decson makng
More informationUnderstanding Annuities. Some Algebraic Terminology.
Understandng Annutes Ma 162 Sprng 2010 Ma 162 Sprng 2010 March 22, 2010 Some Algebrac Termnology We recall some terms and calculatons from elementary algebra A fnte sequence of numbers s a functon of natural
More informationEDC Introduction
.0 Introducton EDC3 In the last set of notes (EDC), we saw how to use penalty factors n solvng the EDC problem wth losses. In ths set of notes, we want to address two closely related ssues. What are, exactly,
More informationarxiv: v1 [math.nt] 29 Oct 2015
A DIGITAL BINOMIAL THEOREM FOR SHEFFER SEQUENCES TOUFIK MANSOUR AND HIEU D. NGUYEN arxv:1510.08529v1 [math.nt] 29 Oct 2015 Abstract. We extend the dgtal bnomal theorem to Sheffer polynomal sequences by
More informationTesting for Omitted Variables
Testng for Omtted Varables Jeroen Weese Department of Socology Unversty of Utrecht The Netherlands emal J.weese@fss.uu.nl tel +31 30 2531922 fax+31 30 2534405 Prepared for North Amercan Stata users meetng
More informationII. Random Variables. Variable Types. Variables Map Outcomes to Numbers
II. Random Varables Random varables operate n much the same way as the outcomes or events n some arbtrary sample space the dstncton s that random varables are smply outcomes that are represented numercally.
More informationFinancial mathematics
Fnancal mathematcs Jean-Luc Bouchot jean-luc.bouchot@drexel.edu February 19, 2013 Warnng Ths s a work n progress. I can not ensure t to be mstake free at the moment. It s also lackng some nformaton. But
More informationData Mining Linear and Logistic Regression
07/02/207 Data Mnng Lnear and Logstc Regresson Mchael L of 26 Regresson In statstcal modellng, regresson analyss s a statstcal process for estmatng the relatonshps among varables. Regresson models are
More informationDr. A. Sudhakaraiah* V. Rama Latha E.Gnana Deepika
Internatonal Journal Of Scentfc & Engneerng Research, Volume, Issue 6, June-0 ISSN - Splt Domnatng Set of an Interval Graph Usng an Algorthm. Dr. A. Sudhakaraah* V. Rama Latha E.Gnana Deepka Abstract :
More informationAnalysis of Variance and Design of Experiments-II
Analyss of Varance and Desgn of Experments-II MODULE VI LECTURE - 4 SPLIT-PLOT AND STRIP-PLOT DESIGNS Dr. Shalabh Department of Mathematcs & Statstcs Indan Insttute of Technology Kanpur An example to motvate
More informationSupplementary material for Non-conjugate Variational Message Passing for Multinomial and Binary Regression
Supplementary materal for Non-conjugate Varatonal Message Passng for Multnomal and Bnary Regresson October 9, 011 1 Alternatve dervaton We wll focus on a partcular factor f a and varable x, wth the am
More information2.1 Rademacher Calculus... 3
COS 598E: Unsupervsed Learnng Week 2 Lecturer: Elad Hazan Scrbe: Kran Vodrahall Contents 1 Introducton 1 2 Non-generatve pproach 1 2.1 Rademacher Calculus............................... 3 3 Spectral utoencoders
More informationQuiz on Deterministic part of course October 22, 2002
Engneerng ystems Analyss for Desgn Quz on Determnstc part of course October 22, 2002 Ths s a closed book exercse. You may use calculators Grade Tables There are 90 ponts possble for the regular test, or
More informationWhich of the following provides the most reasonable approximation to the least squares regression line? (a) y=50+10x (b) Y=50+x (d) Y=1+50x
Whch of the followng provdes the most reasonable approxmaton to the least squares regresson lne? (a) y=50+10x (b) Y=50+x (c) Y=10+50x (d) Y=1+50x (e) Y=10+x In smple lnear regresson the model that s begn
More informationFoundations of Machine Learning II TP1: Entropy
Foundatons of Machne Learnng II TP1: Entropy Gullaume Charpat (Teacher) & Gaétan Marceau Caron (Scrbe) Problem 1 (Gbbs nequalty). Let p and q two probablty measures over a fnte alphabet X. Prove that KL(p
More informationTests for Two Correlations
PASS Sample Sze Software Chapter 805 Tests for Two Correlatons Introducton The correlaton coeffcent (or correlaton), ρ, s a popular parameter for descrbng the strength of the assocaton between two varables.
More informationNumerical Analysis ECIV 3306 Chapter 6
The Islamc Unversty o Gaza Faculty o Engneerng Cvl Engneerng Department Numercal Analyss ECIV 3306 Chapter 6 Open Methods & System o Non-lnear Eqs Assocate Pro. Mazen Abualtaye Cvl Engneerng Department,
More informationChapter 3 Descriptive Statistics: Numerical Measures Part B
Sldes Prepared by JOHN S. LOUCKS St. Edward s Unversty Slde 1 Chapter 3 Descrptve Statstcs: Numercal Measures Part B Measures of Dstrbuton Shape, Relatve Locaton, and Detectng Outlers Eploratory Data Analyss
More informationA Comparison of Statistical Methods in Interrupted Time Series Analysis to Estimate an Intervention Effect
Transport and Road Safety (TARS) Research Joanna Wang A Comparson of Statstcal Methods n Interrupted Tme Seres Analyss to Estmate an Interventon Effect Research Fellow at Transport & Road Safety (TARS)
More informationOCR Statistics 1 Working with data. Section 2: Measures of location
OCR Statstcs 1 Workng wth data Secton 2: Measures of locaton Notes and Examples These notes have sub-sectons on: The medan Estmatng the medan from grouped data The mean Estmatng the mean from grouped data
More informationAn annuity is a series of payments made at equal intervals. There are many practical examples of financial transactions involving annuities, such as
2 Annutes An annuty s a seres of payments made at equal ntervals. There are many practcal examples of fnancal transactons nvolvng annutes, such as a car loan beng repad wth equal monthly nstallments a
More informationIntroduction to game theory
Introducton to game theory Lectures n game theory ECON5210, Sprng 2009, Part 1 17.12.2008 G.B. Ashem, ECON5210-1 1 Overvew over lectures 1. Introducton to game theory 2. Modelng nteractve knowledge; equlbrum
More informationMathematical Thinking Exam 1 09 October 2017
Mathematcal Thnkng Exam 1 09 October 2017 Name: Instructons: Be sure to read each problem s drectons. Wrte clearly durng the exam and fully erase or mark out anythng you do not want graded. You may use
More informationChapter 3 Student Lecture Notes 3-1
Chapter 3 Student Lecture otes 3-1 Busness Statstcs: A Decson-Makng Approach 6 th Edton Chapter 3 Descrbng Data Usng umercal Measures 005 Prentce-Hall, Inc. Chap 3-1 Chapter Goals After completng ths chapter,
More informationCofactorisation strategies for the number field sieve and an estimate for the sieving step for factoring 1024-bit integers
Cofactorsaton strateges for the number feld seve and an estmate for the sevng step for factorng 1024-bt ntegers Thorsten Klenjung Unversty of Bonn, Department of Mathematcs, Berngstraße 1, D-53115 Bonn,
More informationInternational ejournals
Avalable onlne at www.nternatonalejournals.com ISSN 0976 1411 Internatonal ejournals Internatonal ejournal of Mathematcs and Engneerng 7 (010) 86-95 MODELING AND PREDICTING URBAN MALE POPULATION OF BANGLADESH:
More informationRandom Variables. b 2.
Random Varables Generally the object of an nvestgators nterest s not necessarly the acton n the sample space but rather some functon of t. Techncally a real valued functon or mappng whose doman s the sample
More informationLikelihood Fits. Craig Blocker Brandeis August 23, 2004
Lkelhood Fts Crag Blocker Brandes August 23, 2004 Outlne I. What s the queston? II. Lkelhood Bascs III. Mathematcal Propertes IV. Uncertantes on Parameters V. Mscellaneous VI. Goodness of Ft VII. Comparson
More information4. Greek Letters, Value-at-Risk
4 Greek Letters, Value-at-Rsk 4 Value-at-Rsk (Hull s, Chapter 8) Math443 W08, HM Zhu Outlne (Hull, Chap 8) What s Value at Rsk (VaR)? Hstorcal smulatons Monte Carlo smulatons Model based approach Varance-covarance
More informationOn estimating the location parameter of the selected exponential population under the LINEX loss function
On estmatng the locaton parameter of the selected exponental populaton under the LINEX loss functon Mohd. Arshad 1 and Omer Abdalghan Department of Statstcs and Operatons Research Algarh Muslm Unversty,
More informationNew Distance Measures on Dual Hesitant Fuzzy Sets and Their Application in Pattern Recognition
Journal of Artfcal Intellgence Practce (206) : 8-3 Clausus Scentfc Press, Canada New Dstance Measures on Dual Hestant Fuzzy Sets and Ther Applcaton n Pattern Recognton L Xn a, Zhang Xaohong* b College
More informationarxiv:cond-mat/ v1 [cond-mat.other] 28 Nov 2004
arxv:cond-mat/0411699v1 [cond-mat.other] 28 Nov 2004 Estmatng Probabltes of Default for Low Default Portfolos Katja Pluto and Drk Tasche November 23, 2004 Abstract For credt rsk management purposes n general,
More informationTests for Two Ordered Categorical Variables
Chapter 253 Tests for Two Ordered Categorcal Varables Introducton Ths module computes power and sample sze for tests of ordered categorcal data such as Lkert scale data. Assumng proportonal odds, such
More informationCHAPTER 9 FUNCTIONAL FORMS OF REGRESSION MODELS
CHAPTER 9 FUNCTIONAL FORMS OF REGRESSION MODELS QUESTIONS 9.1. (a) In a log-log model the dependent and all explanatory varables are n the logarthmc form. (b) In the log-ln model the dependent varable
More informationCreating a zero coupon curve by bootstrapping with cubic splines.
MMA 708 Analytcal Fnance II Creatng a zero coupon curve by bootstrappng wth cubc splnes. erg Gryshkevych Professor: Jan R. M. Röman 0.2.200 Dvson of Appled Mathematcs chool of Educaton, Culture and Communcaton
More informationLinear Combinations of Random Variables and Sampling (100 points)
Economcs 30330: Statstcs for Economcs Problem Set 6 Unversty of Notre Dame Instructor: Julo Garín Sprng 2012 Lnear Combnatons of Random Varables and Samplng 100 ponts 1. Four-part problem. Go get some
More informationOn the Moments of the Traces of Unitary and Orthogonal Random Matrices
Proceedngs of Insttute of Mathematcs of NAS of Ukrane 2004 Vol. 50 Part 3 1207 1213 On the Moments of the Traces of Untary and Orthogonal Random Matrces Vladmr VASILCHU B. Verkn Insttute for Low Temperature
More informationInterval Estimation for a Linear Function of. Variances of Nonnormal Distributions. that Utilize the Kurtosis
Appled Mathematcal Scences, Vol. 7, 013, no. 99, 4909-4918 HIKARI Ltd, www.m-hkar.com http://dx.do.org/10.1988/ams.013.37366 Interval Estmaton for a Lnear Functon of Varances of Nonnormal Dstrbutons that
More informationSurvey of Math Test #3 Practice Questions Page 1 of 5
Test #3 Practce Questons Page 1 of 5 You wll be able to use a calculator, and wll have to use one to answer some questons. Informaton Provded on Test: Smple Interest: Compound Interest: Deprecaton: A =
More informationScribe: Chris Berlind Date: Feb 1, 2010
CS/CNS/EE 253: Advanced Topcs n Machne Learnng Topc: Dealng wth Partal Feedback #2 Lecturer: Danel Golovn Scrbe: Chrs Berlnd Date: Feb 1, 2010 8.1 Revew In the prevous lecture we began lookng at algorthms
More informationUNIVERSITY OF VICTORIA Midterm June 6, 2018 Solutions
UIVERSITY OF VICTORIA Mdterm June 6, 08 Solutons Econ 45 Summer A0 08 age AME: STUDET UMBER: V00 Course ame & o. Descrptve Statstcs and robablty Economcs 45 Secton(s) A0 CR: 3067 Instructor: Betty Johnson
More information2) In the medium-run/long-run, a decrease in the budget deficit will produce:
4.02 Quz 2 Solutons Fall 2004 Multple-Choce Questons ) Consder the wage-settng and prce-settng equatons we studed n class. Suppose the markup, µ, equals 0.25, and F(u,z) = -u. What s the natural rate of
More informationSpatial Variations in Covariates on Marriage and Marital Fertility: Geographically Weighted Regression Analyses in Japan
Spatal Varatons n Covarates on Marrage and Martal Fertlty: Geographcally Weghted Regresson Analyses n Japan Kenj Kamata (Natonal Insttute of Populaton and Socal Securty Research) Abstract (134) To understand
More informationECONOMETRICS - FINAL EXAM, 3rd YEAR (GECO & GADE)
ECONOMETRICS - FINAL EXAM, 3rd YEAR (GECO & GADE) May 17, 2016 15:30 Frst famly name: Name: DNI/ID: Moble: Second famly Name: GECO/GADE: Instructor: E-mal: Queston 1 A B C Blank Queston 2 A B C Blank Queston
More informationOptimal VaR-based Risk Management with Reinsurance
manuscrpt No. (wll be nserted by the edtor) Optmal VaR-based Rsk Management wth Rensurance Janfa Cong Ken Seng Tan Receved: date / Accepted: date Abstract It s well-known that rensurance can be an effectve
More informationDependent jump processes with coupled Lévy measures
Dependent jump processes wth coupled Lévy measures Naoufel El-Bachr ICMA Centre, Unversty of Readng May 6, 2008 ICMA Centre Dscusson Papers n Fnance DP2008-3 Copyrght 2008 El-Bachr. All rghts reserved.
More informationCentre for International Capital Markets
Centre for Internatonal Captal Markets Dscusson Papers ISSN 1749-3412 Valung Amercan Style Dervatves by Least Squares Methods Maro Cerrato No 2007-13 Valung Amercan Style Dervatves by Least Squares Methods
More informationExplaining Movements of the Labor Share in the Korean Economy: Factor Substitution, Markups and Bargaining Power
Explanng Movements of the abor Share n the Korean Economy: Factor Substtuton, Markups and Barganng ower Bae-Geun, Km January 2, 26 Appendx A. Dervaton of the dervatve of et us start from eq. (). For notatonal
More informationGames and Decisions. Part I: Basic Theorems. Contents. 1 Introduction. Jane Yuxin Wang. 1 Introduction 1. 2 Two-player Games 2
Games and Decsons Part I: Basc Theorems Jane Yuxn Wang Contents 1 Introducton 1 2 Two-player Games 2 2.1 Zero-sum Games................................ 3 2.1.1 Pure Strateges.............................
More informationISyE 512 Chapter 9. CUSUM and EWMA Control Charts. Instructor: Prof. Kaibo Liu. Department of Industrial and Systems Engineering UW-Madison
ISyE 512 hapter 9 USUM and EWMA ontrol harts Instructor: Prof. Kabo Lu Department of Industral and Systems Engneerng UW-Madson Emal: klu8@wsc.edu Offce: Room 317 (Mechancal Engneerng Buldng) ISyE 512 Instructor:
More informationSOCIETY OF ACTUARIES FINANCIAL MATHEMATICS. EXAM FM SAMPLE SOLUTIONS Interest Theory
SOCIETY OF ACTUARIES EXAM FM FINANCIAL MATHEMATICS EXAM FM SAMPLE SOLUTIONS Interest Theory Ths page ndcates changes made to Study Note FM-09-05. January 14, 014: Questons and solutons 58 60 were added.
More informationRobust Stochastic Lot-Sizing by Means of Histograms
Robust Stochastc Lot-Szng by Means of Hstograms Abstract Tradtonal approaches n nventory control frst estmate the demand dstrbuton among a predefned famly of dstrbutons based on data fttng of hstorcal
More informationA Bootstrap Confidence Limit for Process Capability Indices
A ootstrap Confdence Lmt for Process Capablty Indces YANG Janfeng School of usness, Zhengzhou Unversty, P.R.Chna, 450001 Abstract The process capablty ndces are wdely used by qualty professonals as an
More informationChapter 5 Student Lecture Notes 5-1
Chapter 5 Student Lecture Notes 5-1 Basc Busness Statstcs (9 th Edton) Chapter 5 Some Important Dscrete Probablty Dstrbutons 004 Prentce-Hall, Inc. Chap 5-1 Chapter Topcs The Probablty Dstrbuton of a Dscrete
More informationASSESSING GOODNESS OF FIT OF GENERALIZED LINEAR MODELS TO SPARSE DATA USING HIGHER ORDER MOMENT CORRECTIONS
ASSESSING GOODNESS OF FIT OF GENERALIZED LINEAR MODELS TO SPARSE DATA USING HIGHER ORDER MOMENT CORRECTIONS S. R. PAUL Department of Mathematcs & Statstcs, Unversty of Wndsor, Wndsor, ON N9B 3P4, Canada
More informationAn Application of Alternative Weighting Matrix Collapsing Approaches for Improving Sample Estimates
Secton on Survey Research Methods An Applcaton of Alternatve Weghtng Matrx Collapsng Approaches for Improvng Sample Estmates Lnda Tompkns 1, Jay J. Km 2 1 Centers for Dsease Control and Preventon, atonal
More informationElton, Gruber, Brown, and Goetzmann. Modern Portfolio Theory and Investment Analysis, 7th Edition. Solutions to Text Problems: Chapter 9
Elton, Gruber, Brown, and Goetzmann Modern Portfolo Theory and Investment Analyss, 7th Edton Solutons to Text Problems: Chapter 9 Chapter 9: Problem In the table below, gven that the rskless rate equals
More informationNonlinear Monte Carlo Methods. From American Options to Fully Nonlinear PDEs
: From Amercan Optons to Fully Nonlnear PDEs Ecole Polytechnque Pars PDEs and Fnance Workshop KTH, Stockholm, August 20-23, 2007 Outlne 1 Monte Carlo Methods for Amercan Optons 2 3 4 Outlne 1 Monte Carlo
More informationConsumption Based Asset Pricing
Consumpton Based Asset Prcng Mchael Bar Aprl 25, 208 Contents Introducton 2 Model 2. Prcng rsk-free asset............................... 3 2.2 Prcng rsky assets................................ 4 2.3 Bubbles......................................
More informationNotes on experimental uncertainties and their propagation
Ed Eyler 003 otes on epermental uncertantes and ther propagaton These notes are not ntended as a complete set of lecture notes, but nstead as an enumeraton of some of the key statstcal deas needed to obtan
More informationA Globally and Superlinearly Convergent Primal-dual Interior Point Method for General Constrained Optimization
Numer. Math. Theor. Meth. Appl. Vol. 8, No. 3, pp. 313-335 do: 10.4208/nmtma.2015.m1338 August 2015 A Globally and Superlnearly Convergent Prmal-dual Interor Pont Method for General Constraned Optmzaton
More informationQuadratic Games. First version: February 24, 2017 This version: December 12, Abstract
Quadratc Games Ncolas S. Lambert Gorgo Martn Mchael Ostrovsky Frst verson: February 24, 2017 Ths verson: December 12, 2017 Abstract We study general quadratc games wth mult-dmensonal actons, stochastc
More informationCOMPARISON OF THE ANALYTICAL AND NUMERICAL SOLUTION OF A ONE-DIMENSIONAL NON-STATIONARY COOLING PROBLEM. László Könözsy 1, Mátyás Benke 2
COMPARISON OF THE ANALYTICAL AND NUMERICAL SOLUTION OF A ONE-DIMENSIONAL NON-STATIONARY COOLING PROBLEM László Könözsy 1, Mátyás Benke Ph.D. Student 1, Unversty Student Unversty of Mskolc, Department of
More informationarxiv: v2 [math.co] 6 Apr 2016
On the number of equvalence classes of nvertble Boolean functons under acton of permutaton of varables on doman and range arxv:1603.04386v2 [math.co] 6 Apr 2016 Marko Carć and Modrag Žvkovć Abstract. Let
More informationoccurrence of a larger storm than our culvert or bridge is barely capable of handling? (what is The main question is: What is the possibility of
Module 8: Probablty and Statstcal Methods n Water Resources Engneerng Bob Ptt Unversty of Alabama Tuscaloosa, AL Flow data are avalable from numerous USGS operated flow recordng statons. Data s usually
More informationBayesian Budget Feasibility with Posted Pricing
Bayesan Budget Feasblty wth Posted Prcng Erc Balkansk Harvard Unversty School of Engneerng and Appled Scences ercbalkansk@g.harvard.edu Jason D. Hartlne Northwestern Unversty EECS Department hartlne@eecs.northwestern.edu
More informationFast Laplacian Solvers by Sparsification
Spectral Graph Theory Lecture 19 Fast Laplacan Solvers by Sparsfcaton Danel A. Spelman November 9, 2015 Dsclamer These notes are not necessarly an accurate representaton of what happened n class. The notes
More informationRisk and Return: The Security Markets Line
FIN 614 Rsk and Return 3: Markets Professor Robert B.H. Hauswald Kogod School of Busness, AU 1/25/2011 Rsk and Return: Markets Robert B.H. Hauswald 1 Rsk and Return: The Securty Markets Lne From securtes
More informationA Unified Distributed Algorithm for Non-Games Non-cooperative, Non-convex, and Non-differentiable. Jong-Shi Pang and Meisam Razaviyayn.
A Unfed Dstrbuted Algorthm for Non-Games Non-cooperatve, Non-convex, and Non-dfferentable Jong-Sh Pang and Mesam Razavyayn presented at Workshop on Optmzaton for Modern Computaton Pekng Unversty, Bejng,
More informationPREFERENCE DOMAINS AND THE MONOTONICITY OF CONDORCET EXTENSIONS
PREFERECE DOMAIS AD THE MOOTOICITY OF CODORCET EXTESIOS PAUL J. HEALY AD MICHAEL PERESS ABSTRACT. An alternatve s a Condorcet wnner f t beats all other alternatves n a parwse majorty vote. A socal choce
More informationA Note on Robust Estimation of Repeat Sales Indexes with Serial Correlation in Asset Returns
A Note on Robust Estmaton of Repeat Sales Indexes wth Seral Correlaton n Asset Returns Kathryn Graddy Department of Economcs and Internatonal Busness School Brandes Unversty (kgraddy@brandes.edu) Jonathan
More informationQuadratic Games. First version: February 24, 2017 This version: August 3, Abstract
Quadratc Games Ncolas S. Lambert Gorgo Martn Mchael Ostrovsky Frst verson: February 24, 2017 Ths verson: August 3, 2018 Abstract We study general quadratc games wth multdmensonal actons, stochastc payoff
More information>1 indicates country i has a comparative advantage in production of j; the greater the index, the stronger the advantage. RCA 1 ij
69 APPENDIX 1 RCA Indces In the followng we present some maor RCA ndces reported n the lterature. For addtonal varants and other RCA ndces, Memedovc (1994) and Vollrath (1991) provde more thorough revews.
More informationreferences Chapters on game theory in Mas-Colell, Whinston and Green
Syllabus. Prelmnares. Role of game theory n economcs. Normal and extensve form of a game. Game-tree. Informaton partton. Perfect recall. Perfect and mperfect nformaton. Strategy.. Statc games of complete
More information332 Mathematical Induction Solutions for Chapter 14. for every positive integer n. Proof. We will prove this with mathematical induction.
33 Mathematcal Inducton. Solutons for Chapter. Prove that 3 n n n for every postve nteger n. Proof. We wll prove ths wth mathematcal nducton. Observe that f n, ths statement s, whch s obvously true. Consder
More information