The Existence and Optimality of Equilibrium

Size: px
Start display at page:

Download "The Existence and Optimality of Equilibrium"

Transcription

1 The Exstence and Optmalty of Equlbrum Larry Blume March 29, Introducton These notes quckly survey two approaches to the exstence. The frst approach works wth excess demand, whle the second works wth prmtves, such as preferences, endowments, and the lke, from whch excess demand could be derved. 2 Excess Demand For ths approach n some detal, see Chapter 2 of Arrow and Hahn. Consder frst an exchange economy. Each of I ndvduals has an endowment of L commodtes, ω for ndvdual. Were ndvduals utlty maxmzers, we would derve a demand functon or correspondence, d (p), for the L commodtes, whch depends upon the vector p of market prces. Excess demand for ndvdual n s z (p) = d (p) e, the excess of trader s demand over hs supply. Aggregate excess demand s then Z(p) = z (p). Equlbrum can be defned n terms of excess demand: Defnton 1. A compettve equlbrum s a prce vector p 0 such that Z(p) = 0. Another defnton one often sees s: Defnton 2. A compettve equlbrum s a prce vector p 0 such that Z(p) 0 and p Z(p) = 0. 1

2 2 The dfference between the two s a complementary slackness condton. In the frst, excess demand for each good must be 0. In the second, excess demand for a good could be negatve, but then ts prce must be 0. We are gong to buld a model n ths secton n whch the equlbrum prce wll be strctly postve, that s, all goods wll be demanded n equlbrum. It s a good exercse to consder how to relax the assumptons that are to follow n such a way as to requre the complementary slackness condton. It s mportant to understand that whle excess demand could be derved from utlty maxmzaton, t need not be. We could just thnk of excess demand as arbtrary behavor rules. If aggregate excess demand s suffcently regular, an equlbrum (ether defnton) wll exst. We wll defne demand for consumer formally as a functon The phrase "suffcently regular" means: A.1. Z(p) s homogeneous of degree 0. d : R l ++ R +. If choce s defned on budget sets, then ths axom must hold because the descrpton of a gven budget set s nvarant to changes n scale of the prces whch defne t. Because of homogenety, we can normalze prces, whch s to say that we can choose a scale for prces. It s convenent to choose a scale such that l p l = 1. Let = {p R l ++ : l p l = 1}. Ths set s the unt smplex n R l ++. Because of Axom 1, there s no loss of generalty n assumng and we shall do so from here on out. A.2. For all p R l ++, p Z(p) = 0. Z : R l, Axom 2 s known as Walras law. Why should t be true? For ndvduals, p z n (p) = 0 s merely the clam that ndvdual n consumes on her budget lne, and Walras Law follows from summng. A.3. Z s a contnuous functon on nt, or Z s a correspondence whch s compact-, convex- and non-empty valued, and upper hem-contnuous. If demand s sngle-valued, then contnuty, Axom 3, s a natural assumpton. The assumpton s not requred on the boundary snce we are not assumng demand s well-defned when the prce of a

3 3 good s 0. When excess demand s a correspondence, what does contnuty mean? For a functon, contnuty s the requrement that for every open set O, Z 1 (O) s an open set. For a correspondence, there are two natural notons of nverse: Defne Z w (O) = {p : Z(p) O} and Z s (O) = {p : Z(p) O}. These are the weak and strong nverse of Z, respectvely. The requrement that the weak nverse of an open set be open s called lower hem-contnuty, whle the requrement that the strong nverse of an open set be open s called upper hem-contnuty. (An older lterature uses the termnology sem-contnuty, whch unfortunately was already n play for somethng else.) A correspondence s contnuous f t s both lower- and upper hem-contnuous. If a correspondence s sngleton-valued, t s contnuous f and only f, as a functon, t s a contnuous functon. A.4. Z s bounded below; that s, there s a vector B such that Z(p) B for all p R n ++. If ndvduals can never demand negatve amounts of a commodty, then excess demand s bounded below by e, the aggregate endowment. Ths s Axom 4. More generally, f we assume that consumer s budget sets are all subsets of a consumpton set X and each X s bounded from below, then Axom 4 wll be satsfed. A.5. If p s a prce vector such that for some good, p = 0, then for every sequence of strctly postve prces p n convergng to p, Z(p) +. Fnally, as the prce of a commodty converges to 0, ts demand becomes arbtrarly large. Ths s Axom 5. Actually, t s stronger than Axom 5, whch only requres the demand for some commodty to dverge. Theorem 1. If excess demand Z(p) satsfes Axoms 1 5 on R n ++, then there s a p = 0 such that Z(p ) = 0. How does one prove such a theorem? The problem s a fxed pont problem. The man tool s the followng: Theorem 2 (Brouwer). If C s a compact, convex set and f : C C s a contnuous functon, then there s an x C such that f(x) = x. That s, x remans fxed under the acton of f. Theorem 3 (Kakutan). If C s a compact, convex set and F : C C s an upper hem-contnuous correspondence, then there s an x C such that x F(x).

4 4 Proof. Suppose frst that demand s a contnuous functon. Snce demand s homogeneous of degree 0, prces can be normalzed so that p = 1. Let = {p R n ++} such that p = 1. Ths set s the strctly postve unt smplex n R n. For ǫ > 0, defne ǫ = {p : p ǫ}. These are compact, convex sets. Choose n 1 > ǫ > 0. Snce Z s bounded from below on, max Z (p) < B on. f ǫ (p) = p ( 1 + B 1 Z (p) ) + δ 1 + nδ where δ = ǫ/(1 nǫ). Let f(p) = ( f (p),..., f n (p) ). The term ( 1 + B 1 Z (p) ) s postve. Thus on, f ǫ (p) > ǫ. Furthermore, f ǫ (p) = 1 ( ) 1 + nδ p 1 + B 1 p Z (p) + nδ = 1 ( ) 1 + nδ 1 + nδ = 1 because of Walras Law. Thus f ǫ : ǫ. It s contnuous, and so Brouwer s Theorem mples that f ǫ has a fxed pont p ǫ. Choose a sequence ǫ k 0. The sequence p ǫ k has a subsequence wth a lmt pont p. We wll see that p s a compettve equlbrum. Clearly p 0 and p = 1. We also have that p ǫ k + nδ k p ǫ k = p ǫ k + B 1 Z (p ǫ k) + δ k Frst we need to show that p > 0. Suppose not. Then, takng lmt superors of both sdes, 0 = lm sup B 1 Z (p ǫ k), but ths volates Axom 5. Fnally, snce p and Z s contnuous on, Z(p ) = 0. For the correspondence case, defne the correspondence F such that q F ǫ (p) ff there s a z Z(p) such that q = p ( 1 + B 1 ) z + δ 1 + nδ Ths correspondence s clearly convex- and non-empty valued. For those who are nterested, t s easy to show t s upper hem-contnuous. Thus accordng to Professor Kakutan (the father of Mchko Kakutan, for the lterate among you), the correspondence F ǫ has a fxed pont p ǫ. The proof now proceeds as before.

5 5 The relevant fact for provng that the excess demand correspondence s uhc, whch we shall not prove here, concerns the graph of uhc correspondences. Defnton 3. The graph of a correspondence F : X Y s the set {(x, y) : y F(x)} X Y. Ths s the same defnton as that of the graph of a contnuous functon. Lemma 1. If F : X Y s a correspondence and Y s compact, then F s uhc f and only f ts graph s closed. The mathematcally adept may enjoy provng ths fact. 3 Prvate Ownershp Economes The prvate ownershp economy s a general framework whch fts together producton and consumpton. It locates consumpton n ndvdual consumers and producton n ndvdual frms. Ths s the most general framework n whch we wll examne the emergent propertes of markets the exstence of prce equlbra and ther connecton to optmal allocatons. The model supposes the exstence of I consumers, J frms and L goods. Each consumer s characterzed by a preference order defned on a consumpton set X R L, an endowment bundle ω R L, and a vector θ = (θ j ) J j=1 representng the share of frm j consumer owns. Let ω = ω denote the aggregate endowment of the economy. Each frm s characterzed by a producton set Y j R L. We adopt the conventon that for any vector n a frm s producton set, negatve terms represent nputs and postve terms represent outputs. The ultmate reductonst act of economc theory s to defne an economy thus: Defnton 4. A prvate ownershp economy s a tuple ( (X,, θ, ω ) I =1, (Y j) J j=1). Ths lst contans all the data necessary to derve demand and supply functons, fnd equlbra, and so forth. The behavoral assumptons that go along wth ths are preference maxmzaton by consumers and proft maxmzaton by frms. Note already the ways n whch ths model s restrctve.

6 6 1. Frms are assumed to proft maxmze. What about alternatve, "manageral" goals of frm behavor? How would models of "home producton" ft nto ths framework. 2. There are no consumpton externaltes. Ths btes n several ways: Frst, s preferences cannot be nfluenced by j s actons. There s no way to model your demand for ar freshener on the consumpton of your roommate s cgarettes. Second, ndvduals may have preferences not over ndvdual consumpton but over entre socal states. Consumer s rankngs of her own choces may be nvarant to js consumpton, but js consumpton may nonetheless effect s utlty. Thrd, s consumpton opportuntes may be constraned by js choces. 3. There are no producton externaltes. You can magne the lst of possbltes. A basc defnton of the general compettve model s that of an allocaton: Defnton 5. An allocaton (x, y) s a specfcaton of a consumpton plan for each consumer, a vector x X, and a producton plan for each frm j, a vector y j Y j. An allocaton s feasble ff x = ω + j y j. Followng MWG, the set of feasble allocatons s denoted by A R L(I+J). We wll call x the consumpton allocaton and y the producton allocaton assocated wth the allocaton z = (x, y). 3.1 Compettve Equlbrum One dea behnd compettve equlbrum s that supply equals demand. But snce we have a theory of where supply and demand come from, we are tempted to perce the vale of Marshallan curves and understand compettve equlbrum drectly n terms of the prmtve, atomc economc concepts. Let E = ( (X,, θ, ω ) I =1, (Y j) J j=1) denote a prvate ownershp economy. I m gong to follow MWG here, but n fact one can do much better than ths. Defnton 6. A compettve equlbrum for the economy E s an allocaton (x, y ) and a prce vector p such that 1. For every frm j, y j maxmzes profts among all feasble producton plans n Y j : p y j p y j for all y j Y j.

7 7 2. For every consumer, x s preference-maxmal among all affordable consumpton plans. That s, x x for all x n the set 3. (x, y ) A. {x : x X and p x p ω + θ j p y j }. j Ths defnton s due to Debreu (see Theory of Value, ch. 5.5). Here s hs exstence theorem: Theorem 4. A compettve equlbrum for the prvate ownershp economy E exsts f for every, 1. X s closed, convex and bounded from below, 2. s non-satated n X, 3. the relaton s contnuous, 4. If x x, then for all 0 < t < 1, tx + (1 t)x x, 5. there s an x 0 n X such that ω x 0; for every consumer j, 1. 0 Y j, 2. the aggregate producton set Y = j Y j s closed and convex, 3. Y ( Y) =, 4. Y R L. Just to revew, non-sataton means that for all x X there s an x X such that x x. Contnuty means that for all x the sets {x X : x x } and {x X : x x } are closed n X. Condtons 2 and 4 together mply that preferences are locally non-satated. Condton 5 for consumers s the cheaper pont assumpton. Its purpose s to make sure that demand has the rght contnuty propertes at the boundary of the consumpton set. Suppose that a consumer s consumpton set s R L + and her endowment s the the 0 vector. Imagne a sequence of prces n whch the prce of good 1, say, s always postve, but s convergng to 0. Then demand for good 1 s always 0, but n the lmt s could be strctly postve or even empty. Contnuty mples that the so-called better than sets are open. The set {x X : x x } s the complement of the set {x X : x x }. Smlarly for the worse than sets.

8 8 For the frm, condton 3 states that producton s not reversble. If the aggregate producton plan y s feasble, then the plan y s not. Assumpton 4 s free dsposal. Another useful concept s that of a compettve equlbrum wth transfers. The dea s to fnd market clearng prces after we allow for arbtrary wealth transfers among consumers. Defnton 7. A compettve equlbrum wth transfers for the economy E s an allocaton (x, y ), a prce vector p and an assgnment of wealths (w1,..., w I ) to consumers such that 1. For every frm j, y j maxmzes profts among all feasble producton plans n Y j : p y j p y j for all y j Y j. 2. For every consumer, x s preference-maxmal among all affordable consumpton plans. That s, x x for all x n the set {x : x X and p x w }. 3. (x, y ) A. 4. w = p ω + j p y j. 3.2 Pareto Optmalty The basc noton of socal desrablty s the Pareto order: Defnton 8. A consumpton plan x s Pareto-better than consumpton plan x, wrtten x P x, ff for all, x x, and for some consumer k, x k x k. An allocaton z = (x, y) s Pareto optmal ff t s feasble, and f for no other feasble consumpton plan z = (x, y ) s t true that x P x. How do we know an optmum exsts? In exchange economes ths s not hard. The set of feasble allocatons s obvously compact, so sutable contnuty assumptons on preferences should do the trck. When producton s possble, compactness of the set of feasble allocatons s not so obvous. Debreu (Theory of Value, Ch. 6.2.) gves us an answer. Theorem 5. The prvate ownershp economy E has an optmum f 1. for all, X s closed and bounded from below,

9 9 2. for every x X, the set {x X : x x } s closed, 3. j Y j s closed, convex, and Y R L + = {0}, and 4. ω X j Y j. Proof. There are two parts to the proof. Frst, show that the set A of feasble allocatons s compact, and then to show that a Pareto optmum exsts. We wll do half of the frst part and all of the second. To see that A s closed, let M denote {z = (z 1,..., z I, z I+1,..., z I+J ) R (I+J)L : I+J k=1 z k = I =1 ω }. Ths s an affne subspace of R (I+J)L, hence closed. The set M = I =1 X J j=1 Y j R (I+J)L s the product of closed sets, hence closed. Fnally A = M M, and so s closed. Provng that A s bounded takes some apparatus that we are not gong to ntroduce here. To show that an optmum exsts, defne the relatons on M such that (x, y) (x, y ) ff x x. These relatons nhert all the propertes of. In partcular, they are preference orders, and no worse than sets are closed. Let O 1 = z A {z A : z 1 z}. Each set n the ntersecton s compact because t s the ntersecton of a closed no worse than set wth the compact set A. Any fnte ntersecton of theses sets s non-empty because 1 s transtve. If, for nstance, z 1 1 z 2, then {z A : z 1 z 1 } {z A : z 1 z 2 } = {z A : z 1 z 1 }. The fnte ntersecton property of compact sets tells us that that O 1 s non-empty (and compact). Any allocaton n O 1 s a feasble allocaton whch s best for consumer 1 among all feasble allocatons. Now repeat the same argument for consumer 2 on the set O 1. The outcome s a non-empty and compact set O 2 wth the property that consumer 2 s gettng an allocaton whch s preferencemaxmal for her among all allocatons that are preference-maxmal for consumer 1 on A. Repeatng ths successvely for all consumers generates a set of allocatons O I for whch each consumer s gettng preference-maxmal allocatons among those whch are preference maxmal for consumer 1 among those.... These allocatons are Pareto optmal. They are a pecular set of Pareto optma, I admt, but demonstraton of even one optmal allocaton suffces to prove exstence. The connecton between equlbrum and optmalty s subtle. The Frst Welfare Theorem gves condtons guaranteeng that a compettve equlbrum allocaton s Pareto optmal. The Second Welfare Theorem guarantees that a Pareto optmal allocaton s an equlbrum allocaton for some endowment allocaton. The condtons for the Second Theorem are stronger than the frst, and the Frst s not automatc.

10 10 Fgure 1: Falure of the Frst Welfare Theorem. In Fgure 1, the red polygon encloses a thck ndfference curve of consumer A, whose orgn s at the bottom left. The dot s an equlbrum allocaton, and the straght lne represents both an ndfference curve for consumer B and the equlbrum budget sets of the two consumers. The equlbrum allocaton s obvously not optmal. Theorem 6 (Frst Welfare Theorem). Let E be a prvate ownershp economy wth an equlbrum (p, x, y ). Suppose for all, s locally non-satated at x. Then (x, y ) s a Pareto-optmal allocaton. Recall that a preference order s locally non-satated at x f n every open neghborhood of x there s an x x. Provng the Frst Welfare Theorem requres that n any equlbrum, any consumpton bundle whch s better for consumer costs more. Ths s just what preference maxmzaton on the budget set means. The proof requres more; specfcally, than any bundle whch s at least as good costs at least as much. Ths s exactly what fals n the example of Fgure 1. The followng lemma shows when ths s true: Lemma 1. If s locally non-satated at bundle x whch s preference-maxmal on the set {x X : px px }, and f x x, then px px. Proof of Lemma 1. Snce s locally non-satated at x, there s a sequence of consumpton bundles x n wth lmt x such that xn x. Transtvty mples that xn x. Preference maxmalty mples that px n > px. Takng lmts, px px.

11 11 Proof of the Frst Welfare Theorem. Suppose that (x, y ) s Pareto-superor to (x, y ). Then for all, x x, and for some ndvdual ths rankng s strct. Ths means that p x p x for all, wth strct nequalty for some. Furthermore, for each j, p y j p y j snce each frm proft maxmzes n equlbrum. Thus p ω = p x p y j < p j x p y j. j The equalty s a consequence of feasblty of the equlbrum allocaton, and the nequalty follows from the relatons just establshed. Consequently, ω = x j y j. That s, the allocaton (x, y ) s not feasble. Notce that ths argument requres no convexty whatsoever. The Second Welfare Theorem requres some convexty assumptons because, along the way, one has to prove the exstence of an equlbrum. The welfare theorems are about the dualty, n some sense, between Pareto optmalty and compettve equlbrum. Unfortunately the dualty s not perfect. The natural expresson of dualty for the Pareto problem s not compettve equlbrum, but a slghtly dfferent noton known n the lterature as quas-equlbrum. Defnton 9. A quas-equlbrum for the economy E s an allocaton (x, y ) and a prce vector p such that 1. For every frm j, y j maxmzes profts among all feasble producton plans n Y j : p y j p y j for all y j Y j. 2. For every consumer, x s expendture-mnmal on the no worse than set. That s, p x x for all x n the set (x ). 3. (x, y ) A. Quas-equlbra are usually compettve equlbra because expendture mnmzaton s usually dual to preference maxmzaton; but not always, and we wll return to ths after the proof of the Second Welfare Theorem. It wll be useful to have some addtonal notaton for the statement and proof of the theorem. Let (x ) = {x X : x x } and (x ) = {x X : x x }. Theorem 7 (Second Welfare Theorem). Let (x, y ) be a Pareto Optmal allocaton for a prvate ownershp economy E wth the propertes that

12 12 1. for all, X s convex, 2. the sets (x ) are convex, 3. for some consumer k, (xk ) s convex and k s locally non-satated at xk, 4. Y s convex. Then there s a p such that (x, y, p ) s a quas-equlbrum for E. The pont of the Second Welfare Theorem s that compettve markets are unbased. There are no Pareto optmal allocatons whch are unreachable by compettve markets or cannot be sustaned by compettve markets after a sutable redstrbuton of ncome. That s to say, the only bas n the market s wealth. Proof. Defne the set G = =k (x )+ k (xk ) Y. Ths set s convex and ω s not n G because the allocaton s Pareto optmal. Thus there s a vector p such that p ω p g for all g G. Snce consumer k s locally non-satated, there s a sequence of consumpton plans xk n wth lmt x k, each element of whch s better for k than xk. Then for all n the vector gn = =k x + xk n j y j s n G, and the sequence g n converges to x j y j = ω. Thus p ω = nf{p g : g G}, and we can conclude that p x mnmzes expendture on the set (x ) for all = k. Ths s also true for consumer k because of local non-sataton. (Why?) Also, p y j s mnmal on Y j, whch s to say that y j s proft-maxmal for frm j at prce p. So far we have a feasble allocaton and a prce system such that frms proft maxmze and consumers mnmze expendture on ther no worse than sets. Ths s the natural dual equlbrum soluton to the Pareto optmzaton problem, and mportant enough that t has ts own name: quasequlbrum. However t s not yet a compettve equlbrum. We need to move from expendture mnmzaton to utlty maxmzaton. Ths s the content of the next lemma. Lemma 2. Suppose that the preference order has the property that for all x X, the set (x ) s open. Suppose at a prce p, x mnmzes expendture on (x ). Suppose too that there s an x 0 X such that px 0 < px. Then x s preference-maxmal on the set {x X : px px }. The exstence of x s referred to as the cheaper pont assumpton. Fgure 2 demonstrates what can go wrong wth the dualty between expendture mnmzaton and utlty maxmzaton when the cheaper pont assumpton does not hold. In ths fgure, the consumpton X s R 2 + n whch the open trangle wth vertces (0, 0), (1, 0) and (0, 1) has been removed. Prces and wealth are such that the

13 13 X p Fgure 2: No cheaper pont. budget set s the lower 45 degree lne. The ndcated consumpton bundle s expendture mnmzng on ts no worse than set, but t s not preference maxmal on the budget set. Proof of Lemma 2. Suppose contrary to the clam of the lemma that there was an x {x X : px px } such that x x. Snce x mnmzes expendture on the set (x ), t must be that px = px. Snce (x ) s open, there s an open heghborhood N contanng x such that for all v N, v x. Now consder the convex combnatons x(t) = tx0 + (1 t)x. For all t > 0, px(t) < px. For t postve but suffcently small, x(t) N, and so for these t, x(t) (x ). Ths contradcts the hypotheses that x s expendture-mnmzng. Fnally, we can clarfy the relatonshp between quas- and compettve equlbrum. Theorem 8. Suppose that (x, y, p ) s a quas-equlbrum for the prvate ownershp economy E. Suppose that for all consumers and for all x X, the set (x ) s open. Then (x, y, p ) s a compettve equlbrum wth transfers. Proof. Take w = p x. The theorem s then a consequence of the defnton of a quas-equlbrum and the precedng Lemma. One mght ask, s every quas-equlbrum allocaton Pareto-optmal? It clearly need not be, for exactly the reason llustrated n the pcture. What does t take to get a a quas-equlbrum allocaton to be Pareto-optmal? The cheaper pont assumpton and open better than sets; that s, precsely wwhen the quas-equlbrum s a compettve equlbrum.

14 14 4 A Calculus Approach to the Welfare Theorems It should be clear by now that the Welfare Theorems pose a dualty of sorts. Take fndng Pareto optma as a prmal problem. The shadow prces for the feasblty constrants are the compettve equlbrum prces. Ths s especally clear n the proof of the Second Welfare Theorem, whch dentfes compettve equlbra as a supportng hyperplane, part of the dual descrpton of G n the proofs of the last secton. Ths nterpretaton becomes clearer to most people when we move to the more famlar ground of constraned optmzaton and Lagrange (Kuhn-Tucker) multplers. The message s that equlbrum prces are shadow prces for the resource constrants n the Pareto optmzaton problem. Ths s most clearly seen n an exchange economy. Suppose that each of I consumers has preferences whch are represented by strctly concave, C 2 and strctly ncreasng utlty functons u 1,..., u I defned on X whch s convex and has non-empty nteror n R L. That s, D 2 u s negatve defnte and Du 0 on X. Suppose too each consumer has a strctly postve endowment. 4.1 Optmalty If x s a Pareto optmal allocaton, then there s no reallocaton that can ncrease the utlty of any consumer wthout decreasng the utlty of anyone else. let u (x ) = u. Then x solves the optmzaton problem on X : PO : max u 1 (x 1 ) s.t. u (x ) u for = 2,..., I, x = x. Snce the u are strctly ncreasng, the weak nequaltes can be assumed to be equaltes. Let us, for smplcty, consder an allocaton n whch each x s nteror to X. The frst order condtons are Du 1 (x 1 ) = λ ν Du (x ) = λ. From these condtons the usual equalty condtons for margnal rates of substtuton follow. These condtons, along wth the constrants, are suffcent for an allocaton to be Pareto optmal.

15 Equlbrum Now suppose an allocaton x 1,..., x I s a compettve equlbrum at prce vector p. Then x = ω, and for each the bundle x solves the optmzaton problem CE : max u (x ) s.t. px pω. Agan one can take the nequalty to be an equalty. The frst order condtons are Du (x ) = η p These too are suffcent because of the concavty assumptons. 4.3 The Welfare Theorems The proof of the welfare theorems amounts to showng: Frst Welfare Theorem If for all, x, η solves the frst order condtons for CE wth prces p, then x and λ = η 1 p, ν = η 1 /η solves the PO frst order condtons. Second Welfare Theorem If x, ν and λ solve PO, then takng ν 1 = 1, x, η = 1/ν and p = λ solve all the CE frst order condtons. Ths s smple algebra. Here s what one should take away from ths exercse. The shadow prce ratos on the resource constrants measure the relatve scarcty of the commodtes. And those prce ratos are exactly the compettve prce ratos. So n a compettve equlbrum, the equlbrum prce ndexes the scarcty of the commodtes. It s an nterestng exercse to carry ths exercse out wth producton.

Welfare Properties of General Equilibrium. What can be said about optimality properties of resource allocation implied by general equilibrium?

Welfare Properties of General Equilibrium. What can be said about optimality properties of resource allocation implied by general equilibrium? APPLIED WELFARE ECONOMICS AND POLICY ANALYSIS Welfare Propertes of General Equlbrum What can be sad about optmalty propertes of resource allocaton mpled by general equlbrum? Any crteron used to compare

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

Economics 101. Lecture 4 - Equilibrium and Efficiency

Economics 101. Lecture 4 - Equilibrium and Efficiency Economcs 0 Lecture 4 - Equlbrum and Effcency Intro As dscussed n the prevous lecture, we wll now move from an envronment where we looed at consumers mang decsons n solaton to analyzng economes full of

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

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

PROBLEM SET 7 GENERAL EQUILIBRIUM

PROBLEM SET 7 GENERAL EQUILIBRIUM PROBLEM SET 7 GENERAL EQUILIBRIUM Queston a Defnton: An Arrow-Debreu Compettve Equlbrum s a vector of prces {p t } and allocatons {c t, c 2 t } whch satsfes ( Gven {p t }, c t maxmzes βt ln c t subject

More information

Mixed Taxation and Production Efficiency

Mixed Taxation and Production Efficiency Floran Scheuer 2/23/2016 Mxed Taxaton and Producton Effcency 1 Overvew 1. Unform commodty taxaton under non-lnear ncome taxaton Atknson-Stgltz (JPubE 1976) Theorem Applcaton to captal taxaton 2. Unform

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

Lecture Notes, January 11, 2010

Lecture Notes, January 11, 2010 Economcs 200B UCSD Wnter 2010 Lecture otes, January 11, 2010 Partal equlbrum comparatve statcs Partal equlbrum: Market for one good only wth supply and demand as a functon of prce. Prce s defned as the

More information

Economics 8105 Macroeconomic Theory Recitation 1

Economics 8105 Macroeconomic Theory Recitation 1 Economcs 8105 Macroeconomc Theory Rectaton 1 Outlne: Conor Ryan September 6th, 2016 Adapted From Anh Thu (Monca) Tran Xuan s Notes Last Updated September 20th, 2016 Dynamc Economc Envronment Arrow-Debreu

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

Equilibrium with Complete Markets. Instructor: Dmytro Hryshko

Equilibrium with Complete Markets. Instructor: Dmytro Hryshko Equlbrum wth Complete Markets Instructor: Dmytro Hryshko 1 / 33 Readngs Ljungqvst and Sargent. Recursve Macroeconomc Theory. MIT Press. Chapter 8. 2 / 33 Equlbrum n pure exchange, nfnte horzon economes,

More information

REAL ANALYSIS I HOMEWORK 1

REAL ANALYSIS I HOMEWORK 1 REAL ANALYSIS I HOMEWORK CİHAN BAHRAN The questons are from Tao s text. Exercse 0.0.. If (x α ) α A s a collecton of numbers x α [0, + ] such that x α

More information

U.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017

U.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017 U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that

More information

Solutions to exam in SF1811 Optimization, Jan 14, 2015

Solutions to exam in SF1811 Optimization, Jan 14, 2015 Solutons to exam n SF8 Optmzaton, Jan 4, 25 3 3 O------O -4 \ / \ / The network: \/ where all lnks go from left to rght. /\ / \ / \ 6 O------O -5 2 4.(a) Let x = ( x 3, x 4, x 23, x 24 ) T, where the varable

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

University of California, Davis Date: June 22, 2009 Department of Agricultural and Resource Economics. PRELIMINARY EXAMINATION FOR THE Ph.D.

University of California, Davis Date: June 22, 2009 Department of Agricultural and Resource Economics. PRELIMINARY EXAMINATION FOR THE Ph.D. Unversty of Calforna, Davs Date: June 22, 29 Department of Agrcultural and Resource Economcs Department of Economcs Tme: 5 hours Mcroeconomcs Readng Tme: 2 mnutes PRELIMIARY EXAMIATIO FOR THE Ph.D. DEGREE

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

Supporting Materials for: Two Monetary Models with Alternating Markets

Supporting Materials for: Two Monetary Models with Alternating Markets Supportng Materals for: Two Monetary Models wth Alternatng Markets Gabrele Camera Chapman Unversty Unversty of Basel YL Chen Federal Reserve Bank of St. Lous 1 Optmal choces n the CIA model On date t,

More information

CS294 Topics in Algorithmic Game Theory October 11, Lecture 7

CS294 Topics in Algorithmic Game Theory October 11, Lecture 7 CS294 Topcs n Algorthmc Game Theory October 11, 2011 Lecture 7 Lecturer: Chrstos Papadmtrou Scrbe: Wald Krchene, Vjay Kamble 1 Exchange economy We consder an exchange market wth m agents and n goods. Agent

More information

Hila Etzion. Min-Seok Pang

Hila Etzion. Min-Seok Pang RESERCH RTICLE COPLEENTRY ONLINE SERVICES IN COPETITIVE RKETS: INTINING PROFITILITY IN THE PRESENCE OF NETWORK EFFECTS Hla Etzon Department of Technology and Operatons, Stephen. Ross School of usness,

More information

MAT 578 Functional Analysis

MAT 578 Functional Analysis MAT 578 Functonal Analyss John Qugg Fall 2008 Locally convex spaces revsed September 6, 2008 Ths secton establshes the fundamental propertes of locally convex spaces. Acknowledgment: although I wrote these

More information

Complete subgraphs in multipartite graphs

Complete subgraphs in multipartite graphs Complete subgraphs n multpartte graphs FLORIAN PFENDER Unverstät Rostock, Insttut für Mathematk D-18057 Rostock, Germany Floran.Pfender@un-rostock.de Abstract Turán s Theorem states that every graph G

More information

Convex Optimization. Optimality conditions. (EE227BT: UC Berkeley) Lecture 9 (Optimality; Conic duality) 9/25/14. Laurent El Ghaoui.

Convex Optimization. Optimality conditions. (EE227BT: UC Berkeley) Lecture 9 (Optimality; Conic duality) 9/25/14. Laurent El Ghaoui. Convex Optmzaton (EE227BT: UC Berkeley) Lecture 9 (Optmalty; Conc dualty) 9/25/14 Laurent El Ghaou Organsatonal Mdterm: 10/7/14 (1.5 hours, n class, double-sded cheat sheet allowed) Project: Intal proposal

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

Supporting Information for: Two Monetary Models with Alternating Markets

Supporting Information for: Two Monetary Models with Alternating Markets Supportng Informaton for: Two Monetary Models wth Alternatng Markets Gabrele Camera Chapman Unversty & Unversty of Basel YL Chen St. Lous Fed November 2015 1 Optmal choces n the CIA model On date t, gven

More information

Edge Isoperimetric Inequalities

Edge Isoperimetric Inequalities November 7, 2005 Ross M. Rchardson Edge Isopermetrc Inequaltes 1 Four Questons Recall that n the last lecture we looked at the problem of sopermetrc nequaltes n the hypercube, Q n. Our noton of boundary

More information

MMA and GCMMA two methods for nonlinear optimization

MMA and GCMMA two methods for nonlinear optimization MMA and GCMMA two methods for nonlnear optmzaton Krster Svanberg Optmzaton and Systems Theory, KTH, Stockholm, Sweden. krlle@math.kth.se Ths note descrbes the algorthms used n the author s 2007 mplementatons

More information

Copyright (C) 2008 David K. Levine This document is an open textbook; you can redistribute it and/or modify it under the terms of the Creative

Copyright (C) 2008 David K. Levine This document is an open textbook; you can redistribute it and/or modify it under the terms of the Creative Copyrght (C) 008 Davd K. Levne Ths document s an open textbook; you can redstrbute t and/or modfy t under the terms of the Creatve Commons Attrbuton Lcense. Compettve Equlbrum wth Pure Exchange n traders

More information

Module 9. Lecture 6. Duality in Assignment Problems

Module 9. Lecture 6. Duality in Assignment Problems Module 9 1 Lecture 6 Dualty n Assgnment Problems In ths lecture we attempt to answer few other mportant questons posed n earler lecture for (AP) and see how some of them can be explaned through the concept

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 NOTE ON CES FUNCTIONS Drago Bergholt, BI Norwegian Business School 2011

A NOTE ON CES FUNCTIONS Drago Bergholt, BI Norwegian Business School 2011 A NOTE ON CES FUNCTIONS Drago Bergholt, BI Norwegan Busness School 2011 Functons featurng constant elastcty of substtuton CES are wdely used n appled economcs and fnance. In ths note, I do two thngs. Frst,

More information

Norm Bounds for a Transformed Activity Level. Vector in Sraffian Systems: A Dual Exercise

Norm Bounds for a Transformed Activity Level. Vector in Sraffian Systems: A Dual Exercise ppled Mathematcal Scences, Vol. 4, 200, no. 60, 2955-296 Norm Bounds for a ransformed ctvty Level Vector n Sraffan Systems: Dual Exercse Nkolaos Rodousaks Department of Publc dmnstraton, Panteon Unversty

More information

Lecture 10 Support Vector Machines II

Lecture 10 Support Vector Machines II Lecture 10 Support Vector Machnes II 22 February 2016 Taylor B. Arnold Yale Statstcs STAT 365/665 1/28 Notes: Problem 3 s posted and due ths upcomng Frday There was an early bug n the fake-test data; fxed

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

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

Solutions HW #2. minimize. Ax = b. Give the dual problem, and make the implicit equality constraints explicit. Solution.

Solutions HW #2. minimize. Ax = b. Give the dual problem, and make the implicit equality constraints explicit. Solution. Solutons HW #2 Dual of general LP. Fnd the dual functon of the LP mnmze subject to c T x Gx h Ax = b. Gve the dual problem, and make the mplct equalty constrants explct. Soluton. 1. The Lagrangan s L(x,

More information

6) Derivatives, gradients and Hessian matrices

6) Derivatives, gradients and Hessian matrices 30C00300 Mathematcal Methods for Economsts (6 cr) 6) Dervatves, gradents and Hessan matrces Smon & Blume chapters: 14, 15 Sldes by: Tmo Kuosmanen 1 Outlne Defnton of dervatve functon Dervatve notatons

More information

Economics 2450A: Public Economics Section 10: Education Policies and Simpler Theory of Capital Taxation

Economics 2450A: Public Economics Section 10: Education Policies and Simpler Theory of Capital Taxation Economcs 2450A: Publc Economcs Secton 10: Educaton Polces and Smpler Theory of Captal Taxaton Matteo Parads November 14, 2016 In ths secton we study educaton polces n a smplfed verson of framework analyzed

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

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

( ) 2 ( ) ( ) Problem Set 4 Suggested Solutions. Problem 1

( ) 2 ( ) ( ) Problem Set 4 Suggested Solutions. Problem 1 Problem Set 4 Suggested Solutons Problem (A) The market demand functon s the soluton to the followng utlty-maxmzaton roblem (UMP): The Lagrangean: ( x, x, x ) = + max U x, x, x x x x st.. x + x + x y x,

More information

Lecture Notes on Linear Regression

Lecture Notes on Linear Regression Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume

More information

20. Mon, Oct. 13 What we have done so far corresponds roughly to Chapters 2 & 3 of Lee. Now we turn to Chapter 4. The first idea is connectedness.

20. Mon, Oct. 13 What we have done so far corresponds roughly to Chapters 2 & 3 of Lee. Now we turn to Chapter 4. The first idea is connectedness. 20. Mon, Oct. 13 What we have done so far corresponds roughly to Chapters 2 & 3 of Lee. Now we turn to Chapter 4. The frst dea s connectedness. Essentally, we want to say that a space cannot be decomposed

More information

a b a In case b 0, a being divisible by b is the same as to say that

a b a In case b 0, a being divisible by b is the same as to say that Secton 6.2 Dvsblty among the ntegers An nteger a ε s dvsble by b ε f there s an nteger c ε such that a = bc. Note that s dvsble by any nteger b, snce = b. On the other hand, a s dvsble by only f a = :

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

10-801: Advanced Optimization and Randomized Methods Lecture 2: Convex functions (Jan 15, 2014)

10-801: Advanced Optimization and Randomized Methods Lecture 2: Convex functions (Jan 15, 2014) 0-80: Advanced Optmzaton and Randomzed Methods Lecture : Convex functons (Jan 5, 04) Lecturer: Suvrt Sra Addr: Carnege Mellon Unversty, Sprng 04 Scrbes: Avnava Dubey, Ahmed Hefny Dsclamer: These notes

More information

f(x,y) = (4(x 2 4)x,2y) = 0 H(x,y) =

f(x,y) = (4(x 2 4)x,2y) = 0 H(x,y) = Problem Set 3: Unconstraned mzaton n R N. () Fnd all crtcal ponts of f(x,y) (x 4) +y and show whch are ma and whch are mnma. () Fnd all crtcal ponts of f(x,y) (y x ) x and show whch are ma and whch are

More information

Exercise Solutions to Real Analysis

Exercise Solutions to Real Analysis xercse Solutons to Real Analyss Note: References refer to H. L. Royden, Real Analyss xersze 1. Gven any set A any ɛ > 0, there s an open set O such that A O m O m A + ɛ. Soluton 1. If m A =, then there

More information

GENERAL EQUILIBRIUM IN INFINITE SECURITY MARKETS

GENERAL EQUILIBRIUM IN INFINITE SECURITY MARKETS GENERAL EQUILIBRIUM IN INFINITE SECURITY MARKETS C. D. ALIPRANTIS 1, M. FLORENZANO 2, V. F. MARTINS DA ROCHA 3 AND R. TOURKY 4 1 Department of Economcs, Krannert School of Management, Purdue Unversty,

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

,, MRTS is the marginal rate of technical substitution

,, MRTS is the marginal rate of technical substitution Mscellaneous Notes on roducton Economcs ompled by eter F Orazem September 9, 00 I Implcatons of conve soquants Two nput case, along an soquant 0 along an soquant Slope of the soquant,, MRTS s the margnal

More information

Week 2. This week, we covered operations on sets and cardinality.

Week 2. This week, we covered operations on sets and cardinality. Week 2 Ths week, we covered operatons on sets and cardnalty. Defnton 0.1 (Correspondence). A correspondence between two sets A and B s a set S contaned n A B = {(a, b) a A, b B}. A correspondence from

More information

Uniqueness of Nash Equilibrium in Private Provision of Public Goods: Extension. Nobuo Akai *

Uniqueness of Nash Equilibrium in Private Provision of Public Goods: Extension. Nobuo Akai * Unqueness of Nash Equlbrum n Prvate Provson of Publc Goods: Extenson Nobuo Aka * nsttute of Economc Research Kobe Unversty of Commerce Abstract Ths note proves unqueness of Nash equlbrum n prvate provson

More information

Endogenous timing in a mixed oligopoly consisting of a single public firm and foreign competitors. Abstract

Endogenous timing in a mixed oligopoly consisting of a single public firm and foreign competitors. Abstract Endogenous tmng n a mxed olgopoly consstng o a sngle publc rm and oregn compettors Yuanzhu Lu Chna Economcs and Management Academy, Central Unversty o Fnance and Economcs Abstract We nvestgate endogenous

More information

How Strong Are Weak Patents? Joseph Farrell and Carl Shapiro. Supplementary Material Licensing Probabilistic Patents to Cournot Oligopolists *

How Strong Are Weak Patents? Joseph Farrell and Carl Shapiro. Supplementary Material Licensing Probabilistic Patents to Cournot Oligopolists * How Strong Are Weak Patents? Joseph Farrell and Carl Shapro Supplementary Materal Lcensng Probablstc Patents to Cournot Olgopolsts * September 007 We study here the specal case n whch downstream competton

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

STEINHAUS PROPERTY IN BANACH LATTICES

STEINHAUS PROPERTY IN BANACH LATTICES DEPARTMENT OF MATHEMATICS TECHNICAL REPORT STEINHAUS PROPERTY IN BANACH LATTICES DAMIAN KUBIAK AND DAVID TIDWELL SPRING 2015 No. 2015-1 TENNESSEE TECHNOLOGICAL UNIVERSITY Cookevlle, TN 38505 STEINHAUS

More information

MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS

MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS These are nformal notes whch cover some of the materal whch s not n the course book. The man purpose s to gve a number of nontrval examples

More information

Lecture 20: Lift and Project, SDP Duality. Today we will study the Lift and Project method. Then we will prove the SDP duality theorem.

Lecture 20: Lift and Project, SDP Duality. Today we will study the Lift and Project method. Then we will prove the SDP duality theorem. prnceton u. sp 02 cos 598B: algorthms and complexty Lecture 20: Lft and Project, SDP Dualty Lecturer: Sanjeev Arora Scrbe:Yury Makarychev Today we wll study the Lft and Project method. Then we wll prove

More information

Genericity of Critical Types

Genericity of Critical Types Genercty of Crtcal Types Y-Chun Chen Alfredo D Tllo Eduardo Fangold Syang Xong September 2008 Abstract Ely and Pesk 2008 offers an nsghtful characterzaton of crtcal types: a type s crtcal f and only f

More information

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons

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

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

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

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

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

1 The Sidrauski model

1 The Sidrauski model The Sdrausk model There are many ways to brng money nto the macroeconomc debate. Among the fundamental ssues n economcs the treatment of money s probably the LESS satsfactory and there s very lttle agreement

More information

Games and Market Imperfections

Games and Market Imperfections Games and Market Imperfectons Q: The mxed complementarty (MCP) framework s effectve for modelng perfect markets, but can t handle mperfect markets? A: At least part of the tme A partcular type of game/market

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

Let p z be the price of z and p 1 and p 2 be the prices of the goods making up y. In general there is no problem in grouping goods.

Let p z be the price of z and p 1 and p 2 be the prices of the goods making up y. In general there is no problem in grouping goods. Economcs 90 Prce Theory ON THE QUESTION OF SEPARABILITY What we would lke to be able to do s estmate demand curves by segmentng consumers purchases nto groups. In one applcaton, we aggregate purchases

More information

Volume 29, Issue 4. Incomplete third-degree price discrimination, and market partition problem. Yann Braouezec ESILV

Volume 29, Issue 4. Incomplete third-degree price discrimination, and market partition problem. Yann Braouezec ESILV Volume 29, Issue 4 Incomplete thrd-degree prce dscrmnaton, and market partton problem Yann Braouezec ESILV Abstract We ntroduce n ths paper the "ncomplete" thrd-degree prce dscrmnaton, whch s the stuaton

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

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

Supplement: Proofs and Technical Details for The Solution Path of the Generalized Lasso

Supplement: Proofs and Technical Details for The Solution Path of the Generalized Lasso Supplement: Proofs and Techncal Detals for The Soluton Path of the Generalzed Lasso Ryan J. Tbshran Jonathan Taylor In ths document we gve supplementary detals to the paper The Soluton Path of the Generalzed

More information

find (x): given element x, return the canonical element of the set containing x;

find (x): given element x, return the canonical element of the set containing x; COS 43 Sprng, 009 Dsjont Set Unon Problem: Mantan a collecton of dsjont sets. Two operatons: fnd the set contanng a gven element; unte two sets nto one (destructvely). Approach: Canoncal element method:

More information

k t+1 + c t A t k t, t=0

k t+1 + c t A t k t, t=0 Macro II (UC3M, MA/PhD Econ) Professor: Matthas Kredler Fnal Exam 6 May 208 You have 50 mnutes to complete the exam There are 80 ponts n total The exam has 4 pages If somethng n the queston s unclear,

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

Global identification from the equilibrium manifold under incomplete markets. (Draft for comments)

Global identification from the equilibrium manifold under incomplete markets. (Draft for comments) Global dentfcaton from the equlbrum manfold under ncomplete markets. (Draft for comments) Andrés Carvajal BancodelaRepúblca. acarvaes@banrep.gov.co Alvaro Rascos BancodelaRepúblca. arascv@banrep.gov.co

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

Market structure and Innovation

Market structure and Innovation Market structure and Innovaton Ths presentaton s based on the paper Market structure and Innovaton authored by Glenn C. Loury, publshed n The Quarterly Journal of Economcs, Vol. 93, No.3 ( Aug 1979) I.

More information

Lecture 3: Probability Distributions

Lecture 3: Probability Distributions Lecture 3: Probablty Dstrbutons Random Varables Let us begn by defnng a sample space as a set of outcomes from an experment. We denote ths by S. A random varable s a functon whch maps outcomes nto the

More information

Unit 5: Government policy in competitive markets I E ciency

Unit 5: Government policy in competitive markets I E ciency Unt 5: Government polcy n compettve markets I E cency Prof. Antono Rangel January 2, 2016 1 Pareto optmal allocatons 1.1 Prelmnares Bg pcture Consumers: 1,...,C,eachw/U,W Frms: 1,...,F,eachw/C ( ) Consumers

More information

6.854J / J Advanced Algorithms Fall 2008

6.854J / J Advanced Algorithms Fall 2008 MIT OpenCourseWare http://ocw.mt.edu 6.854J / 18.415J Advanced Algorthms Fall 2008 For nformaton about ctng these materals or our Terms of Use, vst: http://ocw.mt.edu/terms. 18.415/6.854 Advanced Algorthms

More information

Pricing and Resource Allocation Game Theoretic Models

Pricing and Resource Allocation Game Theoretic Models Prcng and Resource Allocaton Game Theoretc Models Zhy Huang Changbn Lu Q Zhang Computer and Informaton Scence December 8, 2009 Z. Huang, C. Lu, and Q. Zhang (CIS) Game Theoretc Models December 8, 2009

More information

General viscosity iterative method for a sequence of quasi-nonexpansive mappings

General viscosity iterative method for a sequence of quasi-nonexpansive mappings Avalable onlne at www.tjnsa.com J. Nonlnear Sc. Appl. 9 (2016), 5672 5682 Research Artcle General vscosty teratve method for a sequence of quas-nonexpansve mappngs Cuje Zhang, Ynan Wang College of Scence,

More information

Additional Codes using Finite Difference Method. 1 HJB Equation for Consumption-Saving Problem Without Uncertainty

Additional Codes using Finite Difference Method. 1 HJB Equation for Consumption-Saving Problem Without Uncertainty Addtonal Codes usng Fnte Dfference Method Benamn Moll 1 HJB Equaton for Consumpton-Savng Problem Wthout Uncertanty Before consderng the case wth stochastc ncome n http://www.prnceton.edu/~moll/ HACTproect/HACT_Numercal_Appendx.pdf,

More information

Geometry of Müntz Spaces

Geometry of Müntz Spaces WDS'12 Proceedngs of Contrbuted Papers, Part I, 31 35, 212. ISBN 978-8-7378-224-5 MATFYZPRESS Geometry of Müntz Spaces P. Petráček Charles Unversty, Faculty of Mathematcs and Physcs, Prague, Czech Republc.

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

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

1. relation between exp. function and IUF

1. relation between exp. function and IUF Dualty Dualty n consumer theory II. relaton between exp. functon and IUF - straghtforward: have m( p, u mn'd value of expendture requred to attan a gven level of utlty, gven a prce vector; u ( p, M max'd

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

Subset Topological Spaces and Kakutani s Theorem

Subset Topological Spaces and Kakutani s Theorem MOD Natural Neutrosophc Subset Topologcal Spaces and Kakutan s Theorem W. B. Vasantha Kandasamy lanthenral K Florentn Smarandache 1 Copyrght 1 by EuropaNova ASBL and the Authors Ths book can be ordered

More information

Journal of Mathematical Economics

Journal of Mathematical Economics Journal of Mathematcal Economcs 45 (2009) 3 23 Contents lsts avalable at ScenceDrect Journal of Mathematcal Economcs journal homepage: www.elsever.com/locate/jmateco Implementaton of Pareto effcent allocatons

More information

Externalities in wireless communication: A public goods solution approach to power allocation. by Shrutivandana Sharma

Externalities in wireless communication: A public goods solution approach to power allocation. by Shrutivandana Sharma Externaltes n wreless communcaton: A publc goods soluton approach to power allocaton by Shrutvandana Sharma SI 786 Tuesday, Feb 2, 2006 Outlne Externaltes: Introducton Plannng wth externaltes Power allocaton:

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

(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

Mathematical Economics MEMF e ME. Filomena Garcia. Topic 2 Calculus

Mathematical Economics MEMF e ME. Filomena Garcia. Topic 2 Calculus Mathematcal Economcs MEMF e ME Flomena Garca Topc 2 Calculus Mathematcal Economcs - www.seg.utl.pt/~garca/economa_matematca . Unvarate Calculus Calculus Functons : X Y y ( gves or each element X one element

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

The Unique Informational Effciency of the Lindahl Allocation Process in Economies with Public Goods

The Unique Informational Effciency of the Lindahl Allocation Process in Economies with Public Goods MPRA Munch Personal RePEc Archve The Unque Informatonal Effcency of the Lndahl Allocaton Process n Economes wth Publc Goods Guoqang Tan 2001 Onlne at https://mpra.ub.un-muenchen.de/41229/ MPRA Paper No.

More information