TESTABLE IMPLICATIONS OF TRANSLATION INVARIANCE AND HOMOTHETICITY: VARIATIONAL, MAXMIN, CARA AND CRRA PREFERENCES
|
|
- Valerie White
- 5 years ago
- Views:
Transcription
1 New title: Teting theorie of financial deciion making Publihed in the Proceeding of the National Academy of Science, Volume 113, Number 15; April 12, TESTABLE IMPLICATIONS OF TRANSLATION INVARIANCE AND HOMOTHETICITY: VARIATIONAL, MAXMIN, CARA AND CRRA PREFERENCES CHRISTOPHER P. CHAMBERS, FEDERICO ECHENIQUE, AND KOTA SAITO Abtract. We provide revealed preference axiom that characterize model of tranlation invariant preference. In particular, we characterize the model of variational, maxmin, CARA and CRRA utilitie. In each cae we preent a revealed preference axiom that i atified by a dataet if and only if the dataet i conitent from the correponding utility repreentation. Our reult complement traditional exercie in deciion theory that take preference a primitive. 1. Introduction We work out the tetable implication of model with tranlation invariant preference. Given a finite dataet on purchae of tatecontingent aet, we give a revealed preference axiom that decribe the dataet that are conitent with different model of tranlation invariant preference. Thee model include rik neutral variational preference (Maccheroni et al., 2006), rik neutral maxmin preference (Gilboa and Schmeidler, 1989), and ubjective expected utility preference with contant abolute rik averion: o-called CARA preference. Analogouly to the Chamber i affiliated with the Department of Economic, Univerity of California, San Diego. Echenique and Saito are affiliated with the Diviion of the Humanitie and Social Science, California Intitute of Technology, Paadena CA cpchamber@ucd.edu (Chamber), fede@caltech.edu (Echenique), kaito@h.caltech.edu (Saito). We are very grateful to Simon Grant and Maimo Marinacci, who poed quetion to u that led to ome of the reult in thi paper. 1
2 2 CHAMBERS, ECHENIQUE, AND SAITO CARA cae, we alo work out the tetable implication of ubjective expected utility preference with contant relative rik averion, the CRRA preference (thee form the homothetic cla alluded to in the title). The model have been ued by economit for different purpoe. Variational and maxmin preference are the mot commonly-ued model of ambiguity averion. They are alo ued to capture model robutne (Hanen and Sargent, 2008). CARA and CRRA preference are very common in applied work in macroeconomic and finance, among other field. Our contribution i to tart from finite data on tate-contingent conumption purchae, uch a one would oberve from a market experiment on choice under uncertainty (Hey and Pace, 2014; Ahn et al., 2014; Bayer et al., 2012; Boaert et al., 2010). We decribe the dataet that are rationalizable a conitent with a preference relation that atifie tranlation invariance. When we ay that we decribe the dataet that are rationalizable, we mean that we provide a property, a revealed preference axiom, that the data atifie if and only if it i conitent with the theory in quetion. The model we tudy have well known axiomatization when one take preference a primitive, but not when one take conumption data a given. The axiomatization of variational preference i due to Maccheroni et al. (2006) (ee alo Grant and Polak (2013) for a variation on their argument). The axiomatization of maxmin i due to Gilboa and Schmeidler (1989). Thee paper are often thought to provide the behavioral counterpart of certain theorie of choice: the preference relation capture an agent behavior, and the theorem in thee paper decribe the behavior that are conitent with the theory. Our focu i on behavior in the market, not on preference. The primitive i a finite lit of purchae of tate-contingent payment, each one made at a different price vector. In contrat with mot paper on ambiguity, we do not work in the Ancombe-Aumann framework. For thi reaon, we mut retrict attention to rik-neutral variational and maxmin preference. The Ancombe- Aumann framework ha the advantage that it (eentially) allow the
3 TRANSLATION INVARIANCE AND HOMOTHETICITY 3 utility over outcome to be obervable. In a imilar vein, our reult extend beyond the rik neutral cae by adding a utility function a an obervation to our dataet. It would of coure be deirable to obtain reult without the aumption of rik neutrality; but thee are likely difficult to come by. One exception i the cae of maxmin utility with two tate: we give a characterization of the data et that are rationalizable with rik neutral (concave utility over money) maxmin in Section 6. The two-tate cae i of coure retrictive, but probably of interet for experiment on ambiguity: ome of the mot baic experiment illutrating ambiguity averion involve two tate. The cloet paper to our are Varian (1988), Bayer et al. (2012) and Polion and Quah (2013). Our reult on CARA and CRRA are cloe to Varian (1988). The main difference i that Varian conider the cae of objective probabilitie, not ubjective. Bayer et al. (2012) and Polion and Quah (2013) look at the tetable implication of model of ambiguity averion for the ame kind of data that we aume in thi paper. They give a characterization in term of the olution of a ytem of inequalitie. Our contribution i different becaue we give a revealed preference axiom that ha to be atified for the data to be rationalizable. The paper by (Kubler et al., 2014) and (Echenique and Saito, 2013) are alo related. Kubler et al. olve the ame problem a we do here, but for the cae of expected utility theory with known (objective) probabilitie over tate. Echenique and Saito olve the problem for ubjective expected utility. 2. Definition. Let S be a finite et of tate of the world. An act i a function from S into R. So R S i the et of act. An act can be interpreted a a tate-contingent monetary payment. Define x 1 = x. A preference relation on R S i a binary relation that i complete and tranitive. Given a preference relation, we denote by the trict part of. A function u : R S R define a preference relation by
4 4 CHAMBERS, ECHENIQUE, AND SAITO x y if and only if u(x) u(y). We ay that u repreent, or that it i a utility function for. A preference relation on R S i locally nonatiated if for every x and every ε > 0 there i y uch that x y < ε and y x. 3. Preference, utilitie, and data. A data et D i a finite collection {(p k, x k )} K k=1, where each pk R S ++ i a vector of trictly poitive (Arrow-Debreu) price, and each x k R S i an act. The interpretation of a dataet i that each pair (p k, x k ) conit of an act x k choen from the budget {x R S : p k x p k x k } of affordable act. 1 A data et {(p k, x k )} K k=1 i rationalizable by a preference relation if x k x whenever p k x k p k x. So a data et i rationalizable by a preference relation when the choice in the dataet would have been optimal for that preference relation. A data et {(p k, x k )} K k=1 i rationalizable by a utility function u if it i rationalizable by the preference relation repreented by u. So a data et i rationalizable by a utility function when the choice in the dataet would have maximized that utility function in the relevant budget et. A preference relation i tranlation invariant if for all x, y R S and all c R, we have x y if and only if x+(c,..., c) y+(c,..., c). A preference relation i homothetic if for all x, y R S α > 0, we have x y if and only if αx αy. and all A preference i a (rik-neutral) variational preference if there i a convex and continuou function c uch that the utility function inf π x + c(π) π (S) repreent. If a data et i rationalizable by a variational preference relation, we will ay that the dataet et i (rik-neutral) variationalrationalizable. 1 Arrow-Debreu price make ene in a etting of complete market and abence of arbitrage. Arrow-Debreu price can then be recovered from aet price. We alo imagine experimental data from market in which Arrow-Debreu ecuritie are traded (Hey and Pace, 2014; Ahn et al., 2014; Bayer et al., 2012).
5 TRANSLATION INVARIANCE AND HOMOTHETICITY 5 A pecial cae of variational preference i maxmin: A preference relation i (rik-neutral) maxmin if there i a cloed and convex et Π (S) uch that the utility function inf π x π Π repreent. If a data et i rationalizable by a rik neutral maxmin preference relation, we will ay that the dataet et i (rik-neutral) maxmin-rationalizable. A utility u : R S R i contant abolute rik averion (CARA) if there i a > 0 and π (S) for which u(x) = S π ( exp( ax)). Note that CARA i a pecial cae of ubjective expected utility. A utility u : R S R i contant relative rik averion (CRRA) if there i a (0, 1) and π (S) for which u(x) = ( ) x 1 a π. 1 a S If a data et i rationalizable by a CARA (CRRA) utility, we will ay that the dataet et i CARA (CRRA) rationalizable. 4. Variational preference We preent the reult on variational and maxmin rationalizability a Theorem 1 and 3. In each cae, the model in quetion aume a linear utility index: o the model capture ambiguity averion but rik neutrality. Thee reult beg the quetion of the empirical content of rik averion together with ambiguity averion. In Section 6 we preent a reult on maxmin utility with rik averion. It i retricted to environment with two tate. 1. Theorem. The following tatement are equivalent: (1) Dataet D i rationalizable by a locally nonatiated, tranlation invariant preference.
6 6 CHAMBERS, ECHENIQUE, AND SAITO (2) Dataet D i rationalizable by a continuou, trictly increaing, concave utility function atifying the property u(x+(c,..., c)) = u(x) + c. (3) Dataet D i variational-rationalizable. (4) For every l = 1,..., M, and every equence {k l } {1,..., K}, we have M p k l l=1 p k l 1 (x k l+1 x k l) 0 (here addition i modulo M, a uual). 2. Remark. The preceding reult can be generalized. Suppoe we were intereted in the tetable implication of preference which are β-tranlation invariant, for ome β 0, β 0. That i, we want to know whether for all x, y, we have x y if and only if x + β y + β. Define the eminorm x β 1 = i β ix i. Then it i an eay exercie to verify that the tetable implication of β-tranlation invariance are given by equation (4), replacing 1 with β 1. Hence, the tet given here hould be compared with the one given by Brown and Calamiglia (2007), and other tet for rik preference. We now turn out attention to maxmin preference. Note that the equivalence between (2) and (3) in Theorem 3 i well known, but here we prove it through an application of Theorem 1. We ay that a function u : R S R i linearly homogeneou if for all x R S and all α > 0, we have u(αx) = αu(x). 3. Theorem. The following tatement are equivalent: (1) Dataet D i rationalizable by a locally nonatiated, homothetic and tranlation invariant preference. (2) Dataet D i rationalizable by a continuou, trictly increaing, linearly homogeneou and concave utility function atifying the property that u(x + (c,..., c)) = u(x) + c. (3) Dataet D i maxmin-rationalizable. (4) For every k and l, p k x k pl p l 1 x k.
7 TRANSLATION INVARIANCE AND HOMOTHETICITY 7 5. CARA and CRRA The previou ection conider tranlation invariance and homotheticity a general propertie of preference in choice under uncertainty. Here we focu on the cae of ubjective expected utility. So we conider model in which the agent ha a ingle prior over tate, and maximize expected utility. The prior i unknown though, and mut be inferred from her choice. In the ubjective expected utility cae, tranlation invariance give rie to CARA preference, and homotheticity to CRRA. 4. Theorem. A dataet D i CARA rationalizable if and only if there i α > 0 uch that (1) hold; and CRRA rationalizable if and only if there i α (0, 1) uch that (2) hold. (1) (2) α (x k t x k + x k x k t ) = ln( pk p k t α ln( xk t x k x k x k t ) = ln( pk p k t p k t p k p k t p k ) ) The condition in Theorem 4 may look like exitential condition: eentially Afriat inequalitie. Afriat inequalitie are indeed the ource of equation (1) and (2), a evidenced by the proof of Theorem 4, but note that the tatement are equivalent to non-exitential tatement. Equation (1) ay that when (x k t x k + x k x k t ) 0, ln( pk p k t p k t p k (x k t x k + x k x k i independent of k, t, k and ; and that when (x k t x k + x k x k t ) = 0 then ln( pk p k p k t ) = 0. Similarly for Equation (2). t p k It i worth pointing out that, except in the cae when for all obervation, all price are equal, and conumption of all good are equal, equation (1) can have only one olution. Hence, rik preference are uniquely identified. The next corollary alo how that belief are identified. When π (S) and a > 0, let U a = S π ( exp( ax)) denote the aociated ubjective expected CARA utility. ) t )
8 8 CHAMBERS, ECHENIQUE, AND SAITO 5. Corollary. α > 0 olve (1) if and only if there i π (S) uch that π and U α CARA rationalize D. Further, for any uch α > 0, there i a unique π (S) uch that if π and U α CARA rationalize D, then π = π. Similarly for (2) and CRRA rationalizability. 6. Rik avere max-min with two tate The prior reult i about rik neutral maxmin. Here we turn to maxmin with rik averion. A preference relation i maxmin if there i a cloed and convex et Π (S) and a concave utility u : R S R uch that the utility function inf π u(x ) π Π =1,2 repreent. If a data et i rationalizable by a maxmin preference relation, we will ay that the dataet et i maxmin-rationalizable. Aume a dataet {(p k, x k )} K k=1 in which xk x k (k, ). when (k, ) Let K 1 be the et of all k uch that x k 1 < x k 2, and K 2 be the et of all k uch that x k 1 > x k 2. Suppoe that K = K 1 K 2. Given a equence of pair (x k i i, x k i i) n i=1, conider the following notation: Let I l, = {i : k i K l and i = } I l, = {i : k i K l and i = }, for l = 1, 2 and = 1, 2. Strong Axiom of Revealed Maxmin Utility (SARMU): For any equence of pair (x k i i, x k i i) n i=1 in which (1) x k i i x k i for all i; i (2) each k appear a k i (on the left of the pair) the ame number of time it appear a k i (on the right); (3) I 1,1 I 1,1 = I 2,1 I2,1 0 The product of price atifie that n i=1 p k i i p k i i 1. One can alternatively define the axiom with I 2,2 I 2,2 = I 1,2 I 1,2 0 in condition (3).
9 TRANSLATION INVARIANCE AND HOMOTHETICITY 9 6. Theorem. A dataet i maxmin rationalizable if and only if it atifie SARMU Dicuion. Echenique and Saito (2013) how that the following axiom characterize rationalizability by ubjective expected utility. Strong Axiom of Revealed Subjective Expected Utility (SARSEU): For any equence of pair (x k i i, x k i i) n i=1 in which (1) x k i i x k i for all i; i (2) each k appear a k i (on the left of the pair) the ame number of time it appear a k i (on the right); (3) I 1,1 + I 2,1 = I 1,1 + I 2,1 The product of price atifie that n i=1 p k i i p k i i 1. Note that condition (3) of SARSEU i equivalent to I 2,2 + I 1,2 = I 2,2 + I 1,2 becaue I 1,1 + I 2,1 + I 2,2 + I 1,2 = n = I 1,1 + I 2,1 + I 2,2 + I 1,2. Inpection of SARSEU and SARMU yield the following 7. Propoition. If a dataet atifie SARSEU then it atifie SARMU. For a dataet to be maxmin rationalizable, but inconitent with ubjective expected utility, it need to contain a equence in the condition of SARSEU in which I 1,1 + I 2,1 = I 1,1 + I 2,1, but where I 1,1 I 1,1 > 0. A we have emphaized, the reult in Theorem 6 i for two tate. There are two implification afforded by the aumption of two tate, and the two are crucial in obtaining the theorem. The firt i that with two tate there are only two extreme prior to any et of prior. With the aumption that u i monotonic, one can know which of the two extreme i relevant to evaluate any given act. The econd implification i a bit harder to ee, but it come from the fact that one can normalize the probability of one tate to be one and only keep
10 10 CHAMBERS, ECHENIQUE, AND SAITO track of the probability of the other tate. Then the property of beign an extreme prior carrie over to the probability of the tate that i left free Proof 7.1. Proof of Theorem 1. That (3) = (1) i obviou. We hall firt prove that (1) = (4) Suppoe, toward a contradiction, D i a dataet atifying (1) but not (4). Then we have a cycle M p k l l=1 p k l 1 (x k l+1 x k l) < 0. Let u without lo aume the equence i x 1,..., x M o a to avoid cumberome notation. Let Z = M p l l=1 p l 1 (x l+1 x l ) < 0. Define a new equence (y 1,..., y M ) inductively. Let y 1 = x 1, and let y k = x k + (c k,..., c k ) where c k p i choen o that k (y k+1 y k ) = Z. M Specifically, c 1 = 0 and c k+1 = c k + Z M for k = 1,..., M 1. Let q k = k = 1,... M. Oberve that M 1 k=1 q k (y k+1 y k ) + q M (y 1 y M ) = pk (x k+1 x k ) pk and conider the dataet (q k, y k ), M k=1 p k (x k+1 x k ) = Z, and that q k (y k+1 y k ) = Z/M for k = 1,..., M 1. q M (y 1 y M ) = Z/M Therefore, The original dataet i rationalizable by ome locally non-atiated and tranlation invariant preference. It i eay to ee that the ame preference rationalize the dataet (q k, y k ). Indeed, if q k y k q k y then p k x k p k (y (c k,..., c k )), by definition of y k and q k. So x k (y (c k,..., c k )), and thu y k y by tranlation invariance of. M 1 k=1 Oberve that q k (y k+1 y k ) + q M (y 1 y M ) = M 1 k=1 p k (x k+1 x k ) + c M = Z, 2 Thi can be een in the proof of Lemma 8 when we go from π π to µ 1 µ 1.
11 TRANSLATION INVARIANCE AND HOMOTHETICITY 11 and that q k (y k+1 y k ) = Z/M for k = 1,..., M 1. Therefore, q M (y 1 y M ) = Z/M. In particular, q k (y k+1 y k ) = Z/M < 0 for k = 1,..., M (mod M). Thu y k y k+1 a (q k, y k ) i rationalizable by and i locally nonatiated. Thi contradict the tranitivity of. Now we how that (4) = (2). Let x R S. Let Σ x be the et of all ubequence {k l } M l=1 {1,..., K} for which k 1 = 1 and define x k M+1 = x. By (4), if {k l } M l=1 Σ x ha a cycle (meaning that k l = k l for l, l {1,..., M} with l l ), then there i a horter equence {k j } M j=1 Σ x with M j=1 p k j p k j 1 (x k j+1 x k j ) M l=1 p k l p k l 1 (x k l+1 x k l ). Therefore, u(x) = inf{ M p k l l=1 p k l 1 (x k l+1 x k l) : {kl } M l=1 Σ x} i well defined, a the infimum can be taken over a finite et. That u : R S R defined in thi fahion i concave, trictly increaing and continuou i immediate. To ee that it rationalize the data, uppoe that p k x l p k x k. Then pk x l pk x k. It i clear then by definition that u(x l ) u(x k ) + pk (x l x k ) u(x k ). Finally, to how that u(x) + (c,..., c)) = u(x) + c, note that for any p k p k, we have (x + (c,..., c)) = c + pk x. The reult then follow by contruction. We end the proof by howing that (2) = (3) Let u : R S R be a in the tatement of (2). Define the concave conjugate of u by f(π) = inf{π x u(x) : x R S } = inf{π x + cπ 1 u(x) c : x R S, c R} = inf{π x c(1 π 1) u(x) : x R S, c R}, where the econd inequality ue that u(x+(c,..., c)) = u(x)+c. Now note that f(π) = if (1 π 1) 0. Note alo that the monotonicity of u implie that f(π) = if there i uch that π S < 0. Hence the domain of f i a ubet of (S).
12 12 CHAMBERS, ECHENIQUE, AND SAITO Now ince u i continuou, we have that u(x) = inf π (S) π x f(p). Since u rationalize the dataet, the dataet i variational rationalizable Proof of Theorem 3. It i obviou that (3) = (2) and that (2) = (1). Hence, to how the theorem, it uffice to how that (4) implie (3) and that (1) implie (4). For a dataet D, let π k = pk. It i eay to ee that (4) = (3). Let Π be the convex hull of {π k : k = 1,..., K}. Then it i immediate that U(x) = min π Π π x rationalize D. We prove that (1) = (4). Suppoe that D atifie (1) but not (4). Then there i k and l for which π l x k < π k x k. Let be a preference relation a tated in (1). Homotheticity implie that rationalize the data {(x j, π j ) : j = 1,..., K} {(θx l, π l )} for any calar θ > 0. Now, π l x k < π k x k implie that x k (π l π k ) + θx l (π k π l ) < 0 for θ > 0 mall enough. But thi i a violation of (4) in Theorem 1. A contradiction becaue i tranlation invariant and locally nonatiated Proof of Theorem 4. The idea in the proof i to olve the firtorder condition for the unknown term. Conider firt the cae of CARA. Let π (S) and α > 0 rationalize D. Then we know that x k maximize π exp( αx ) ubject to p k x p k x k. By conidering the Lagrangean and the firt order condition, we may conclude that for every, t S and every k {1,..., K}, we have π exp( αx k ) p k = π t exp( αx k t ). p k t Conclude that pk πt p k t π become: = exp( α(xk x k t )). By taking log, the ytem (3) ln(π ) ln(π t ) + α(x k t x k ) = ln(p ) ln(p t ).
13 TRANSLATION INVARIANCE AND HOMOTHETICITY 13 In the cae of CRAA, the exitence of a rationalizing π and parameter α imply a firt-order condition of the form (4) ln(π ) ln(π t ) + α ln(x k t /x k ) = ln(p ) ln(p t ). We can denote ln(π ) by z in Equation (3) and (4). Thu we obtain that D i rationalizable if and only if there exit z R and α > 0 uch that the following equation i olved for all, t, k with t: z z t + α(y k t y k ) = ln(p k ) ln(p k t ), where y k t = x k t for CARA rationalizability, and y k t = ln x k t for CRRA rationalizability. Now the neceity of the axiom i obviou. Let k k, then α(y k t y k ) ln(p k /p k t ) = z z t = α(y k t y k ) ln(p k /p k t ) for any and t. Thu α(y k t y k y k t + y k ) = ln( pk p k t So (1) i atified for the cae of CARA rationalizability, and (2) i atified for the cae of CRRA rationalizability. To prove ufficiency, let d p (, t, k) = log(p k /p k t ) d x (, t, k) = y k y k t. Let α be uch that for all k, k,, and t, α (y k t y k y k t + y k ) = ln( pk p k t Then in particular, for all k, k,, and t, (5) d p (, t, k) + α d x (, t, k) + d p (t,, k ) + α d x (t,, k ) = 0. Note alo that (6) d p (, t, k) + d p (t,, k) + d p (,, k) p k t p k p k t p k +α (d x (, t, k) + d x (t,, k) + d x (,, k)) = 0. ). ).
14 14 CHAMBERS, ECHENIQUE, AND SAITO Fix 0 S and let z 0 R be arbitrary. For any S, define z by z = z 0 + α d x ( 0,, k) + d p (, 0, k), for ome k. In fact, by Equation (5) thi definition i independent of k becaue d p (, 0, k) + α d x (, 0, k) = d p (, 0, k ) + α d x (, 0, k ). Given thi definition, note that z z t = α (d x ( 0,, k) d x ( 0, t, k)) + d p (, 0, k) d p (t, 0, k) = α (d x ( 0,, k) d x ( 0, t, k)) + d p (, 0, k) d p (t, 0, k) + d p (, t, k) + d p (t, 0, k) + d p ( 0,, k) + α (d x (, t, k) + d x (t, 0, k) + d x ( 0,, k)) = d p (, t, k) + α d x (, t, k). Where the econd equality ue Equation (6). Hence, with the contructed (z t ) t S we have z z t + α (yt k y k ) = log(p k /p k t ), for all, t, and k. The firt-order condition for rationalizability are therefore atified Proof of Theorem Lemma. A dataet D i rationalizable if and only if there are v k, λ k, = 1, 2, k = 1,..., K, and π, π 0 with π π, uch that: πv k 1 = λ k p k 1 v k 2 = λ k p k 2, for all k = 1,..., K, where π = π when x k 1 < x k 2 and π = π when x k 1 > x k 2. The number alo atify that v k v k when xk > x k. Proof. To prove ufficiency, let v k, λ k, = 1, 2, k = 1,..., K, and π, π 0 with π π be a in the tatement of the lemma. Define µ, µ (S) a follow. Let µ 1 = π/(1 + π) µ 2 = 1/(1 + π) and µ 1 = π/(1 + π) µ 2 = 1/(1 + π) Note that µ 1 µ 1 and µ 2 µ 2, a π π. Define θ k = λ k /(1 + π) if x k 1 < x k 2 and θ k = λ k /(1 + π) if
15 TRANSLATION INVARIANCE AND HOMOTHETICITY 15 x k 1 > x k 2. Then we have that µ v k 1 = θ k p k 2, with µ = µ when x k 1 < x k 2; and µ = µ when x k 1 > x k 2. Given the number v k it i now routine to define a correpondence ρ uch that if x x, y ρ(x) and y ρ(x ) then y y > 0, and with ρ(x k ) v k. Thi give a concave and increaing function u with u(c) = ρ(x). So θk p k µ u(x k ) for all (x, ), and hence the firt order condition are atified for maxmin rationalization. We omit the proof of neceity. Let A be a matrix with 2K K + 1 column, and 2K row. The firt 2K column are labeled with a different pair (k, ). The next 2 column are labeled π and π. The next K column are labeled with a k {1,..., K}. Finally the lat column i labeled p. For each (k, ) with k K 1, A ha a row with all zero entrie with the following exception. It ha a 1 in the column labeled (k, ), among the firt group of 2K column. It ha a 1 in the column labeled k. In the column labeled p it ha log(p k ). Finally, if = 1 then it ha a 1 in the column labeled π. For each (k, ) with k K 2, A ha a row defined a above. The only difference i that when = 1 then it ha a 1 in the column labeled π intead of having one in π. Let B be a matrix with the ame number of column a A, and one row for each pair (x k, x k ) with xk > x k. The column of B are labeled like thoe of A. The row for x k > x k ha all zeroe except for a 1 in column (k, ) and a 1 in column (k, ). Finally, B ha one more row. Thi row a a 1 in the column for π and a 1 in the column for π, and it i labeled = 1 for future reference. Let E be a matrix with the ame number of column a A, labeled a above, and a ingle row. The row ha all zeroe except for a 1 in column p. By Lemma 8, there i no rationalizing maxmin preference if and only if there i no olution to the ytem of inequalitie A x = 0, B x 0 and E x > 0.
16 16 CHAMBERS, ECHENIQUE, AND SAITO Suppoe that all log(p k ) are rational number. We hall ue the following verion of the Theorem of the Alternative, which can be found a Theorem in (Stoer and Witzgall, 1970). 9. Lemma. Let A be an m n matrix, B be an l n matrix, and E be an r n matrix. Suppoe that the entrie of the matrice A, B, and E belong to a commutative ordered field F. Exactly one of the following alternative i true. (1) There i u F n uch that A u = 0, B u 0, E u 0. (2) There i θ F r, η F l, and π F m uch that θ A + η B + π E = 0; π > 0 and η 0. Then the non-exitence of a olution to the ytem A x = 0, B x 0 and E x > 0 i equivalent to the exitence of integer vector η, θ and γ uch that θ 0, γ > 0, and η A + θ B + γe = 0. For a matrix D with 2K K + 1 column, let D 1 denote the ubmatrix correponding to the firt 2K column, D 2 correpond to the next 2, D 3 to the next K, and D 4 to the lat column. Note that, by contruction of A, B and E, η A + θ B + γe = 0 implie that η A 1 + θ B 1 = 0, η A 2 + θ B 2 = 0, η A 3 = 0, η A 4 + γ = 0. In fact, we can without lo aume that η, θ and γ take value of 1, 0 or 1. (Thi aumption i without lo becaue we can replace each row of matrice A, B and E with a many copie a indicated by the correponding vector η, θ or γ.) From the exitence of uch vector it follow that we can obtain a equence (x k i i, x k i ) n i=1 with x k i i i > x k i. The ource of each pair (x k i i i, x k i i) i that the column (k i, i ) of A i multiplied by η (ki, i ) > 0 and the column (k i, i) of A i multiplied by η (k i, i ) < 0. The vector η mut then have η (ki, i ) > 0 and η (k i, i ) > 0, with a 1 in the firt column and a 1 in the econd. We hall prove that the equence (x k i i, x k i i) n i=1 atifie the propertie tated in the axiom. Firtly, η A 3 = 0 mean that for each k, the number of i for which k = k i equal the number of i for which k = k i.
17 TRANSLATION INVARIANCE AND HOMOTHETICITY 17 Secondly, η A 2 + θ B 2 = 0 implie that: k K 1 η (k,1) + θ =1 = 0 k K 2 η (k,1) θ =1 = 0. Note that k K 1 η (k,1) = {i : k i K 1, = 1} {i : k i K 1, = 1}, and imilarly for k K 2 η (k,1). Hence, a {i : k i K 1 and i = 1} {i : k i K 1 and i = 1} = {i : k i K 2 and i = 1} {i : k i K 2 and i = 1} 0, η (k,1) = η (k,1) = θ =1 0. k K 1 k K 2 Therefore the equence (x k i i, x k i i) n i=1 atifie the econd property tated in the axiom. Finally, n i=1 a η A + γ = 0. Hence log(p k i /p k i i i ) = η (k,) = γ < 0, (k,)) n i=1 p k i i p k i i > 1. The above proof aume that the log of price i rational. The proof of the theorem follow along the ame line a Echenique and Saito (2013). Specifically, we have hown the following 10. Lemma. If {(x k, p k )} i a dataet atifying SARMU, in which log p k Q for all k, then the dataet i maxmin rationalizable. One can then prove the following 11. Lemma. If {(x k, p k )} i a dataet that atifie SARMU, and ε > 0 then there i a collection of price {q k )} uch that log q k Q +, p k q k < ε, and the dataet {(x k, q k )} atifie SARMU.
18 18 CHAMBERS, ECHENIQUE, AND SAITO The proof of Lemma 11 i exactly a in (Echenique and Saito, 2013). Lemma 10 etablihe the reult in dataet in which the log of price i rational. Conider an arbitrary data et {(x k, p k )}, with price that may not be rational. Suppoe toward a contradiction that the dataet atifie SARMU, but that it i not maxmin rational. Specifically then, by Lemma 8, uppoe that there i no olution to the ytem A x = 0, B x 0 and E x > 0. Then by Lemma 9 there are real vector η, θ and γ uch that θ 0, γ > 0, and η A + θ B + γe = 0. Let (q k ) K k=1 be vector of price uch that the dataet (xk, q k ) K k=1 atifie SARMU and log q k Q for all k and. (Such (q k ) K k=1 exit by Lemma 11.) Furthermore, the price q k can be choen arbitrarily cloe to p k. Contruct matrice A, B, and E from thi dataet in the ame way a A, B, and E above. Note that only the price are different in {(x k, q k )} compared to {(x k, p k )}. So E = E, B = B and A i = A i for i = 1, 2, 3. Since only price q k are different in thi dataet, only A 4 may be different from A 4. By Lemma 11, we can chooe price q k uch that θ A 4 θ A 4 < γ/2. We have hown that θ A 4 = γ, o the choice of price q k guarantee that θ A 4 < 0. Let γ = θ A 4 > 0. Note that θ A i + η B i + γ E i = 0 for i = 1, 2, 3. And B 4 = 0 o θ A 4 + η B 4 + γ E 4 = θ A 4 + γ = 0. We alo have that η 0 and γ > 0. Therefore θ, η, and γ exhibit a olution to the dual ytem for dataet {(x k, q k )}, a contradiction with Lemma 10. Reference Ahn, D., S. Choi, D. Gale, and S. Kariv (2014): Etimating ambiguity averion in a portfolio choice experiment, Forthcoming, Quantitative Economic. Bayer, R., S. Boe, M. Polion, and L. Renou (2012): Ambiguity Revealed, Mimeo, Univerity of Eex.
19 TRANSLATION INVARIANCE AND HOMOTHETICITY 19 Boaert, P., P. Ghirardato, S. Guarnachelli, and W. R. Zame (2010): Ambiguity in aet market: Theory and experiment, Review of Financial Studie, 23, Brown, D. J. and C. Calamiglia (2007): The Nonparametric Approach to Applied Welfare Analyi, Economic Theory, 31, Echenique, F. and K. Saito (2013): Savage in the market, Caltech SS Working Paper Gilboa, I. and D. Schmeidler (1989): Maxmin expected utility with non-unique prior, Journal of mathematical economic, 18, Grant, S. and B. Polak (2013): Mean-diperion preference and contant abolute uncertainty averion, Journal of Economic Theory, 148, Hanen, L. P. and T. J. Sargent (2008): Robutne, Princeton univerity pre. Hey, J. and N. Pace (2014): The explanatory and predictive power of non two-tage-probability theorie of deciion making under ambiguity, Journal of Rik and Uncertainty, 49, Kubler, F., L. Selden, and X. Wei (2014): Aet Demand Baed Tet of Expected Utility Maximization, American Economic Review, forthcoming. Maccheroni, F., M. Marinacci, and A. Rutichini (2006): Ambiguity Averion, Robutne, and the Variational Repreentation of Preference, Econometrica, 74, Polion, M. and J. Quah (2013): Revealed preference tet under rik and uncertainty, Working Paper 13/24 Univerity of Leiceter. Stoer, J. and C. Witzgall (1970): Convexity and optimization in finite dimenion, Springer-Verlag Berlin. Varian, H. R. (1988): Etimating rik averion from Arrow-Debreu portfolio choice, Econometrica, 43,
ONLINE APPENDIX: TESTABLE IMPLICATIONS OF TRANSLATION INVARIANCE AND HOMOTHETICITY: VARIATIONAL, MAXMIN, CARA AND CRRA PREFERENCES
ONLINE APPENDIX: TESTABLE IMPLICATIONS OF TRANSLATION INVARIANCE AND HOMOTHETICITY: VARIATIONAL, MAXMIN, CARA AND CRRA PREFERENCES CHRISTOPHER P. CHAMBERS, FEDERICO ECHENIQUE, AND KOTA SAITO In thi online
More informationSavage in the Market 1
Savage in the Market 1 Federico Echenique Caltech Kota Saito Caltech January 22, 2015 1 We thank Kim Border and Chri Chamber for inpiration, comment and advice. Matt Jackon uggetion led to ome of the application
More informationSavage in the Market 1
Savage in the Market 1 Federico Echenique Caltech Kota Saito Caltech Augut 4, 2014 1 We thank Kim Border and Chri Chamber for inpiration, comment and advice. Matt Jackon uggetion led to ome of the application
More informationLecture 21. The Lovasz splitting-off lemma Topics in Combinatorial Optimization April 29th, 2004
18.997 Topic in Combinatorial Optimization April 29th, 2004 Lecture 21 Lecturer: Michel X. Goeman Scribe: Mohammad Mahdian 1 The Lovaz plitting-off lemma Lovaz plitting-off lemma tate the following. Theorem
More informationConvex Hulls of Curves Sam Burton
Convex Hull of Curve Sam Burton 1 Introduction Thi paper will primarily be concerned with determining the face of convex hull of curve of the form C = {(t, t a, t b ) t [ 1, 1]}, a < b N in R 3. We hall
More informationSOME RESULTS ON INFINITE POWER TOWERS
NNTDM 16 2010) 3, 18-24 SOME RESULTS ON INFINITE POWER TOWERS Mladen Vailev - Miana 5, V. Hugo Str., Sofia 1124, Bulgaria E-mail:miana@abv.bg Abtract To my friend Kratyu Gumnerov In the paper the infinite
More informationTRIPLE SOLUTIONS FOR THE ONE-DIMENSIONAL
GLASNIK MATEMATIČKI Vol. 38583, 73 84 TRIPLE SOLUTIONS FOR THE ONE-DIMENSIONAL p-laplacian Haihen Lü, Donal O Regan and Ravi P. Agarwal Academy of Mathematic and Sytem Science, Beijing, China, National
More informationProblem Set 8 Solutions
Deign and Analyi of Algorithm April 29, 2015 Maachuett Intitute of Technology 6.046J/18.410J Prof. Erik Demaine, Srini Devada, and Nancy Lynch Problem Set 8 Solution Problem Set 8 Solution Thi problem
More informationAn Inequality for Nonnegative Matrices and the Inverse Eigenvalue Problem
An Inequality for Nonnegative Matrice and the Invere Eigenvalue Problem Robert Ream Program in Mathematical Science The Univerity of Texa at Dalla Box 83688, Richardon, Texa 7583-688 Abtract We preent
More informationComputers and Mathematics with Applications. Sharp algebraic periodicity conditions for linear higher order
Computer and Mathematic with Application 64 (2012) 2262 2274 Content lit available at SciVere ScienceDirect Computer and Mathematic with Application journal homepage: wwweleviercom/locate/camwa Sharp algebraic
More informationarxiv: v1 [math.mg] 25 Aug 2011
ABSORBING ANGLES, STEINER MINIMAL TREES, AND ANTIPODALITY HORST MARTINI, KONRAD J. SWANEPOEL, AND P. OLOFF DE WET arxiv:08.5046v [math.mg] 25 Aug 20 Abtract. We give a new proof that a tar {op i : i =,...,
More informationSocial Studies 201 Notes for November 14, 2003
1 Social Studie 201 Note for November 14, 2003 Etimation of a mean, mall ample ize Section 8.4, p. 501. When a reearcher ha only a mall ample ize available, the central limit theorem doe not apply to the
More informationSocial Studies 201 Notes for March 18, 2005
1 Social Studie 201 Note for March 18, 2005 Etimation of a mean, mall ample ize Section 8.4, p. 501. When a reearcher ha only a mall ample ize available, the central limit theorem doe not apply to the
More informationBogoliubov Transformation in Classical Mechanics
Bogoliubov Tranformation in Claical Mechanic Canonical Tranformation Suppoe we have a et of complex canonical variable, {a j }, and would like to conider another et of variable, {b }, b b ({a j }). How
More informationc n b n 0. c k 0 x b n < 1 b k b n = 0. } of integers between 0 and b 1 such that x = b k. b k c k c k
1. Exitence Let x (0, 1). Define c k inductively. Suppoe c 1,..., c k 1 are already defined. We let c k be the leat integer uch that x k An eay proof by induction give that and for all k. Therefore c n
More informationarxiv: v2 [math.nt] 30 Apr 2015
A THEOREM FOR DISTINCT ZEROS OF L-FUNCTIONS École Normale Supérieure arxiv:54.6556v [math.nt] 3 Apr 5 943 Cachan November 9, 7 Abtract In thi paper, we etablih a imple criterion for two L-function L and
More informationPreemptive scheduling on a small number of hierarchical machines
Available online at www.ciencedirect.com Information and Computation 06 (008) 60 619 www.elevier.com/locate/ic Preemptive cheduling on a mall number of hierarchical machine György Dóa a, Leah Eptein b,
More informationChapter 4. The Laplace Transform Method
Chapter 4. The Laplace Tranform Method The Laplace Tranform i a tranformation, meaning that it change a function into a new function. Actually, it i a linear tranformation, becaue it convert a linear combination
More informationOnline Appendix for Managerial Attention and Worker Performance by Marina Halac and Andrea Prat
Online Appendix for Managerial Attention and Worker Performance by Marina Halac and Andrea Prat Thi Online Appendix contain the proof of our reult for the undicounted limit dicued in Section 2 of the paper,
More informationAvoiding Forbidden Submatrices by Row Deletions
Avoiding Forbidden Submatrice by Row Deletion Sebatian Wernicke, Jochen Alber, Jen Gramm, Jiong Guo, and Rolf Niedermeier Wilhelm-Schickard-Intitut für Informatik, niverität Tübingen, Sand 13, D-72076
More informationAssignment for Mathematics for Economists Fall 2016
Due date: Mon. Nov. 1. Reading: CSZ, Ch. 5, Ch. 8.1 Aignment for Mathematic for Economit Fall 016 We now turn to finihing our coverage of concavity/convexity. There are two part: Jenen inequality for concave/convex
More informationList coloring hypergraphs
Lit coloring hypergraph Penny Haxell Jacque Vertraete Department of Combinatoric and Optimization Univerity of Waterloo Waterloo, Ontario, Canada pehaxell@uwaterloo.ca Department of Mathematic Univerity
More informationIEOR 3106: Fall 2013, Professor Whitt Topics for Discussion: Tuesday, November 19 Alternating Renewal Processes and The Renewal Equation
IEOR 316: Fall 213, Profeor Whitt Topic for Dicuion: Tueday, November 19 Alternating Renewal Procee and The Renewal Equation 1 Alternating Renewal Procee An alternating renewal proce alternate between
More informationSOLUTIONS TO ALGEBRAIC GEOMETRY AND ARITHMETIC CURVES BY QING LIU. I will collect my solutions to some of the exercises in this book in this document.
SOLUTIONS TO ALGEBRAIC GEOMETRY AND ARITHMETIC CURVES BY QING LIU CİHAN BAHRAN I will collect my olution to ome of the exercie in thi book in thi document. Section 2.1 1. Let A = k[[t ]] be the ring of
More informationCHAPTER 8 OBSERVER BASED REDUCED ORDER CONTROLLER DESIGN FOR LARGE SCALE LINEAR DISCRETE-TIME CONTROL SYSTEMS
CHAPTER 8 OBSERVER BASED REDUCED ORDER CONTROLLER DESIGN FOR LARGE SCALE LINEAR DISCRETE-TIME CONTROL SYSTEMS 8.1 INTRODUCTION 8.2 REDUCED ORDER MODEL DESIGN FOR LINEAR DISCRETE-TIME CONTROL SYSTEMS 8.3
More informationTCER WORKING PAPER SERIES GOLDEN RULE OPTIMALITY IN STOCHASTIC OLG ECONOMIES. Eisei Ohtaki. June 2012
TCER WORKING PAPER SERIES GOLDEN RULE OPTIMALITY IN STOCHASTIC OLG ECONOMIES Eiei Ohtaki June 2012 Working Paper E-44 http://www.tcer.or.jp/wp/pdf/e44.pdf TOKYO CENTER FOR ECONOMIC RESEARCH 1-7-10 Iidabahi,
More information7.2 INVERSE TRANSFORMS AND TRANSFORMS OF DERIVATIVES 281
72 INVERSE TRANSFORMS AND TRANSFORMS OF DERIVATIVES 28 and i 2 Show how Euler formula (page 33) can then be ued to deduce the reult a ( a) 2 b 2 {e at co bt} {e at in bt} b ( a) 2 b 2 5 Under what condition
More informationON A CERTAIN FAMILY OF QUARTIC THUE EQUATIONS WITH THREE PARAMETERS. Volker Ziegler Technische Universität Graz, Austria
GLASNIK MATEMATIČKI Vol. 1(61)(006), 9 30 ON A CERTAIN FAMILY OF QUARTIC THUE EQUATIONS WITH THREE PARAMETERS Volker Ziegler Techniche Univerität Graz, Autria Abtract. We conider the parameterized Thue
More informationUnbounded solutions of second order discrete BVPs on infinite intervals
Available online at www.tjna.com J. Nonlinear Sci. Appl. 9 206), 357 369 Reearch Article Unbounded olution of econd order dicrete BVP on infinite interval Hairong Lian a,, Jingwu Li a, Ravi P Agarwal b
More information(b) Is the game below solvable by iterated strict dominance? Does it have a unique Nash equilibrium?
14.1 Final Exam Anwer all quetion. You have 3 hour in which to complete the exam. 1. (60 Minute 40 Point) Anwer each of the following ubquetion briefly. Pleae how your calculation and provide rough explanation
More informationNew bounds for Morse clusters
New bound for More cluter Tamá Vinkó Advanced Concept Team, European Space Agency, ESTEC Keplerlaan 1, 2201 AZ Noordwijk, The Netherland Tama.Vinko@ea.int and Arnold Neumaier Fakultät für Mathematik, Univerität
More informationON THE APPROXIMATION ERROR IN HIGH DIMENSIONAL MODEL REPRESENTATION. Xiaoqun Wang
Proceeding of the 2008 Winter Simulation Conference S. J. Maon, R. R. Hill, L. Mönch, O. Roe, T. Jefferon, J. W. Fowler ed. ON THE APPROXIMATION ERROR IN HIGH DIMENSIONAL MODEL REPRESENTATION Xiaoqun Wang
More informationOne Class of Splitting Iterative Schemes
One Cla of Splitting Iterative Scheme v Ciegi and V. Pakalnytė Vilniu Gedimina Technical Univerity Saulėtekio al. 11, 2054, Vilniu, Lithuania rc@fm.vtu.lt Abtract. Thi paper deal with the tability analyi
More informationarxiv: v4 [math.co] 21 Sep 2014
ASYMPTOTIC IMPROVEMENT OF THE SUNFLOWER BOUND arxiv:408.367v4 [math.co] 2 Sep 204 JUNICHIRO FUKUYAMA Abtract. A unflower with a core Y i a family B of et uch that U U Y for each two different element U
More informationON A CERTAIN FAMILY OF QUARTIC THUE EQUATIONS WITH THREE PARAMETERS
ON A CERTAIN FAMILY OF QUARTIC THUE EQUATIONS WITH THREE PARAMETERS VOLKER ZIEGLER Abtract We conider the parameterized Thue equation X X 3 Y (ab + (a + bx Y abxy 3 + a b Y = ±1, where a, b 1 Z uch that
More informationA Constraint Propagation Algorithm for Determining the Stability Margin. The paper addresses the stability margin assessment for linear systems
A Contraint Propagation Algorithm for Determining the Stability Margin of Linear Parameter Circuit and Sytem Lubomir Kolev and Simona Filipova-Petrakieva Abtract The paper addree the tability margin aement
More informationStochastic Neoclassical Growth Model
Stochatic Neoclaical Growth Model Michael Bar May 22, 28 Content Introduction 2 2 Stochatic NGM 2 3 Productivity Proce 4 3. Mean........................................ 5 3.2 Variance......................................
More informationTechnical Appendix: Auxiliary Results and Proofs
A Technical Appendix: Auxiliary Reult and Proof Lemma A. The following propertie hold for q (j) = F r [c + ( ( )) ] de- ned in Lemma. (i) q (j) >, 8 (; ]; (ii) R q (j)d = ( ) q (j) + R q (j)d ; (iii) R
More informationMATEMATIK Datum: Tid: eftermiddag. A.Heintz Telefonvakt: Anders Martinsson Tel.:
MATEMATIK Datum: 20-08-25 Tid: eftermiddag GU, Chalmer Hjälpmedel: inga A.Heintz Telefonvakt: Ander Martinon Tel.: 073-07926. Löningar till tenta i ODE och matematik modellering, MMG5, MVE6. Define what
More informationClustering Methods without Given Number of Clusters
Clutering Method without Given Number of Cluter Peng Xu, Fei Liu Introduction A we now, mean method i a very effective algorithm of clutering. It mot powerful feature i the calability and implicity. However,
More informationOPTIMAL STOPPING FOR SHEPP S URN WITH RISK AVERSION
OPTIMAL STOPPING FOR SHEPP S URN WITH RISK AVERSION ROBERT CHEN 1, ILIE GRIGORESCU 1 AND MIN KANG 2 Abtract. An (m, p) urn contain m ball of value 1 and p ball of value +1. A player tart with fortune k
More informationMulticolor Sunflowers
Multicolor Sunflower Dhruv Mubayi Lujia Wang October 19, 2017 Abtract A unflower i a collection of ditinct et uch that the interection of any two of them i the ame a the common interection C of all of
More informationIndividual Choice Under Uncertainty
Chapter 3 Individual Choice Under Uncertainty Up to now: individual choice had completely predictable conequence they were de ned imply over di erent conumption bundle x 2 R H +. However, one often can/mut
More informationSuggested Answers To Exercises. estimates variability in a sampling distribution of random means. About 68% of means fall
Beyond Significance Teting ( nd Edition), Rex B. Kline Suggeted Anwer To Exercie Chapter. The tatitic meaure variability among core at the cae level. In a normal ditribution, about 68% of the core fall
More informationOptimal Strategies for Utility from Terminal Wealth with General Bid and Ask Prices
http://doi.org/10.1007/00245-018-9550-5 Optimal Strategie for Utility from Terminal Wealth with General Bid and Ak Price Tomaz Rogala 1 Lukaz Stettner 2 The Author 2018 Abtract In the paper we tudy utility
More informationA CATEGORICAL CONSTRUCTION OF MINIMAL MODEL
A ATEGORIAL ONSTRUTION OF MINIMAL MODEL A. Behera, S. B. houdhury M. Routaray Department of Mathematic National Intitute of Technology ROURKELA - 769008 (India) abehera@nitrkl.ac.in 512ma6009@nitrkl.ac.in
More informationMinimal state space realization of MIMO systems in the max algebra
KULeuven Department of Electrical Engineering (ESAT) SISTA Technical report 94-54 Minimal tate pace realization of MIMO ytem in the max algebra B De Schutter and B De Moor If you want to cite thi report
More informationLecture 8: Period Finding: Simon s Problem over Z N
Quantum Computation (CMU 8-859BB, Fall 205) Lecture 8: Period Finding: Simon Problem over Z October 5, 205 Lecturer: John Wright Scribe: icola Rech Problem A mentioned previouly, period finding i a rephraing
More informationFebruary 5, :53 WSPC/INSTRUCTION FILE Mild solution for quasilinear pde
February 5, 14 1:53 WSPC/INSTRUCTION FILE Mild olution for quailinear pde Infinite Dimenional Analyi, Quantum Probability and Related Topic c World Scientific Publihing Company STOCHASTIC QUASI-LINEAR
More informationLecture 3. January 9, 2018
Lecture 3 January 9, 208 Some complex analyi Although you might have never taken a complex analyi coure, you perhap till know what a complex number i. It i a number of the form z = x + iy, where x and
More informationREVERSE HÖLDER INEQUALITIES AND INTERPOLATION
REVERSE HÖLDER INEQUALITIES AND INTERPOLATION J. BASTERO, M. MILMAN, AND F. J. RUIZ Abtract. We preent new method to derive end point verion of Gehring Lemma uing interpolation theory. We connect revere
More informationLecture 7: Testing Distributions
CSE 5: Sublinear (and Streaming) Algorithm Spring 014 Lecture 7: Teting Ditribution April 1, 014 Lecturer: Paul Beame Scribe: Paul Beame 1 Teting Uniformity of Ditribution We return today to property teting
More informationNonlinear Single-Particle Dynamics in High Energy Accelerators
Nonlinear Single-Particle Dynamic in High Energy Accelerator Part 6: Canonical Perturbation Theory Nonlinear Single-Particle Dynamic in High Energy Accelerator Thi coure conit of eight lecture: 1. Introduction
More informationHyperbolic Partial Differential Equations
Hyperbolic Partial Differential Equation Evolution equation aociated with irreverible phyical procee like diffuion heat conduction lead to parabolic partial differential equation. When the equation i a
More informationPacific Journal of Mathematics
Pacific Journal of Mathematic OSCILLAION AND NONOSCILLAION OF FORCED SECOND ORDER DYNAMIC EQUAIONS MARIN BOHNER AND CHRISOPHER C. ISDELL Volume 230 No. March 2007 PACIFIC JOURNAL OF MAHEMAICS Vol. 230,
More informationApproximate Expected Utility Rationalization
7348 18 November 18 Approximate Expected Utility Rationalization Federico Echenique, Taiuke Imai, Kota Saito Impreum: CESifo Working Paper ISSN 364 148 (electronic verion) Publiher and ditributor: Munich
More informationGeneral System of Nonconvex Variational Inequalities and Parallel Projection Method
Mathematica Moravica Vol. 16-2 (2012), 79 87 General Sytem of Nonconvex Variational Inequalitie and Parallel Projection Method Balwant Singh Thakur and Suja Varghee Abtract. Uing the prox-regularity notion,
More informationCS 170: Midterm Exam II University of California at Berkeley Department of Electrical Engineering and Computer Sciences Computer Science Division
1 1 April 000 Demmel / Shewchuk CS 170: Midterm Exam II Univerity of California at Berkeley Department of Electrical Engineering and Computer Science Computer Science Diviion hi i a cloed book, cloed calculator,
More informationPhysics 741 Graduate Quantum Mechanics 1 Solutions to Final Exam, Fall 2014
Phyic 7 Graduate Quantum Mechanic Solution to inal Eam all 0 Each quetion i worth 5 point with point for each part marked eparately Some poibly ueful formula appear at the end of the tet In four dimenion
More information4.6 Principal trajectories in terms of amplitude and phase function
4.6 Principal trajectorie in term of amplitude and phae function We denote with C() and S() the coinelike and inelike trajectorie relative to the tart point = : C( ) = S( ) = C( ) = S( ) = Both can be
More informationStochastic Optimization with Inequality Constraints Using Simultaneous Perturbations and Penalty Functions
Stochatic Optimization with Inequality Contraint Uing Simultaneou Perturbation and Penalty Function I-Jeng Wang* and Jame C. Spall** The John Hopkin Univerity Applied Phyic Laboratory 11100 John Hopkin
More informationCodes Correcting Two Deletions
1 Code Correcting Two Deletion Ryan Gabry and Frederic Sala Spawar Sytem Center Univerity of California, Lo Angele ryan.gabry@navy.mil fredala@ucla.edu Abtract In thi work, we invetigate the problem of
More informationON THE SMOOTHNESS OF SOLUTIONS TO A SPECIAL NEUMANN PROBLEM ON NONSMOOTH DOMAINS
Journal of Pure and Applied Mathematic: Advance and Application Volume, umber, 4, Page -35 O THE SMOOTHESS OF SOLUTIOS TO A SPECIAL EUMA PROBLEM O OSMOOTH DOMAIS ADREAS EUBAUER Indutrial Mathematic Intitute
More informationNotes on Strategic Substitutes and Complements in Global Games
Note on Strategic Subtitute an Complement in Global Game Stephen Morri Cowle Founation, Yale Univerity, POBox 208281, New Haven CT 06520, U S A tephenmorri@yaleeu Hyun Song Shin Lonon School of Economic,
More informationWELL-POSEDNESS OF A ONE-DIMENSIONAL PLASMA MODEL WITH A HYPERBOLIC FIELD
WELL-POSEDNESS OF A ONE-DIMENSIONAL PLASMA MODEL WITH A HYPERBOLIC FIELD JENNIFER RAE ANDERSON 1. Introduction A plama i a partially or completely ionized ga. Nearly all (approximately 99.9%) of the matter
More informationMAE140 Linear Circuits Fall 2012 Final, December 13th
MAE40 Linear Circuit Fall 202 Final, December 3th Intruction. Thi exam i open book. You may ue whatever written material you chooe, including your cla note and textbook. You may ue a hand calculator with
More informationSuggestions - Problem Set (a) Show the discriminant condition (1) takes the form. ln ln, # # R R
Suggetion - Problem Set 3 4.2 (a) Show the dicriminant condition (1) take the form x D Ð.. Ñ. D.. D. ln ln, a deired. We then replace the quantitie. 3ß D3 by their etimate to get the proper form for thi
More informationBeta Burr XII OR Five Parameter Beta Lomax Distribution: Remarks and Characterizations
Marquette Univerity e-publication@marquette Mathematic, Statitic and Computer Science Faculty Reearch and Publication Mathematic, Statitic and Computer Science, Department of 6-1-2014 Beta Burr XII OR
More informationA PROOF OF TWO CONJECTURES RELATED TO THE ERDÖS-DEBRUNNER INEQUALITY
Volume 8 2007, Iue 3, Article 68, 3 pp. A PROOF OF TWO CONJECTURES RELATED TO THE ERDÖS-DEBRUNNER INEQUALITY C. L. FRENZEN, E. J. IONASCU, AND P. STĂNICĂ DEPARTMENT OF APPLIED MATHEMATICS NAVAL POSTGRADUATE
More informationControl Systems Analysis and Design by the Root-Locus Method
6 Control Sytem Analyi and Deign by the Root-Locu Method 6 1 INTRODUCTION The baic characteritic of the tranient repone of a cloed-loop ytem i cloely related to the location of the cloed-loop pole. If
More informationLecture 17: Analytic Functions and Integrals (See Chapter 14 in Boas)
Lecture 7: Analytic Function and Integral (See Chapter 4 in Boa) Thi i a good point to take a brief detour and expand on our previou dicuion of complex variable and complex function of complex variable.
More informationUNIT 15 RELIABILITY EVALUATION OF k-out-of-n AND STANDBY SYSTEMS
UNIT 1 RELIABILITY EVALUATION OF k-out-of-n AND STANDBY SYSTEMS Structure 1.1 Introduction Objective 1.2 Redundancy 1.3 Reliability of k-out-of-n Sytem 1.4 Reliability of Standby Sytem 1. Summary 1.6 Solution/Anwer
More informationMath 273 Solutions to Review Problems for Exam 1
Math 7 Solution to Review Problem for Exam True or Fale? Circle ONE anwer for each Hint: For effective tudy, explain why if true and give a counterexample if fale (a) T or F : If a b and b c, then a c
More informationLinear System Fundamentals
Linear Sytem Fundamental MEM 355 Performance Enhancement of Dynamical Sytem Harry G. Kwatny Department of Mechanical Engineering & Mechanic Drexel Univerity Content Sytem Repreentation Stability Concept
More informationarxiv: v3 [quant-ph] 23 Nov 2011
Generalized Bell Inequality Experiment and Computation arxiv:1108.4798v3 [quant-ph] 23 Nov 2011 Matty J. Hoban, 1, 2 Joel J. Wallman, 3 and Dan E. Browne 1 1 Department of Phyic and Atronomy, Univerity
More informationThe Hassenpflug Matrix Tensor Notation
The Haenpflug Matrix Tenor Notation D.N.J. El Dept of Mech Mechatron Eng Univ of Stellenboch, South Africa e-mail: dnjel@un.ac.za 2009/09/01 Abtract Thi i a ample document to illutrate the typeetting of
More informationResearch Article Existence for Nonoscillatory Solutions of Higher-Order Nonlinear Differential Equations
International Scholarly Reearch Network ISRN Mathematical Analyi Volume 20, Article ID 85203, 9 page doi:0.502/20/85203 Reearch Article Exitence for Nonocillatory Solution of Higher-Order Nonlinear Differential
More informationOptimization model in Input output analysis and computable general. equilibrium by using multiple criteria non-linear programming.
Optimization model in Input output analyi and computable general equilibrium by uing multiple criteria non-linear programming Jing He * Intitute of ytem cience, cademy of Mathematic and ytem cience Chinee
More informationarxiv: v1 [quant-ph] 22 Oct 2010
The extenion problem for partial Boolean tructure in Quantum Mechanic Cotantino Budroni 1 and Giovanni Morchio 1, 2 1) Dipartimento di Fiica, Univerità di Pia, Italy 2) INFN, Sezione di Pia, Italy Alternative
More informationUtility Proportional Fair Bandwidth Allocation: An Optimization Oriented Approach
Utility Proportional Fair Bandwidth Allocation: An Optimization Oriented Approach 61 Tobia Hark Konrad-Zue-Zentrum für Informationtechnik Berlin (ZIB), Department Optimization, Takutr. 7, 14195 Berlin,
More informationSimple Observer Based Synchronization of Lorenz System with Parametric Uncertainty
IOSR Journal of Electrical and Electronic Engineering (IOSR-JEEE) ISSN: 78-676Volume, Iue 6 (Nov. - Dec. 0), PP 4-0 Simple Oberver Baed Synchronization of Lorenz Sytem with Parametric Uncertainty Manih
More informationarxiv: v1 [math.ac] 30 Nov 2012
ON MODULAR INVARIANTS OF A VECTOR AND A COVECTOR YIN CHEN arxiv:73v [mathac 3 Nov Abtract Let S L (F q be the pecial linear group over a finite field F q, V be the -dimenional natural repreentation of
More informationCOHOMOLOGY AS A LOCAL-TO-GLOBAL BRIDGE
COHOMOLOGY AS A LOCAL-TO-GLOBAL BRIDGE LIVIU I. NICOLAESCU ABSTRACT. I dicu low dimenional incarnation of cohomology and illutrate how baic cohomological principle lead to a proof of Sperner lemma. CONTENTS.
More informationA SIMPLE NASH-MOSER IMPLICIT FUNCTION THEOREM IN WEIGHTED BANACH SPACES. Sanghyun Cho
A SIMPLE NASH-MOSER IMPLICIT FUNCTION THEOREM IN WEIGHTED BANACH SPACES Sanghyun Cho Abtract. We prove a implified verion of the Nah-Moer implicit function theorem in weighted Banach pace. We relax the
More informationAssessment of Performance for Single Loop Control Systems
Aement of Performance for Single Loop Control Sytem Hiao-Ping Huang and Jyh-Cheng Jeng Department of Chemical Engineering National Taiwan Univerity Taipei 1617, Taiwan Abtract Aement of performance in
More informationMarch 18, 2014 Academic Year 2013/14
POLITONG - SHANGHAI BASIC AUTOMATIC CONTROL Exam grade March 8, 4 Academic Year 3/4 NAME (Pinyin/Italian)... STUDENT ID Ue only thee page (including the back) for anwer. Do not ue additional heet. Ue of
More informationPrimitive Digraphs with the Largest Scrambling Index
Primitive Digraph with the Larget Scrambling Index Mahmud Akelbek, Steve Kirkl 1 Department of Mathematic Statitic, Univerity of Regina, Regina, Sakatchewan, Canada S4S 0A Abtract The crambling index of
More informationNULL HELIX AND k-type NULL SLANT HELICES IN E 4 1
REVISTA DE LA UNIÓN MATEMÁTICA ARGENTINA Vol. 57, No. 1, 2016, Page 71 83 Publihed online: March 3, 2016 NULL HELIX AND k-type NULL SLANT HELICES IN E 4 1 JINHUA QIAN AND YOUNG HO KIM Abtract. We tudy
More information1. Preliminaries. In [8] the following odd looking integral evaluation is obtained.
June, 5. Revied Augut 8th, 5. VA DER POL EXPASIOS OF L-SERIES David Borwein* and Jonathan Borwein Abtract. We provide concie erie repreentation for variou L-erie integral. Different technique are needed
More informationNCAAPMT Calculus Challenge Challenge #3 Due: October 26, 2011
NCAAPMT Calculu Challenge 011 01 Challenge #3 Due: October 6, 011 A Model of Traffic Flow Everyone ha at ome time been on a multi-lane highway and encountered road contruction that required the traffic
More informationDYNAMIC PREFERENCE FOR FLEXIBILITY. R. VIJAY KRISHNA Duke University, Durham, NC 27708, U.S.A.
http://www.econometricociety.org/ Econometrica, Vol. 82, No. 2 (March, 2014), 655 703 DYNAMIC PREFERENCE FOR FLEXIBILITY R. VIJAY KRISHNA Duke Univerity, Durham, NC 27708, U.S.A. PHILIPP SADOWSKI Duke
More informationMinimizing movements along a sequence of functionals and curves of maximal slope
Minimizing movement along a equence of functional and curve of maximal lope Andrea Braide Dipartimento di Matematica, Univerità di Roma Tor Vergata via della ricerca cientifica 1, 133 Roma, Italy Maria
More informationTheoretical Computer Science. Optimal algorithms for online scheduling with bounded rearrangement at the end
Theoretical Computer Science 4 (0) 669 678 Content lit available at SciVere ScienceDirect Theoretical Computer Science journal homepage: www.elevier.com/locate/tc Optimal algorithm for online cheduling
More informationGeometric Measure Theory
Geometric Meaure Theory Lin, Fall 010 Scribe: Evan Chou Reference: H. Federer, Geometric meaure theory L. Simon, Lecture on geometric meaure theory P. Mittila, Geometry of et and meaure in Euclidean pace
More informationMemoryle Strategie in Concurrent Game with Reachability Objective Λ Krihnendu Chatterjee y Luca de Alfaro x Thoma A. Henzinger y;z y EECS, Univerity o
Memoryle Strategie in Concurrent Game with Reachability Objective Krihnendu Chatterjee, Luca de Alfaro and Thoma A. Henzinger Report No. UCB/CSD-5-1406 Augut 2005 Computer Science Diviion (EECS) Univerity
More informationUSPAS Course on Recirculated and Energy Recovered Linear Accelerators
USPAS Coure on Recirculated and Energy Recovered Linear Accelerator G. A. Krafft and L. Merminga Jefferon Lab I. Bazarov Cornell Lecture 6 7 March 005 Lecture Outline. Invariant Ellipe Generated by a Unimodular
More informationA note on strong convergence for Pettis integrable functions (revision)
note on trong convergence for Petti integrable function (reviion) Erik J. Balder, Mathematical Intitute, Univerity of Utrecht, Utrecht, Netherland nna Rita Sambucini, Dipartimento di Matematica, Univerità
More informationLong-term returns in stochastic interest rate models
Long-term return in tochatic interet rate model G. Deeltra F. Delbaen Vrije Univeriteit Bruel Departement Wikunde Abtract In thi paper, we oberve the convergence of the long-term return, uing an extenion
More informationIntroduction to Laplace Transform Techniques in Circuit Analysis
Unit 6 Introduction to Laplace Tranform Technique in Circuit Analyi In thi unit we conider the application of Laplace Tranform to circuit analyi. A relevant dicuion of the one-ided Laplace tranform i found
More informationOSCILLATIONS OF A CLASS OF EQUATIONS AND INEQUALITIES OF FOURTH ORDER * Zornitza A. Petrova
МАТЕМАТИКА И МАТЕМАТИЧЕСКО ОБРАЗОВАНИЕ, 2006 MATHEMATICS AND EDUCATION IN MATHEMATICS, 2006 Proceeding of the Thirty Fifth Spring Conference of the Union of Bulgarian Mathematician Borovet, April 5 8,
More information