Supplemental Material

Size: px
Start display at page:

Download "Supplemental Material"

Transcription

1 Supplemental Materal Decson Analyss wth Geographcally Varyng Outcomes: Preference Models Illustratve Applcatons Jay Smon, * Crag W. Krkwood, L. Robn Keller Operatons Research, Appendx A. Preferental Independence In decson analyss, specfyng a multattrbute value or utlty functon requres assessments from a decson maker, ths can be dffcult because t requres the determnaton of an n-dmensonal functon. To smplfy ths, researchers have establshed condtons on preferences under whch the form of the value or utlty functon s smplfed. One of these condtons s preferental ndependence. A subset of 1, 2, n, when n 3, s defned to be preferentally ndependent of ts complement f the rank orderng of alternatves wth no uncertanty that have common levels for the complementary attrbutes does not depend on those common levels. If ths property holds for all subsets of 1, 2,, n, then mutual preferental ndependence s sad to hold, n ths case: n V ( z, z,, z ) a v ( z ) 1 2, (A-1) n 1 where v (z ) s called the sngle attrbute value functon over z, a 0 s called the weghtng constant for the th attrbute (Debreu 1960). Gorman (1968) derves several condtons related to mutual preferental ndependence. In partcular, t follows from hs results that f every par of attrbutes s preferentally ndependent of the remanng attrbutes then mutual preferental ndependence holds, or, even more specfcally, f {, +1 } s preferentally ndependent of ts complement for = 1, 2,, n-1, then mutual preferental ndependence holds. These results can substantally reduce the number of assessments that must be made n applcatons to establsh that (A-1) s vald. See Keeney Raffa (1976 Sectons ) for more detals. Appendx B: Addtonal Dscusson of Theorem 1 Let ( at least as preferred as ) be a preference relaton over, whch s the set of possble consequences (where a consequence s a vector of levels across all subregons), wth the correspondng * Defense Resources Management Insttute, Naval Postgraduate School, Monterey, CA 93943, rsmon@nps.edu W. P. Carey School of Busness, Arzona State Unversty, Tempe, A , crag.krkwood@asu.edu The Paul Merage School of Busness, Unversty of Calforna, Irvne, CA , LRKeller@uc.edu S-1

2 strct relaton ( more preferred than ) ndfference relaton ( equally preferred to ). Let q, r, s denote arbtrary vectors n. For z, we defne z as the vector of attrbute levels n all subregons except subregon, z as the vector of attrbute levels n all subregons except subregons. Consder the followng condtons on : (a) Completeness: It must be true that q r or r q. (That s, any consequences can be compared.) (b) Transtvty: If q r r s, then q s. (c) Contnuty: If q r, then there exsts 0 such that for any z, max z q mples z r, max z r mples q z. (d) Dependence on each subregon: For each subregon, there exst q, r, z z. q, z, r z such that (e) Parwse spatal preferental ndependence: For any two subregons, q, q, s r, r, s for some s mples q, q, z r, r, z for all z, z. Ths condton mples mutual preferental ndependence, as descrbed above. Snce the ndependence descrbed here s for a sngle attrbute across multple subregons, t s labeled spatal to dstngush t from preferental ndependence across multple attrbutes, whch s consdered n Theorem 2. DEFINITION A-1. An attrbute level there exst vectors q (f) Homogenety: If vectors q, md z s called a tradeoffs mdvalue of z ' r such that z', q md z, r z md, z'', md z s a tradeoffs mdvalue of z ' r such that z', md z, q r. z '' n subregon f z '' n subregon, then for any subregon q r t must be true that z md, z'', q r. (An equvalent defnton s that when two amounts z, z have a tradeoffs mdvalue n a subregon also n a subregon, then they have the same tradeoffs mdvalue n subregon as n subregon.) A value functon exsts over the set of consequences f only f s complete, transtve, contnuous, as specfed n condtons (a)-(c). (Ths s a specal case of Debreu (1954, 1964), who uses a more general topologcal space.) It follows drectly from Debreu s (1960) theorem that for a regon wth three or more subregons, a value functon can be wrtten as: m V ( z1, z2,, z ) a v ( z ) m 1 f only f condtons (a)-(e) above hold, where v s a sngle attrbute value functon over (A-2) z, a 0 s the weght assocated wth subregon. (A-2) has the same form as (A-1), but the z n (A-2) S-2

3 represent the levels of the same attrbute n dfferent subregons, rather than the levels of dfferent attrbutes 1, 2,, n as n (A-1). Harvey (1986, p. 1126, Condton E) defnes the Equal Tradeoffs Comparsons condton, he notes that a condton that s mathematcally equvalent to homogenety (our condton (f)) s equvalent to hs Equal Tradeoffs Comparsons condton. He then shows (Harvey, 1986, p , proof of Theorem 1) that an ntertemporal analog of (1) s a vald representaton of preferences f only f (A-2) hs condton E hold. Snce hs Condton E s equvalent to our condton (f), that proof also establshes our Theorem 1. Value functons are only determned to wthn a postve monotonc transformaton, so any postve monotonc transformaton of the value functon forms n all of the Theorems Conectures wll also satsfy the specfed condtons. See Keeney Raffa (1976, Secton 3.3.4) Krkwood (1997, Secton 9.2) for further dscusson of ths pont. Wth a stronger condton n place of condton (f), a specal case of equaton (1) holds where vz ( ) s lnear. Consder the stronger condton of tradeoffs neutralty: for any subregon, attrbute levels z * z z z z, vectors q * r, z, z, q r, mples z *, z, q r, where 0.5. Ths condton ensures that sngle-attrbute value functons wll be lnear by the followng argument: Snce tradeoffs neutralty s a specal case of condton (f), equaton (1) stll holds n ths case. By drect substtuton, when tradeoffs neutralty holds, v[0.5 ( z z )] 0.5 [ v( z) v( z )] for any z z. Ths s Jensen s equaton (Small, 2007, Secton 2.3), the soluton s v() z az b for constants a b when vz ( ) s contnuous. (An anonymous revewer provded valuable suggestons that helped us to develop the materal ust presented n ths secton. Ths same revewer also provded many valuable suggestons for the other theorem conecture presentatons n ths supplemental materal.) Appendx C: Addtonal Dscusson of Conecture 1 Let have correspondng strct ndfference relatons as prevously defned, let q, r, s denote arbtrary consequences. Consder the followng condtons on : (a ) Completeness: It must be true that q r or r q. (That s, any consequences can be compared.) (b ) Transtvty: If q r r s, then q s. S-3

4 (c ) Contnuty: If q r, then there exsts 0 such that for any consequence z, xy, qx mples z r, max z x, r x, max z x, y, xy, mples q z. (d ) Dependence on any subregon: For any proper subregon of the regon wth area greater than zero, there exst consequences q r such that qx, = rx, for all xy,, q r. (e ) Spatal preferental ndependence: For any proper subregon of the regon wth area greater than = zero, f there exst consequences q, r, q', r' such that q r, q x, qx, r x, = rx, for all xy,, qx, = rx, qx, rx, xy,, then t must be true that q' r'. = for all DEFINITION A-2. Consder a proper subregon of the regon wth area greater than zero, consder two consequences z( x, y) z ( x, y) attrbute level md z q( x, y) r( x, y) that have constant levels z z, respectvely, wthn P. An s a tradeoffs mdvalue for z z wth respect to P f there exst functons defned outsde P such that the followng two ndfference relatons hold: ) a consequence that s equal to z wthn P equal to q( x, y ) outsde P s ndfferent to a consequence that s equal to md z wthn P equal to r( x, y ) outsde P, ) a consequence that s equal to wthn P equal to q( x, y ) outsde P s ndfferent to a consequence that s equal to z wthn P equal to r( x, y ) outsde P. (f ) Homogenety: If md z s a tradeoffs mdvalue for z z wth respect to a specfed proper subregon P of the regon wth area greater than zero, then t s also a tradeoffs mdvalue for z z wth respect to any other proper subregon for whch a tradeoffs mdvalue for z z exsts. Note that tradeoffs mdvalues are unlkely to exst wth respect to very large subregons, snce the requred q( x, y) r( x, y) md z may not exst for such cases. However, for the purposes of both practcal applcatons possble proofs of Conecture 1, we are concerned only wth subregons whch are small relatve to the entre regon. We present a plausblty argument for why condtons (a ) through (f ) mght mply (3), dscuss where dffcultes arse n the proof. The condtons stated n Conecture 1 are analogous to those used n Theorem 1, (3) s analogous to (1). Condtons (a )-(e ) are straghtforward adaptatons of condtons (a)-(e). (Condton (e ) s analogous to mutual preferental ndependence, rather than parwse preferental ndependence, because n the nondscrete case there are not exstng dscrete subregons wth whch to create pars.) Condton (f ) s analogous to condton (f). where To establsh the plausblty of Conecture 1, start wth (1) defne A s the area (for example, n square mles) of subregon. Then (1) can be rewrtten as a / A n (1), S-4

5 m 1, z2,, zm ) A v( z ) 1 V ( z. (A-3) Snce condtons (a ) through (f ) are analogous to condtons (a) through (f) requred for (1), t s plausble to use (1) as a startng pont for developng (3). Extend (A-3) to an attrbute that vares over the regon as follows: Partton the regon nto a unform grd, where the two dmensons of the grd are desgned by x y, where the x y dmensons of each cell n the grd are desgnated by x y, respectvely, so that the area A of any cell s xy. It s easest to vsualze ths partton f A s rectangular, though the analyss can be extended to any regon that s bounded by a pecewse smooth curve, as establshed n the references gven below. If v z ) dd not vary wthn a grd cell, then f the assumptons for Theorem 1 are assumed to hold, (A-3) can be wrtten as m V ( z1, z,, z ) ( x, y ) v[ z( x, y )] xy, (A-4) where 2 x m 1 y desgnate some specfed but arbtrary pont wthn grd cell, ( x, y ), v z( x, y )] v( z ). Equaton (A-4) has the form of a specal case of a Remann sum of [ ( x, y) v[ z( x, y)] over A, f v are both bounded, then ther product s also bounded. If these functons are contnuous almost everywhere (that s, except on a subset of A wth measure zero), then ( x, y) v[ z( x, y)] s Remann ntegrable over A f the boundary of A s a pecewse smooth curve. (For proofs of ths, see Apostol 1962, Secton 2.12, or Trench 2003, Theorem ) If ( x, y) v[ z( x, y)] s ntegrable, the Remann sum n (A-4) wll converge to a unque value (whch by defnton s the ntegral) as the partton of A s made fner so that m Thus, n the lmt, (A-4) would become ( approaches nfnty both x y approach zero. V( z) ( x, y) v[ z( x, y)] dxdy, (A-5) A where V(z) s the value from a decson-makng perspectve assocated wth the dstrbuton of the attrbute over the regon of nterest. The converse of the model result would follow by drect substtuton from (3). Note that n (3), ( x, y) n (A-5) has been replaced wth a(x, y) to make the notaton more parallel to (1). However, the unts for a n (1) (3) are dfferent. The plausblty argument gven above s not a proof, there are two prmary dffcultes nvolved n provng Conecture 1. The frst s that the partton of the regon used n (1) s fxed, as s the number of subregons. Therefore, we cannot be sure that assessed preferences for dfferent parttons, such as the changng parttons n (A-4) as m ncreases, wll yeld the same sngle-subregon value functon v, hence yeld a sngle common lmt for any possble Remann sum. Ths means t s not defensble to examne the lmt of (1) as m goes to nfnty, because a common lmt of vz ( ) ndependent S-5

6 of the partton s not guaranteed to exst. In the condtons for Conecture 1, we address ths wth the contnuty condton (c ). Ths s meant to guarantee convergence as the partton becomes fner, but we cannot establsh that t does ths n the manner requred for a unque lmt to exst. A second dffculty s establshng that the weghtng functon ax, y s Remann ntegrable. It must be true that v[ z( x, y )] s Remann ntegrable, because z( x, y ) s Remann ntegrable by assumpton, condtons (c ) (d ) ensure that v s contnuous bounded. The weghtng functon must be bounded, otherwse a volaton of condton (d ) would occur. However, t must also be establshed that the weghtng functon s contnuous almost everywhere, t s not clear precsely what condtons on the preference relaton wll guarantee ths. Condton (c ) establshes the contnuty of v, but does not mpose ths property on ax, y. In practcal applcatons, t s dffcult to thnk of a realstc weghtng functon that s not contnuous almost everywhere, but we are unable to prove that condtons (a ) through (f ) establsh ths property. Harvey Østerdal (2011) provde addtonal dscusson of the steps necessary to establsh a result analogous to (3) n the context of contnuous tme decsons. Appendx D: Addtonal Dscusson of Theorem 2 We thank a revewer for pontng out that the result n Theorem 2 can be developed n ether of two ways: By usng results from Gorman (1968) then applyng homogenety condtons, or by applyng preferental ndependence condtons across attrbutes to Harvey s (1995) value model. We use the former approach here. Modfy the notaton presented earler so that n now desgnates the vector of n attrbutes,, 1 2, n subregon (referred to as the attrbute vector for subregon ), the vector, 2 m desgnates 1,, of the th attrbute across the m subregons (referred to as the subregon vector for attrbute ), where z z are vectors of specfc levels of, respectvely. Let have correspondng strct preference ndfference relatons as prevously defned, let q, r, s denote arbtrary consequences. Consder the followng condtons on, whch are analogous to those used n Theorem 1. (a ) Completeness: It must be true that q r or r q. (That s, any consequences can be compared.) (b ) Transtvty: If q r r s, then q s. (c ) Contnuty: If q r, then there exsts 0 such that for any z, z r, max z r mples q z., max z q, mples S-6

7 (d ) Dependence on each attrbute-subregon combnaton: For each subregon attrbute, there exst consequences,, q, z r, z. (e ) Preferental ndependence: q z r z such that 1) Subregon preferental ndependence: For any subregon,,,,, z, q z r z for all 2) Attrbute preferental ndependence: For any attrbute,,,,, q z r z for all z. q s r s for some s mples q s r s for some s mples DEFINITION A-3. Preferences over the regon of nterest wth respect to a set of attrbute vectors,, 1 m for subregons 1,, m are multattrbute homogeneous f, when two alternatves that dffer only n the attrbute levels for a specfed subregon are ndfferent, then the same ndfference relaton holds for those same attrbute levels n any subregon. (In ths defnton, the scalar attrbute for each subregon consdered n Theorem 1 s replaced wth an attrbute vector for each subregon). (f ) Homogenety: s multattrbute homogeneous wth respect to,, 1 m. Condton (f ) plays a role for multple attrbutes smlar to the sngle-attrbute homogenety condton (f) prevously defned for Theorem 1. Condton (f) assumes there s a sngle attrbute that has a tradeoffs mdvalue, but when there are multple attrbutes there s not an unambguous meanng for the tradeoffs mdvalue. Therefore, we express homogenety here consderng levels of multple attrbutes. Conversely, the defnton gven here requres consderatons of tradeoffs between attrbutes, therefore s not applcable to the sngle-attrbute consequences used n Theorem 1. We frst show that condton (e ) mples an addtve form for V( z ). The frst step s to show that the set consstng of any par of attrbute-subregon combnatons s preferentally ndependent of ts complement. Let ac bd represent two such combnatons, where a b are arbtrary dstnct subregons, c d are arbtrary dstnct attrbutes. From condton (e ), each of a, b, c, d s preferentally ndependent of ts complement. From Theorem 1 n Gorman (1968), the unon of a d s preferentally ndependent of ts complement, as s the unon of b c. The ntersecton of these two unons s ac, bd, snce both unons are preferentally ndependent of ther complements, Theorem 1 n Gorman also mples that, must be preferentally ndependent of ts complement. Snce the choces of a, b, c, d were arbtrary, any par of attrbute-subregon combnatons s preferentally ndependent of ts complement for dstnct attrbutes subregons. It s then straghtforward to also use Theorem 1 n Gorman to show that a par of attrbute-subregon combnatons s preferentally ndependent of ts complement n the case where ether the attrbute or the ac bd S-7

8 subregon s common to both combnatons. Hence, from nductve applcaton of Gorman's results, also stated as a Corollary on page 114 of Keeney Raffa (1976), the ndependent, therefore: 1 1 are mutually preferentally m n V ( z) k v ( z ). (A-6) Snce the attrbutes are multattrbute homogeneous by condton (f ), t follows from an analogous argument to the one gven n the proof of Theorem 1 that sngle-attrbute value functons depend on the subregon, hence the followng equaton holds n ths case: 1 1 v cannot m n V( z) k v ( z ). (A-7) To show that k a b, hence (4) holds, frst assume wthout loss of generalty that the subregons attrbutes are labeled so that the largest scalng constant s k 11. Consder two hypothetcal alternatves: 1) all the attrbute-subregon combnatons except 11 1 are set to arbtrary levels, 11 s set to ts least preferred level so that v 1 ( z 11 ) 0 n (A-7), 1 s set to ts most preferred level so that v ( z 1 ) 1, 2) another hypothetcal alternatve wth all the attrbute-subregon combnatons except 11 1 set to the same arbtrary levels as the frst alternatve, level so v ( z 1 ) 0, 11 set to the level 1 set to ts least preferred z 11 such that the two alternatves are equally preferred. Then equatng the values for each of these two alternatves calculated usng (A-7) cancellng common terms results n ( for any 1. However, by condton (f ), f ths equaton holds for k11 v1 z11) k1 subregon 1, then the same level z 11 must make the analogous equaton true for any subregon, hence k 1 v 1 ( z 11 ) k for any. Defne b v 1 ( z 11 ) a k 1. Substtutng these defntons nto k 1 v 1 ( z 11 ) k gves k ab. Substtute ths nto (A-7), (4) follows. The converse of the model result follows by drect substtuton from (4). Appendx E: Addtonal Dscusson of Conecture 2 Let have correspondng strct ndfference relatons as prevously defned, let q, r, s denote arbtrary consequences. Let for all xy, n the regon. Let z desgnate a Remann ntegrable functon such that, z z x y I z be defned as prevously. As n Conecture 1, assume that the boundary of the regon s a pecewse smooth curve. Consder the followng condtons on, whch are analogous to those used n Theorem 2: (a ) Completeness: It must be true that q r or r q. (That s, any consequences can be compared.) (b ) Transtvty: If q r r s, then q s. S-8

9 (c ) Contnuty: If q r, then there exsts 0 such that for any consequence z, x, y, mples z r, max z x, r x, max z x, y q x, y x, y, mples q z. (d ) Dependence on any attrbute n any subregon: For any attrbute proper subregon of the regon wth area greater than zero, there exst consequences q r such that x, x, xy,, q x, = r x, for all xy,, q r. (e ) Preferental ndependence: q = r for all 1) Spatal preferental ndependence: For any proper subregon of the regon wth area greater than zero, f there exst consequences q, r, q', r' such that q r, x, x, r x, = r x, for all xy,, q x, = r x, x, x, xy,, then t must be true that q' r'. q = q q = r for all 2) Parwse attrbute preferental ndependence: For any two attrbutes, q, q, r, r, s s for some s mples q, q, r, r, z z for all DEFINITION A-4. Consder a proper subregon of the regon wth area greater than zero, consder two consequences q r. Preferences over the regon are contnuously multattrbute homogeneous f q r, q( x, y) r ( x, y) for ( x, y) P ( x, y) q1,, q n r ( x, y) r1,, r n for ( x, y) P where q,, 1 q n r 1,, r n are constants mples that for any consequences z z subregon such that z( x, y) z ( x, y) for ( x, y) P, z ( x, y) q1,, q n z ( x, y) r1,, r n for ( x, y) P then z z. z., q (f ) Homogenety: s contnuously multattrbute homogeneous over the regon. The development of Conecture 2 from Theorem 2 s analogous to the development of Conecture 1 from Theorem 1. A smlar plausblty argument can be gven for Conecture 2, n whch a Remann sum analogous to equaton (A-4) s developed. A further development analogous to the Conecture 1 reasonng leads to (5), drect substtuton from (5) yelds the converse of the result. However, analogous dffcultes to those nvolved n provng Conecture 1 arse here as well. Appendx F: Extensons of the Preference Models to Address Uncertanty In ths Appendx, we examne the case n whch the consequences of alternatves are uncertan. We assume that probabltes can be assgned to the possble consequences of each alternatve, we wsh to rank alternatves by ther overall desrablty usng ther expected utlty, computed as the expected value of a sngle attrbute (or multattrbute) utlty functon. The preference condtons n Secton 3 can be extended to decsons under uncertanty to determne the requrements for an addtve utlty functon. The S-9

10 prmary dfference s that the preferental ndependence condton dscussed n Secton 3 must be replaced by a consderably stronger condton called addtve ndependence. DEFINITION A-5. Addtve ndependence wth respect to over the regon of nterest holds f the rank orderng for any set of alternatves depends only on the margnal probablty dstrbutons for each alternatve over the levels z 1, z 2,, z m of n each of the subregons 1,..., m. We frst consder the case analogous to Theorem 1, n whch the level for the sngle attrbute does not vary wthn each subregon, then consder the nondscrete case analogous to Conecture 1. In decson problems wth uncertanty, we maxmze expected utlty usng a utlty functon nstead of maxmzng a value functon. It s straghtforward to show that utlty s gven by m U( z, z,, z ) a u( z ) 1 2 (A-8) m 1 f only f addtve ndependence s satsfed, condtons analogous to (a)-(d) (f) n Appendx B are met (Fshburn 1965). See Keeney Raffa (1976, Sectons , pp ) Krkwood (1997, pp ) for further background, ncludng assessment procedures for utlty functons. Analogously to Conecture 1, we conecture that t s possble to extend (A-8) to stuatons where the sngle attrbute s defned at any locaton ( xy, ) wthn the regon of nterest. The correspondng utlty functon s gven by: U( z) a( x, y) u[ z( x, y)] dxdy (A-9) A f only f addtve ndependence, condtons analogous to (a )-(d ) (f ) n Appendx C are met. Wth these condtons, a plausblty argument for equaton (A-9) can be obtaned usng reasonng analogous to the dscusson n Appendx C. However, as n Conecture 1, ths plausblty argument would not consttute a proof. Results analogous to Theorem 2 Conecture 2, wth a multple attrbute utlty functon analogous assumptons can also be specfed. The requred preference assumptons for an addtve utlty functon are strong, however, may not be approprate n some decson stuatons. One possble approach to developng more general utlty functon forms wth less restrctve requrements would be to construct the utlty functon over the value functons that were developed n Secton 3 usng methods such as those presented by Dyer Sarn (1982) Matheson Abbas (2005). If the condtons needed for a value functon of the form gven n (1) hold, then n the case wth dscrete subregons, a utlty functon U could be constructed over the value functon n (1) wth the form: S-10

11 m U V ( z1, z2,, zm) U av( z ) (A-10) 1 Smlarly, n the nondscrete case, the utlty functon could be constructed over the value functon n (3) wth the form: U V ( z) U a( x, y) v[ z( x, y)] dxdy A (A-11) These are less restrctve than (A-8) (A-9) n that they have unspecfed utlty functons U, hence requre less restrctve preference condtons than (A-8) or (A-9). Stard utlty functon assessment procedures can be modfed to determne U. For example, a possble approach for assessng ths utlty functon s to dentfy the potental decson consequences wth the hghest lowest possble values, vsualze a hypothetcal bnary gamble between them wth probablty p of the hghest-value consequence occurrng probablty 1-p of the lowest-value consequence occurrng. The utlty of the value placed on a specfed consequence could then be determned by fndng the value of p for whch the decson maker s ndfferent between the specfed consequence the gamble. By equatng expected utltes, the assessed p would be the utlty assocated wth the specfed consequence. Addtonal References See references lst n the man paper. Apostol TM (1962) Calculus, Volume II: Calculus of Several Varables wth Applcatons to Probablty Vector Analyss (Blasdell Publshng Company, New York). Debreu G (1960) Topologcal methods n cardnal utlty theory. In Arrow LJ, Karln S, Suppes P (eds.), Mathematcal Methods n the Socal Scences, 1959, (Stanford Unversty Press, Stanford, CA, 1960), pp Downloaded from on Nov. 29, Dyer JS, Sarn RK (1982) Relatve rsk averson. Management Scence 28(8): Fshburn, PC (1965) Independence n utlty theory wth whole product sets. Oper. Res. 13(1): Harvey CM, Østerdal LP (2011) Integral utlty models for outcomes over contnuous tme. Workng paper. Cted wth permsson of the authors. Matheson JE, Abbas AE (2005) Utlty transversalty: A value-based approach. J. Mult-Crtera Decson Anal. 13(5-6): S-11

12 Small CG (2007) Functonal Equatons How to Solve Them (Sprnger Scence+Busness Meda, New York). Trench WF (2003) Introducton to Real Analyss (Pearson Educaton. Upper Saddle Rver, NJ). Free Edton Downloaded on from S-12

e companion ONLY AVAILABLE IN ELECTRONIC FORM

e companion ONLY AVAILABLE IN ELECTRONIC FORM e copanon ONLY AVAILABLE IN ELECTRONIC FORM Electronc Copanon Decson Analyss wth Geographcally Varyng Outcoes: Preference Models Illustratve Applcatons by Jay Son, Crag W. Krkwood, L. Robn Keller, Operatons

More information

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number

More information

More metrics on cartesian products

More metrics on cartesian products More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of

More information

Structure and Drive Paul A. Jensen Copyright July 20, 2003

Structure and Drive Paul A. Jensen Copyright July 20, 2003 Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.

More information

The Order Relation and Trace Inequalities for. Hermitian Operators

The Order Relation and Trace Inequalities for. Hermitian Operators Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence

More information

Problem Set 9 Solutions

Problem Set 9 Solutions Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem

More information

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could

More information

Lecture 12: Discrete Laplacian

Lecture 12: Discrete Laplacian Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly

More information

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,

More information

The Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction

The Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction ECONOMICS 5* -- NOTE (Summary) ECON 5* -- NOTE The Multple Classcal Lnear Regresson Model (CLRM): Specfcaton and Assumptons. Introducton CLRM stands for the Classcal Lnear Regresson Model. The CLRM s also

More information

princeton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg

princeton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there

More information

Linear Approximation with Regularization and Moving Least Squares

Linear Approximation with Regularization and Moving Least Squares Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...

More information

Maximizing the number of nonnegative subsets

Maximizing the number of nonnegative subsets Maxmzng the number of nonnegatve subsets Noga Alon Hao Huang December 1, 213 Abstract Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what s the maxmum

More information

Games of Threats. Elon Kohlberg Abraham Neyman. Working Paper

Games of Threats. Elon Kohlberg Abraham Neyman. Working Paper Games of Threats Elon Kohlberg Abraham Neyman Workng Paper 18-023 Games of Threats Elon Kohlberg Harvard Busness School Abraham Neyman The Hebrew Unversty of Jerusalem Workng Paper 18-023 Copyrght 2017

More information

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:

More information

SL n (F ) Equals its Own Derived Group

SL n (F ) Equals its Own Derived Group Internatonal Journal of Algebra, Vol. 2, 2008, no. 12, 585-594 SL n (F ) Equals ts Own Derved Group Jorge Macel BMCC-The Cty Unversty of New York, CUNY 199 Chambers street, New York, NY 10007, USA macel@cms.nyu.edu

More information

ELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM

ELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM ELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM An elastc wave s a deformaton of the body that travels throughout the body n all drectons. We can examne the deformaton over a perod of tme by fxng our look

More information

APPENDIX A Some Linear Algebra

APPENDIX A Some Linear Algebra APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,

More information

LECTURE 9 CANONICAL CORRELATION ANALYSIS

LECTURE 9 CANONICAL CORRELATION ANALYSIS LECURE 9 CANONICAL CORRELAION ANALYSIS Introducton he concept of canoncal correlaton arses when we want to quantfy the assocatons between two sets of varables. For example, suppose that the frst set of

More information

Kernel Methods and SVMs Extension

Kernel Methods and SVMs Extension Kernel Methods and SVMs Extenson The purpose of ths document s to revew materal covered n Machne Learnng 1 Supervsed Learnng regardng support vector machnes (SVMs). Ths document also provdes a general

More information

Difference Equations

Difference Equations Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1

More information

Appendix B. Criterion of Riemann-Stieltjes Integrability

Appendix B. Criterion of Riemann-Stieltjes Integrability Appendx B. Crteron of Remann-Steltes Integrablty Ths note s complementary to [R, Ch. 6] and [T, Sec. 3.5]. The man result of ths note s Theorem B.3, whch provdes the necessary and suffcent condtons for

More information

The Second Anti-Mathima on Game Theory

The Second Anti-Mathima on Game Theory The Second Ant-Mathma on Game Theory Ath. Kehagas December 1 2006 1 Introducton In ths note we wll examne the noton of game equlbrum for three types of games 1. 2-player 2-acton zero-sum games 2. 2-player

More information

Limited Dependent Variables

Limited Dependent Variables Lmted Dependent Varables. What f the left-hand sde varable s not a contnuous thng spread from mnus nfnty to plus nfnty? That s, gven a model = f (, β, ε, where a. s bounded below at zero, such as wages

More information

Stanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011

Stanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011 Stanford Unversty CS359G: Graph Parttonng and Expanders Handout 4 Luca Trevsan January 3, 0 Lecture 4 In whch we prove the dffcult drecton of Cheeger s nequalty. As n the past lectures, consder an undrected

More information

A new construction of 3-separable matrices via an improved decoding of Macula s construction

A new construction of 3-separable matrices via an improved decoding of Macula s construction Dscrete Optmzaton 5 008 700 704 Contents lsts avalable at ScenceDrect Dscrete Optmzaton journal homepage: wwwelsevercom/locate/dsopt A new constructon of 3-separable matrces va an mproved decodng of Macula

More information

Econ107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)

Econ107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4) I. Classcal Assumptons Econ7 Appled Econometrcs Topc 3: Classcal Model (Studenmund, Chapter 4) We have defned OLS and studed some algebrac propertes of OLS. In ths topc we wll study statstcal propertes

More information

Convexity preserving interpolation by splines of arbitrary degree

Convexity preserving interpolation by splines of arbitrary degree Computer Scence Journal of Moldova, vol.18, no.1(52), 2010 Convexty preservng nterpolaton by splnes of arbtrary degree Igor Verlan Abstract In the present paper an algorthm of C 2 nterpolaton of dscrete

More information

The internal structure of natural numbers and one method for the definition of large prime numbers

The internal structure of natural numbers and one method for the definition of large prime numbers The nternal structure of natural numbers and one method for the defnton of large prme numbers Emmanul Manousos APM Insttute for the Advancement of Physcs and Mathematcs 3 Poulou str. 53 Athens Greece Abstract

More information

Appendix for Causal Interaction in Factorial Experiments: Application to Conjoint Analysis

Appendix for Causal Interaction in Factorial Experiments: Application to Conjoint Analysis A Appendx for Causal Interacton n Factoral Experments: Applcaton to Conjont Analyss Mathematcal Appendx: Proofs of Theorems A. Lemmas Below, we descrbe all the lemmas, whch are used to prove the man theorems

More information

4 Analysis of Variance (ANOVA) 5 ANOVA. 5.1 Introduction. 5.2 Fixed Effects ANOVA

4 Analysis of Variance (ANOVA) 5 ANOVA. 5.1 Introduction. 5.2 Fixed Effects ANOVA 4 Analyss of Varance (ANOVA) 5 ANOVA 51 Introducton ANOVA ANOVA s a way to estmate and test the means of multple populatons We wll start wth one-way ANOVA If the populatons ncluded n the study are selected

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 12 10/21/2013. Martingale Concentration Inequalities and Applications

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 12 10/21/2013. Martingale Concentration Inequalities and Applications MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.65/15.070J Fall 013 Lecture 1 10/1/013 Martngale Concentraton Inequaltes and Applcatons Content. 1. Exponental concentraton for martngales wth bounded ncrements.

More information

CSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography

CSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography CSc 6974 and ECSE 6966 Math. Tech. for Vson, Graphcs and Robotcs Lecture 21, Aprl 17, 2006 Estmatng A Plane Homography Overvew We contnue wth a dscusson of the major ssues, usng estmaton of plane projectve

More information

Using T.O.M to Estimate Parameter of distributions that have not Single Exponential Family

Using T.O.M to Estimate Parameter of distributions that have not Single Exponential Family IOSR Journal of Mathematcs IOSR-JM) ISSN: 2278-5728. Volume 3, Issue 3 Sep-Oct. 202), PP 44-48 www.osrjournals.org Usng T.O.M to Estmate Parameter of dstrbutons that have not Sngle Exponental Famly Jubran

More information

χ x B E (c) Figure 2.1.1: (a) a material particle in a body, (b) a place in space, (c) a configuration of the body

χ x B E (c) Figure 2.1.1: (a) a material particle in a body, (b) a place in space, (c) a configuration of the body Secton.. Moton.. The Materal Body and Moton hyscal materals n the real world are modeled usng an abstract mathematcal entty called a body. Ths body conssts of an nfnte number of materal partcles. Shown

More information

Yong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 )

Yong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 ) Kangweon-Kyungk Math. Jour. 4 1996), No. 1, pp. 7 16 AN ITERATIVE ROW-ACTION METHOD FOR MULTICOMMODITY TRANSPORTATION PROBLEMS Yong Joon Ryang Abstract. The optmzaton problems wth quadratc constrants often

More information

Online Appendix. t=1 (p t w)q t. Then the first order condition shows that

Online Appendix. t=1 (p t w)q t. Then the first order condition shows that Artcle forthcomng to ; manuscrpt no (Please, provde the manuscrpt number!) 1 Onlne Appendx Appendx E: Proofs Proof of Proposton 1 Frst we derve the equlbrum when the manufacturer does not vertcally ntegrate

More information

n α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0

n α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0 MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector

More information

Psychology 282 Lecture #24 Outline Regression Diagnostics: Outliers

Psychology 282 Lecture #24 Outline Regression Diagnostics: Outliers Psychology 282 Lecture #24 Outlne Regresson Dagnostcs: Outlers In an earler lecture we studed the statstcal assumptons underlyng the regresson model, ncludng the followng ponts: Formal statement of assumptons.

More information

THE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens

THE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens THE CHINESE REMAINDER THEOREM KEITH CONRAD We should thank the Chnese for ther wonderful remander theorem. Glenn Stevens 1. Introducton The Chnese remander theorem says we can unquely solve any par of

More information

COMPLEX NUMBERS AND QUADRATIC EQUATIONS

COMPLEX NUMBERS AND QUADRATIC EQUATIONS COMPLEX NUMBERS AND QUADRATIC EQUATIONS INTRODUCTION We know that x 0 for all x R e the square of a real number (whether postve, negatve or ero) s non-negatve Hence the equatons x, x, x + 7 0 etc are not

More information

ANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U)

ANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U) Econ 413 Exam 13 H ANSWERS Settet er nndelt 9 deloppgaver, A,B,C, som alle anbefales å telle lkt for å gøre det ltt lettere å stå. Svar er gtt . Unfortunately, there s a prntng error n the hnt of

More information

Affine transformations and convexity

Affine transformations and convexity Affne transformatons and convexty The purpose of ths document s to prove some basc propertes of affne transformatons nvolvng convex sets. Here are a few onlne references for background nformaton: http://math.ucr.edu/

More information

FREQUENCY DISTRIBUTIONS Page 1 of The idea of a frequency distribution for sets of observations will be introduced,

FREQUENCY DISTRIBUTIONS Page 1 of The idea of a frequency distribution for sets of observations will be introduced, FREQUENCY DISTRIBUTIONS Page 1 of 6 I. Introducton 1. The dea of a frequency dstrbuton for sets of observatons wll be ntroduced, together wth some of the mechancs for constructng dstrbutons of data. Then

More information

= z 20 z n. (k 20) + 4 z k = 4

= z 20 z n. (k 20) + 4 z k = 4 Problem Set #7 solutons 7.2.. (a Fnd the coeffcent of z k n (z + z 5 + z 6 + z 7 + 5, k 20. We use the known seres expanson ( n+l ( z l l z n below: (z + z 5 + z 6 + z 7 + 5 (z 5 ( + z + z 2 + z + 5 5

More information

An efficient algorithm for multivariate Maclaurin Newton transformation

An efficient algorithm for multivariate Maclaurin Newton transformation Annales UMCS Informatca AI VIII, 2 2008) 5 14 DOI: 10.2478/v10065-008-0020-6 An effcent algorthm for multvarate Maclaurn Newton transformaton Joanna Kapusta Insttute of Mathematcs and Computer Scence,

More information

Random Walks on Digraphs

Random Walks on Digraphs Random Walks on Dgraphs J. J. P. Veerman October 23, 27 Introducton Let V = {, n} be a vertex set and S a non-negatve row-stochastc matrx (.e. rows sum to ). V and S defne a dgraph G = G(V, S) and a drected

More information

Module 2. Random Processes. Version 2 ECE IIT, Kharagpur

Module 2. Random Processes. Version 2 ECE IIT, Kharagpur Module Random Processes Lesson 6 Functons of Random Varables After readng ths lesson, ou wll learn about cdf of functon of a random varable. Formula for determnng the pdf of a random varable. Let, X be

More information

Physics 5153 Classical Mechanics. D Alembert s Principle and The Lagrangian-1

Physics 5153 Classical Mechanics. D Alembert s Principle and The Lagrangian-1 P. Guterrez Physcs 5153 Classcal Mechancs D Alembert s Prncple and The Lagrangan 1 Introducton The prncple of vrtual work provdes a method of solvng problems of statc equlbrum wthout havng to consder the

More information

Lecture 17 : Stochastic Processes II

Lecture 17 : Stochastic Processes II : Stochastc Processes II 1 Contnuous-tme stochastc process So far we have studed dscrete-tme stochastc processes. We studed the concept of Makov chans and martngales, tme seres analyss, and regresson analyss

More information

The Geometry of Logit and Probit

The Geometry of Logit and Probit The Geometry of Logt and Probt Ths short note s meant as a supplement to Chapters and 3 of Spatal Models of Parlamentary Votng and the notaton and reference to fgures n the text below s to those two chapters.

More information

Perfect Competition and the Nash Bargaining Solution

Perfect Competition and the Nash Bargaining Solution Perfect Competton and the Nash Barganng Soluton Renhard John Department of Economcs Unversty of Bonn Adenauerallee 24-42 53113 Bonn, Germany emal: rohn@un-bonn.de May 2005 Abstract For a lnear exchange

More information

ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EQUATION

ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EQUATION Advanced Mathematcal Models & Applcatons Vol.3, No.3, 2018, pp.215-222 ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EUATION

More information

Linear Regression Analysis: Terminology and Notation

Linear Regression Analysis: Terminology and Notation ECON 35* -- Secton : Basc Concepts of Regresson Analyss (Page ) Lnear Regresson Analyss: Termnology and Notaton Consder the generc verson of the smple (two-varable) lnear regresson model. It s represented

More information

Introduction to Vapor/Liquid Equilibrium, part 2. Raoult s Law:

Introduction to Vapor/Liquid Equilibrium, part 2. Raoult s Law: CE304, Sprng 2004 Lecture 4 Introducton to Vapor/Lqud Equlbrum, part 2 Raoult s Law: The smplest model that allows us do VLE calculatons s obtaned when we assume that the vapor phase s an deal gas, and

More information

P R. Lecture 4. Theory and Applications of Pattern Recognition. Dept. of Electrical and Computer Engineering /

P R. Lecture 4. Theory and Applications of Pattern Recognition. Dept. of Electrical and Computer Engineering / Theory and Applcatons of Pattern Recognton 003, Rob Polkar, Rowan Unversty, Glassboro, NJ Lecture 4 Bayes Classfcaton Rule Dept. of Electrcal and Computer Engneerng 0909.40.0 / 0909.504.04 Theory & Applcatons

More information

8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS

8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 493 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces you have studed thus far n the text are real vector spaces because the scalars

More information

COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS

COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS Avalable onlne at http://sck.org J. Math. Comput. Sc. 3 (3), No., 6-3 ISSN: 97-537 COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS

More information

5 The Rational Canonical Form

5 The Rational Canonical Form 5 The Ratonal Canoncal Form Here p s a monc rreducble factor of the mnmum polynomal m T and s not necessarly of degree one Let F p denote the feld constructed earler n the course, consstng of all matrces

More information

2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification

2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification E395 - Pattern Recognton Solutons to Introducton to Pattern Recognton, Chapter : Bayesan pattern classfcaton Preface Ths document s a soluton manual for selected exercses from Introducton to Pattern Recognton

More information

Solution Thermodynamics

Solution Thermodynamics Soluton hermodynamcs usng Wagner Notaton by Stanley. Howard Department of aterals and etallurgcal Engneerng South Dakota School of nes and echnology Rapd Cty, SD 57701 January 7, 001 Soluton hermodynamcs

More information

2.3 Nilpotent endomorphisms

2.3 Nilpotent endomorphisms s a block dagonal matrx, wth A Mat dm U (C) In fact, we can assume that B = B 1 B k, wth B an ordered bass of U, and that A = [f U ] B, where f U : U U s the restrcton of f to U 40 23 Nlpotent endomorphsms

More information

(1 ) (1 ) 0 (1 ) (1 ) 0

(1 ) (1 ) 0 (1 ) (1 ) 0 Appendx A Appendx A contans proofs for resubmsson "Contractng Informaton Securty n the Presence of Double oral Hazard" Proof of Lemma 1: Assume that, to the contrary, BS efforts are achevable under a blateral

More information

Probability Theory (revisited)

Probability Theory (revisited) Probablty Theory (revsted) Summary Probablty v.s. plausblty Random varables Smulaton of Random Experments Challenge The alarm of a shop rang. Soon afterwards, a man was seen runnng n the street, persecuted

More information

Foundations of Arithmetic

Foundations of Arithmetic Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an

More information

Linear, affine, and convex sets and hulls In the sequel, unless otherwise specified, X will denote a real vector space.

Linear, affine, and convex sets and hulls In the sequel, unless otherwise specified, X will denote a real vector space. Lnear, affne, and convex sets and hulls In the sequel, unless otherwse specfed, X wll denote a real vector space. Lnes and segments. Gven two ponts x, y X, we defne xy = {x + t(y x) : t R} = {(1 t)x +

More information

BOUNDEDNESS OF THE RIESZ TRANSFORM WITH MATRIX A 2 WEIGHTS

BOUNDEDNESS OF THE RIESZ TRANSFORM WITH MATRIX A 2 WEIGHTS BOUNDEDNESS OF THE IESZ TANSFOM WITH MATIX A WEIGHTS Introducton Let L = L ( n, be the functon space wth norm (ˆ f L = f(x C dx d < For a d d matrx valued functon W : wth W (x postve sem-defnte for all

More information

THERE ARE INFINITELY MANY FIBONACCI COMPOSITES WITH PRIME SUBSCRIPTS

THERE ARE INFINITELY MANY FIBONACCI COMPOSITES WITH PRIME SUBSCRIPTS Research and Communcatons n Mathematcs and Mathematcal Scences Vol 10, Issue 2, 2018, Pages 123-140 ISSN 2319-6939 Publshed Onlne on November 19, 2018 2018 Jyot Academc Press http://jyotacademcpressorg

More information

Mathematical Preparations

Mathematical Preparations 1 Introducton Mathematcal Preparatons The theory of relatvty was developed to explan experments whch studed the propagaton of electromagnetc radaton n movng coordnate systems. Wthn expermental error the

More information

On the Multicriteria Integer Network Flow Problem

On the Multicriteria Integer Network Flow Problem BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 5, No 2 Sofa 2005 On the Multcrtera Integer Network Flow Problem Vassl Vasslev, Marana Nkolova, Maryana Vassleva Insttute of

More information

Winter 2008 CS567 Stochastic Linear/Integer Programming Guest Lecturer: Xu, Huan

Winter 2008 CS567 Stochastic Linear/Integer Programming Guest Lecturer: Xu, Huan Wnter 2008 CS567 Stochastc Lnear/Integer Programmng Guest Lecturer: Xu, Huan Class 2: More Modelng Examples 1 Capacty Expanson Capacty expanson models optmal choces of the tmng and levels of nvestments

More information

Poisson brackets and canonical transformations

Poisson brackets and canonical transformations rof O B Wrght Mechancs Notes osson brackets and canoncal transformatons osson Brackets Consder an arbtrary functon f f ( qp t) df f f f q p q p t But q p p where ( qp ) pq q df f f f p q q p t In order

More information

COS 521: Advanced Algorithms Game Theory and Linear Programming

COS 521: Advanced Algorithms Game Theory and Linear Programming COS 521: Advanced Algorthms Game Theory and Lnear Programmng Moses Charkar February 27, 2013 In these notes, we ntroduce some basc concepts n game theory and lnear programmng (LP). We show a connecton

More information

Feb 14: Spatial analysis of data fields

Feb 14: Spatial analysis of data fields Feb 4: Spatal analyss of data felds Mappng rregularly sampled data onto a regular grd Many analyss technques for geophyscal data requre the data be located at regular ntervals n space and/or tme. hs s

More information

College of Computer & Information Science Fall 2009 Northeastern University 20 October 2009

College of Computer & Information Science Fall 2009 Northeastern University 20 October 2009 College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:

More information

PHYS 705: Classical Mechanics. Calculus of Variations II

PHYS 705: Classical Mechanics. Calculus of Variations II 1 PHYS 705: Classcal Mechancs Calculus of Varatons II 2 Calculus of Varatons: Generalzaton (no constrant yet) Suppose now that F depends on several dependent varables : We need to fnd such that has a statonary

More information

Perron Vectors of an Irreducible Nonnegative Interval Matrix

Perron Vectors of an Irreducible Nonnegative Interval Matrix Perron Vectors of an Irreducble Nonnegatve Interval Matrx Jr Rohn August 4 2005 Abstract As s well known an rreducble nonnegatve matrx possesses a unquely determned Perron vector. As the man result of

More information

NP-Completeness : Proofs

NP-Completeness : Proofs NP-Completeness : Proofs Proof Methods A method to show a decson problem Π NP-complete s as follows. (1) Show Π NP. (2) Choose an NP-complete problem Π. (3) Show Π Π. A method to show an optmzaton problem

More information

The Minimum Universal Cost Flow in an Infeasible Flow Network

The Minimum Universal Cost Flow in an Infeasible Flow Network Journal of Scences, Islamc Republc of Iran 17(2): 175-180 (2006) Unversty of Tehran, ISSN 1016-1104 http://jscencesutacr The Mnmum Unversal Cost Flow n an Infeasble Flow Network H Saleh Fathabad * M Bagheran

More information

CHAPTER III Neural Networks as Associative Memory

CHAPTER III Neural Networks as Associative Memory CHAPTER III Neural Networs as Assocatve Memory Introducton One of the prmary functons of the bran s assocatve memory. We assocate the faces wth names, letters wth sounds, or we can recognze the people

More information

LINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity

LINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity LINEAR REGRESSION ANALYSIS MODULE IX Lecture - 30 Multcollnearty Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur 2 Remedes for multcollnearty Varous technques have

More information

Numerical Heat and Mass Transfer

Numerical Heat and Mass Transfer Master degree n Mechancal Engneerng Numercal Heat and Mass Transfer 06-Fnte-Dfference Method (One-dmensonal, steady state heat conducton) Fausto Arpno f.arpno@uncas.t Introducton Why we use models and

More information

j) = 1 (note sigma notation) ii. Continuous random variable (e.g. Normal distribution) 1. density function: f ( x) 0 and f ( x) dx = 1

j) = 1 (note sigma notation) ii. Continuous random variable (e.g. Normal distribution) 1. density function: f ( x) 0 and f ( x) dx = 1 Random varables Measure of central tendences and varablty (means and varances) Jont densty functons and ndependence Measures of assocaton (covarance and correlaton) Interestng result Condtonal dstrbutons

More information

Chapter 13: Multiple Regression

Chapter 13: Multiple Regression Chapter 13: Multple Regresson 13.1 Developng the multple-regresson Model The general model can be descrbed as: It smplfes for two ndependent varables: The sample ft parameter b 0, b 1, and b are used to

More information

Week3, Chapter 4. Position and Displacement. Motion in Two Dimensions. Instantaneous Velocity. Average Velocity

Week3, Chapter 4. Position and Displacement. Motion in Two Dimensions. Instantaneous Velocity. Average Velocity Week3, Chapter 4 Moton n Two Dmensons Lecture Quz A partcle confned to moton along the x axs moves wth constant acceleraton from x =.0 m to x = 8.0 m durng a 1-s tme nterval. The velocty of the partcle

More information

Finite Element Modelling of truss/cable structures

Finite Element Modelling of truss/cable structures Pet Schreurs Endhoven Unversty of echnology Department of Mechancal Engneerng Materals echnology November 3, 214 Fnte Element Modellng of truss/cable structures 1 Fnte Element Analyss of prestressed structures

More information

CHAPTER 4. Vector Spaces

CHAPTER 4. Vector Spaces man 2007/2/16 page 234 CHAPTER 4 Vector Spaces To crtcze mathematcs for ts abstracton s to mss the pont entrel. Abstracton s what makes mathematcs work. Ian Stewart The man am of ths tet s to stud lnear

More information

Finding Dense Subgraphs in G(n, 1/2)

Finding Dense Subgraphs in G(n, 1/2) Fndng Dense Subgraphs n Gn, 1/ Atsh Das Sarma 1, Amt Deshpande, and Rav Kannan 1 Georga Insttute of Technology,atsh@cc.gatech.edu Mcrosoft Research-Bangalore,amtdesh,annan@mcrosoft.com Abstract. Fndng

More information

Assortment Optimization under MNL

Assortment Optimization under MNL Assortment Optmzaton under MNL Haotan Song Aprl 30, 2017 1 Introducton The assortment optmzaton problem ams to fnd the revenue-maxmzng assortment of products to offer when the prces of products are fxed.

More information

Chapter 9: Statistical Inference and the Relationship between Two Variables

Chapter 9: Statistical Inference and the Relationship between Two Variables Chapter 9: Statstcal Inference and the Relatonshp between Two Varables Key Words The Regresson Model The Sample Regresson Equaton The Pearson Correlaton Coeffcent Learnng Outcomes After studyng ths chapter,

More information

ISSN: ISO 9001:2008 Certified International Journal of Engineering and Innovative Technology (IJEIT) Volume 3, Issue 1, July 2013

ISSN: ISO 9001:2008 Certified International Journal of Engineering and Innovative Technology (IJEIT) Volume 3, Issue 1, July 2013 ISSN: 2277-375 Constructon of Trend Free Run Orders for Orthogonal rrays Usng Codes bstract: Sometmes when the expermental runs are carred out n a tme order sequence, the response can depend on the run

More information

Online Appendix: Reciprocity with Many Goods

Online Appendix: Reciprocity with Many Goods T D T A : O A Kyle Bagwell Stanford Unversty and NBER Robert W. Stager Dartmouth College and NBER March 2016 Abstract Ths onlne Appendx extends to a many-good settng the man features of recprocty emphaszed

More information

For now, let us focus on a specific model of neurons. These are simplified from reality but can achieve remarkable results.

For now, let us focus on a specific model of neurons. These are simplified from reality but can achieve remarkable results. Neural Networks : Dervaton compled by Alvn Wan from Professor Jtendra Malk s lecture Ths type of computaton s called deep learnng and s the most popular method for many problems, such as computer vson

More information

9 Derivation of Rate Equations from Single-Cell Conductance (Hodgkin-Huxley-like) Equations

9 Derivation of Rate Equations from Single-Cell Conductance (Hodgkin-Huxley-like) Equations Physcs 171/271 - Chapter 9R -Davd Klenfeld - Fall 2005 9 Dervaton of Rate Equatons from Sngle-Cell Conductance (Hodgkn-Huxley-lke) Equatons We consder a network of many neurons, each of whch obeys a set

More information

Feature Selection: Part 1

Feature Selection: Part 1 CSE 546: Machne Learnng Lecture 5 Feature Selecton: Part 1 Instructor: Sham Kakade 1 Regresson n the hgh dmensonal settng How do we learn when the number of features d s greater than the sample sze n?

More information

A be a probability space. A random vector

A be a probability space. A random vector Statstcs 1: Probablty Theory II 8 1 JOINT AND MARGINAL DISTRIBUTIONS In Probablty Theory I we formulate the concept of a (real) random varable and descrbe the probablstc behavor of ths random varable by

More information

Formulas for the Determinant

Formulas for the Determinant page 224 224 CHAPTER 3 Determnants e t te t e 2t 38 A = e t 2te t e 2t e t te t 2e 2t 39 If 123 A = 345, 456 compute the matrx product A adj(a) What can you conclude about det(a)? For Problems 40 43, use

More information

Comparison of the Population Variance Estimators. of 2-Parameter Exponential Distribution Based on. Multiple Criteria Decision Making Method

Comparison of the Population Variance Estimators. of 2-Parameter Exponential Distribution Based on. Multiple Criteria Decision Making Method Appled Mathematcal Scences, Vol. 7, 0, no. 47, 07-0 HIARI Ltd, www.m-hkar.com Comparson of the Populaton Varance Estmators of -Parameter Exponental Dstrbuton Based on Multple Crtera Decson Makng Method

More information

Beyond Zudilin s Conjectured q-analog of Schmidt s problem

Beyond Zudilin s Conjectured q-analog of Schmidt s problem Beyond Zudln s Conectured q-analog of Schmdt s problem Thotsaporn Ae Thanatpanonda thotsaporn@gmalcom Mathematcs Subect Classfcaton: 11B65 33B99 Abstract Usng the methodology of (rgorous expermental mathematcs

More information

THE WEIGHTED WEAK TYPE INEQUALITY FOR THE STRONG MAXIMAL FUNCTION

THE WEIGHTED WEAK TYPE INEQUALITY FOR THE STRONG MAXIMAL FUNCTION THE WEIGHTED WEAK TYPE INEQUALITY FO THE STONG MAXIMAL FUNCTION THEMIS MITSIS Abstract. We prove the natural Fefferman-Sten weak type nequalty for the strong maxmal functon n the plane, under the assumpton

More information