Lecture 8: Market Equilibria

Size: px
Start display at page:

Download "Lecture 8: Market Equilibria"

Transcription

1 Computational Aspects of Game Theory Bertinoro Spring School 2011 Lecturer: Bruno Codenotti Lecture 8: Market Equilibria The market setting transcends the scenario of games. The decentralizing effect of equilibrium prices mediates among the economic agents thus making their strategic decisions independent. However there is a natural interplay between market equilibria and Nash equilibria for games: one of the very first proofs of existence of a market equilibrium is built upon the existence of a Nash equilibrium in an associated game. In this lecture we first describe a general model (the competitive economy), but then only consider exchange economies, a market model which does not include the production of goods, and analyze the market equilibrium problem in such a restricted context. 8.1 The Competitive Economy We assume that there is a finite number l of commodities. These include goods, which may be produced and traded, as well as labor (which can be supplied by individuals, but cannot be produced.) The decision makers in our model are n production units and m consumption units. Production units correspond to companies. These take some commodities as input (labor, raw materials), and produce others as output (finished goods). Consumption units correspond to individuals, who generally supply labor but consume goods. At a high level, our goal is to set prices for each commodity so that each producer will decide its production strategy based only on the prices and the total amount of raw materials (and independently of what each other company does); each consumer will decide a consumption strategy based only on the prices and his/her budget, and moreover there will be no excess of supply or demand. By excess of supply, we mean a commodity for which the price is nonzero but there is supply left over. By excess of demand, we mean a commodity which is sold out, but of which some producer or consumer wanted more. Each producer j has a set Y j of production plans, which are vectors in R l, with the coordinates representing the various commodities. Inputs (raw materials, labor) are represented by negative coordinates. The set Y j is assumed to be a closed convex subset of R l containing 0. Similarly, each consumer i has a set X i of consumption plans, which are vectors in R l. Here labor has a negative coordinate, while bought goods have positive coordinates. Consumers begin the day with an initial endowment, ζ i, of commodities, which is another vector in R l. These may be sold to other consumers or to producers, or kept. We make the following basic assumptions about the sets X i and Y j : Labor cannot be produced, i. e. there exist commodities h such that for all j, for all production plans y j Y j the hth coordinate of y j is non-positive No consumer works more than 24 hours per day. In other words, there is an absolute bound on the labor coordinate for all consumption plans x i X i, 1 i m. All goods coordinates of x i are non-negative (these goods are consumed). Thus there is an absolute lower bound on all coordinates of each x i X i, 1 i m. 8-1

2 8-2 Lecture 8: Market Equilibria Suppose each consumer i has chosen a consumption plan x i X i and each producer j has chosen a production plan y j Y j. Let x = m i=1 x i, y = n i=1 y j, and ζ = m i=1 ζ i. Then x ζ +y. In other words, consumption cannot exceed initial supply plus production. We will call such an overall selection feasible. We further restrict the sets X i and Y j to only contain plans which belong to some feasible overall selection. This restriction, together with closure and convexity, forces the sets to be bounded, so that they are compact. (Note that the restriction does not force every selection in i X i j Y j to be feasible in the above sense.) A price vector, p R l must satisfy p h 0 for all commodities h, and l h=1 p h = 1. Let P be the space of all such price vectors. Note that labor has its price as well as goods. Each company j aims to maximize the dot product y j p, which is its net profit (sales minus costs). Note that since the zero strategy is always available, a company s profit at equilibrium must be non-negative. Each consumer i has a utility function u i : X i R, which is continuous and concave. The consumer s goal is to maximize this utility function, subject to her/his budget, which is defined as B i = p ζ i + j α i,j p y j. Here the α i,j s represent the dividends paid to consumer i by company j. We require α i,j 0, and m i=1 α i,j = 1, for all j s. A consumer s budget represents the total assets available for her/him to spend. The consumption vector x i must satisfy the budget constraint x i p B i. A competitive equilibrium in this setup is an (m + n + 1)-tuple (x 1,..., x m, y 1,..., y n, p ) of vectors in R l such that y j maximizes p y j over y j Y j. x i maximizes u i(x i ) over x i X i, and satisfies the budget constraint, given (y, p ). x y ζ 0, and (x y ζ) p = 0. The first condition is a resource constraint, while the second condition is an example of complementary slackness, and models the classical law of supply and demand. We can now state the fundamental theorem by Arrow and Debreu [2]. Theorem 8.1 (Arrow-Debreu) In the model described above, a competitive equilibrium exists. 8.2 The Exchange Economy We describe now the so-called exchange economy, an important special case of the model described above. The exchange economy does not include the production of goods. Let us consider m economic agents who represent traders of n goods. Let R n + denote the subset of R n with all nonnegative coordinates. The j-th coordinate in R n will represent good j. Each trader i has a concave utility function u i : R n + R +, which represents her preferences for the different bundles of goods, and an initial endowment of goods w i = (w i1,..., w in ) R n +. At given prices π R n +, trader i will sell her

3 Lecture 8: Market Equilibria 8-3 endowment, and get the bundle of goods x i = (x i1,..., x in ) R n + which maximizes u i (x) subject to the budget constraint 1 π x π w i. An equilibrium for the exchange economy is a vector of prices π = (π 1,..., π n ) R n + at which, for each trader i, there is a bundle x i = ( x i1,..., x in ) R n + of goods such that the following two conditions hold: 1. For each trader i, the vector x i maximizes u i (x) subject to the constraints π x π w i and x R n For each good j, i x ij i w ij. The Fisher model. A special case of the general exchange model defined above occurs when the initial endowments are proportional, i.e., when w i = δ i w, δ i > 0, so that the relative incomes of the traders are independent of the prices. This special case is equivalent to the Fisher model, which is a market of n goods desired by m utility maximizing buyers with fixed incomes. We assume that each buyer has a concave utility function u i : R n + R + and an endowment e i > 0 of money. There is a seller with an amount q j > 0 of good j. An equilibrium in the Fisher setting is a nonnegative vector of prices π = (π 1,..., π n ) R n + at which there is a bundle x i = ( x i1,..., x in ) R n + of goods for each buyer i such that the following two conditions hold: 1. The vector x i maximizes u i (x) subject to the constraints π x e i and x R n For each good j, i x ij = q j. Demand and excess demand. For any price vector π, the vector x i (π) that maximizes u i (x) subject to the constraints π x π w i and x R n + is called the demand of trader i at prices π. 2 Then X k (π) = i x ik(π) denotes the market (or aggregate) demand of good k at prices π, and Z k (π) = X k (π) i w ik the market excess demand of good k at prices π. The vectors X(π) = (X 1 (π),..., X n (π)) and Z(π) = (Z 1 (π),..., Z n (π)) are called market demand (or aggregate demand) and market excess demand, respectively. The market is said to satisfy positive homogeneity if for any price vector π and any λ > 0, we have Z(π) = Z(λπ). It is said to satisfy Walras Law if for any price π, we have π Z(π) = 0. Both positive homogeneity and Walras law are considered standard and extremely mild assumptions in the theory of equilibrium. Positive homogenity follows simply from the agent s utility maximizing behavior whereas Walras Law follows from a very weak assumption on agent preferences called local nonsatiation 3. In terms of the aggregate excess demand function, the equilibrium is a vector of prices π = (π 1,..., π n ) R n + such that Z(π) is well-defined and Z j (π) 0, for each j. GS and WARP. Two properties play a significant role in the theory of equilibrium and in related computational results: gross substitutability (GS) and the weak axiom of revealed preferences (WARP). The market excess demand is said to satisfy gross substitutability (resp., weak gross substitutability - WGS) if for any two sets of prices π and π such that 0 < π j π j, for each j, and π j < π j for some j, we have that π k = π k for any good k implies Zk (π) < Z k (π ) (resp., Z k (π) Z k (π )). That is, increasing the price of 1 Given two vectors x and y, x y denotes their inner product. 2 Unless otherwise stated, we assume that there is at most one such vector, i.e., the demand is a single-valued function. This is the case for utility functions that satisfy strict quasi-concavity. In general, the demand is a set-valued function. 3 Local nonsatiation means that for any bundle of goods there is always another bundle of goods arbitrarily close to it that is preferred to it.

4 8-4 Lecture 8: Market Equilibria some of the goods while keeping some others fixed can only cause an increase in the demand for the goods whose price is fixed. The market excess demand is said to satisfy WARP if for any two sets of prices π and π such that Z(π) Z(π ) either π Z(π ) > 0 or (π ) Z(π) > 0. This means that if the demands at prices π and π are different, then either Z(π ) is not within budget when the price is π or Z(π) is not within budget when the price is π. It is well known that GS implies that the equilibrium prices are unique up to scaling ([8], p. 395) and that WARP implies that the set of equilibrium prices is convex ([6], p. 608). It is also well known that the market excess demand satisfies weak GS when each individual excess demand does. In contrast, WARP is satisfied by the individual excess demand of a trader with a concave utility function, but it is not in general satisfied by the aggregate excess demand. Commonly used utility functions. u(αx) = αu(x), for all α > 0. A utility function u( ) is homogeneous (of degree one) if it satisfies A linear utility function has the form u i (x) = j a ijx ij. The Cobb-Douglas utility has the form u i (x) = j (x ij) aij, where j a ij = 1. The Leontief utility function has the form u i (x) = min j a ij x ij. A CES (constant elasticity of substitution) utility function has the form u(x i ) = ( j (a ijx ij ) ρ ) 1/ρ, where < ρ < 1 but ρ 0. In all of these definitions, a ij 0. As ρ tends to 1 (resp. 0, ), the CES utility function tends to a linear (resp. Cobb-Douglas, Leontief) utility function ([1], page 231). The CES class of functions are popular among economists for their ability to express a wide variety of consumer preferences as well as their mathematical tractability which allows for explicit computation of the associated demand function. Example 8.2 (Cobb-Douglas Utilities) Let consider utility functions of the form u(x) = x a 1 1 xa 2 2 xan n, a i 0, a i = 1. These utility functions are known as Cobb-Douglas utilities. It is easy to see that a trader with this utility function will spend the same fraction a j of her income M on the jth good, independently of relative prices. In other words, the demand function will be x j (π) = M a j π j. i=1 Implications of Gross Substitutability denote the market excess demand function. Let us consider prices on the unit simplex S n, and let Z( ) We show that, if all the goods are gross substitutes at all prices, then, if p is an equilibrium price vector, we have p Z(p) > 0, for all p p S n. In other words, gross substitutability implies that the weak axiom of the revealed preferences holds with respect to the equilibrium price. This result is the basis of several computational results for economies where gross substitutability holds. We will actually show that p Z(p) is minimized at p = p, and that p is the unique minimum. Note that the function p Z(p) is bounded below on the simplex, so that the minimum does exist. Furthermore, the minimum can not be attained on the boundary of the simplex, because of gross substitutability. Therefore we can find the minimum by taking the partial derivatives and setting them to zero:

5 Lecture 8: Market Equilibria 8-5 j=1 p Z j (p) j = 0, k = 1,..., n. p k We first show that the equality above is satisfied for p = p, and then we will prove the uniqueness. By Walras law, we have 0 = (p Z(p)) p k = Since Z k (p ) = 0, we have n j=1 p Z j(p ) j p k = 0. j=1 p j Z j (p) p k + Z k (p). We now show that no other price vector satisfies the condition above. By contradiction, assume that there exists p p such that n j=1 p Z j(p) j p k = 0. Suppose now that h = p r p r Now we have p = max j j p. Since GS implies that Z r (p ) = 0, we have that Z r (p) < 0. j 0 = (p Z(p)) = Since Z r (p) < 0, we must have n j=1 p j Z j(p) > 0. Z j(p) We have 0 = h n j=1 p j This last term is strictly greater than n Z. Now note that the right hand side can be written as p r(p) r +h n j r p Z j(p) j., which is positive. Therefore we have reached a contradiction. j=1 p j Z j (p) + Z r (p). j=1 p j Zj(p) 8.3 Existence of Equilibria Recall that the market equilibrium is a vector of prices π = (π 1,..., π n ) R n + such that the market excess demand Z(π) is well-defined and Z j (π) 0, for each j. Since in general the market excess demand is a set-valued function, the proofs of existence of economic equilibria are based on Kakutani s fixed point theorem. This theorem provides a generalization of Brouwer s fixed point theorem to set-valued functions. However under mild assumptions which avoid boundary complications, the excess demand becomes a singlevalued function, and in this case it is possible to prove the existence of equilibria by means of Brouwer s fixed point theorem. Theorem 8.3 (Equilibrium Theorem) Let Z(π) be a function defined for all nonzero nonnegative price vectors π R m +, and satisfying continuity, homogeneity of degree zero and Walras law. Then there is price vector π such that Z(π ) 0. Proof: The proof is very similar to the proof of Nash Theorem of lecture 4. Consider the functions g j (π) = max{0, Z j (π)}. Define the function f mapping the unit simplex into itself, whose j-th component

6 8-6 Lecture 8: Market Equilibria is f j (π) = πj+gj(π) 1+ k g. It is easy to check that the conditions needed to apply Brouwer s fixed point theorem k(π) hold, so that there is a point π such that f j (π ) = πj, for all j. We want to show that Z j(π ) 0, for all j. Note that there must exist an index t such that Z t (π ) 0. For such a t, we have πt π = t 1+ k g k(π ). But this equality holds only if k g k(π ) = 0, i.e., g k (π ) = 0, for all k. It is interesting to show that from the Equilibrium Theorem it is possible to derive Brouwer s theorem. Theorem 8.4 (Uzawa) The Equilibrium Theorem implies Brouwer s Theorem. Proof: Let f be a continuous function mapping the unit m-simplex into itself. Define a function g mapping the unit m-simplex into R m+1 as follows: g(x) = f(x) x f(x) x x x. It is easy to check that g satisfies the conditions needed to apply the Equilibrium theorem (continuity, homogeneity of degree zero and Walras law). Therefore there exists x such that g(x ) 0. Then some simple algebraic derivations show that the set of points x for which g(x) 0 coincides with the set of points for which f(x) = x. We now sketch the idea of another proof of the existence of equilibria for exchange economies which is based on a transformation of the market scenario into a non-cooperative game. Let us assume that each trader has some positive amount of each good. There are n + 1 players, i.e., the n traders, and the market player. The strategy set of the i-th trader is the positive orthant corresponding to all possible bundles. The strategy set of the market player is the set of points in the price simplex. Given a price π from the simplex, the best response of the i-th player is just her demand at price π. In other words, she picks the bundle x i from the positive orthant maximizing her utility function u i (x) subject to π T x π T w i. Note that the best response of the i-th player depends only on the choice made by the market player. The payoffs are defined in the natural way: a strategy profile (x 1,..., x m, π) yields a payoff of 1 for the i-th player if x i is her demand at price π. Otherwise her payoff is 0. Given a strategy profile (x 1,..., x m, π), the payoff for the market player is π T z, where z = i x i i w i. That is, given (x 1,..., x m ), the best response of the market player is to pick any price from the price simplex that is nonzero only for those components of z that are maximal. Now look at a Nash equilibrium (x 1,..., x m, π) of the game. Since x i is a best response given π, we must have π T x i = π T w i if the function u i ( ) is nonsatiable. It follows that π T z = 0. But then for π to be the best response given (x 1,..., x m ), it must be that each component of z is non-positive: otherwise, the market player can choose π π to get a strictly positive payoff. Thus, both utility maximization and market clearance hold, and we have an equilibrium for the market. Bibliographic notes In 1874, Walras published the famous Elements of Pure Economics, where he describes a model for the state of an economic system in terms of demand and supply, and expresses the supply equal demand equilibrium

7 Lecture 8: Market Equilibria 8-7 conditions [10]. In 1936, Wald gave the first proof of the existence of an equilibrium for the Walrasian system, under severe restrictions [9]. In 1954, Arrow and Debreu proved the existence of an equilibrium under milder assumptions [2]. The main general reference for the market equilibrium problem is [6]; in particular Chapters 16 and 17 present existence proofs at various levels of generality. The version we have shown (the Equilibrium Theorem above) corresponds to Proposition 17.C.2 in [6]. The reverse implication, i.e., the proof of Brouwer s theorem via the Equilibrium Theorem is due to Uzawa [7]. For the definitions, notation, etc., of this lecture we have mainly followed [4]. References [1] K.J. Arrow, H.B. Chenery, B.S. Minhas, R.M. Solow, Capital-Labor Substitution and Economic Efficiency, The Review of Economics and Statistics, 43(3), (1961). [2] K.J. Arrow and G. Debreu, Existence of an Equilibrium for a Competitive Economy, Econometrica 22 (3), pp (1954). [3] K.C. Border, Fixed point Theorems with Applications to Economics and Game Theory, Cambridge University Press (1985). [4] B.Codenotti, S. V. Pemmaraju, K. R. Varadarajan, The computation of market equilibria. SIGACT News 35(4): (2004) [5] E. Eisenberg, Aggregation of Utility Functions. Management Sciences, Vol. 7 (4), (1961). [6] A. Mas-Colell, M.D. Whinston, and J.R. Green, Microeconomic Theory, Oxford University Press (1995). [7] H. Uzawa, Walras s Existence Theorem and Brouwer s Fixed Point Theorem, Econ. Stud. Quart. 13, (1962). [8] H. Varian, Microeconomic Analysis, New York: W.W. Norton (1992). [9] A. Wald, On Some Systems of Equations of Mathematical Economics, Zeitschrift für Nationalökonomie, Vol.7 (1936). Translated: Econometrica, Vol.19 (4), p (1951). [10] L. Walras, Éléments d économie politique pure, ou théorie de la richesse sociale (Elements of Pure Economics, or the theory of social wealth), (1899, 4th ed.; 1926, rev ed., 1954, Engl. transl. Homewood, Ill.: Richard Irwin.)

Notes V General Equilibrium: Positive Theory. 1 Walrasian Equilibrium and Excess Demand

Notes V General Equilibrium: Positive Theory. 1 Walrasian Equilibrium and Excess Demand Notes V General Equilibrium: Positive Theory In this lecture we go on considering a general equilibrium model of a private ownership economy. In contrast to the Notes IV, we focus on positive issues such

More information

Walrasian Demand. u(x) where B(p, w) = {x R n + : p x w}.

Walrasian Demand. u(x) where B(p, w) = {x R n + : p x w}. Walrasian Demand Econ 2100 Fall 2015 Lecture 5, September 16 Outline 1 Walrasian Demand 2 Properties of Walrasian Demand 3 An Optimization Recipe 4 First and Second Order Conditions Definition Walrasian

More information

UCLA. Department of Economics Ph. D. Preliminary Exam Micro-Economic Theory

UCLA. Department of Economics Ph. D. Preliminary Exam Micro-Economic Theory UCLA Department of Economics Ph. D. Preliminary Exam Micro-Economic Theory (SPRING 2011) Instructions: You have 4 hours for the exam Answer any 5 out of the 6 questions. All questions are weighted equally.

More information

Lecture Notes on Elasticity of Substitution

Lecture Notes on Elasticity of Substitution Lecture Notes on Elasticity of Substitution Ted Bergstrom, UCSB Economics 210A March 3, 2011 Today s featured guest is the elasticity of substitution. Elasticity of a function of a single variable Before

More information

Name. Final Exam, Economics 210A, December 2011 Here are some remarks to help you with answering the questions.

Name. Final Exam, Economics 210A, December 2011 Here are some remarks to help you with answering the questions. Name Final Exam, Economics 210A, December 2011 Here are some remarks to help you with answering the questions. Question 1. A firm has a production function F (x 1, x 2 ) = ( x 1 + x 2 ) 2. It is a price

More information

Economics 200B Part 1 UCSD Winter 2015 Prof. R. Starr, Mr. John Rehbeck Final Exam 1

Economics 200B Part 1 UCSD Winter 2015 Prof. R. Starr, Mr. John Rehbeck Final Exam 1 Economics 200B Part 1 UCSD Winter 2015 Prof. R. Starr, Mr. John Rehbeck Final Exam 1 Your Name: SUGGESTED ANSWERS Please answer all questions. Each of the six questions marked with a big number counts

More information

A Fast and Simple Algorithm for Computing Market Equilibria

A Fast and Simple Algorithm for Computing Market Equilibria A Fast and Simple Algorithm for Computing Market Equilibria Lisa Fleischer 1, Rahul Garg 2, Sanjiv Kapoor 3, Rohit Khandekar 2, and Amin Saberi 4 1 Dartmouth College. lkf@cs.dartmouth.edu. 2 IBM T.J. Watson

More information

Working Paper Series

Working Paper Series RGEA Universidade de Vigo http://webs.uvigo.es/rgea Working Paper Series A Market Game Approach to Differential Information Economies Guadalupe Fugarolas, Carlos Hervés-Beloso, Emma Moreno- García and

More information

Learning Market Parameters using Aggregate Demand Queries

Learning Market Parameters using Aggregate Demand Queries Learning Market Parameters using Aggregate Demand Queries Xiaohui Bei Nanyang Technological University Singapore Wei Chen Microsoft Research Beijing, China Jugal Garg MPI für Informatik Saarbrücken, Germany

More information

Economics 2020a / HBS 4010 / HKS API-111 FALL 2010 Solutions to Practice Problems for Lectures 1 to 4

Economics 2020a / HBS 4010 / HKS API-111 FALL 2010 Solutions to Practice Problems for Lectures 1 to 4 Economics 00a / HBS 4010 / HKS API-111 FALL 010 Solutions to Practice Problems for Lectures 1 to 4 1.1. Quantity Discounts and the Budget Constraint (a) The only distinction between the budget line with

More information

Manipulability of the Price Mechanism for Data Centers

Manipulability of the Price Mechanism for Data Centers Manipulability of the Price Mechanism for Data Centers Greg Bodwin 1, Eric Friedman 2,3,4, and Scott Shenker 3,4 1 Department of Computer Science, Tufts University, Medford, Massachusetts 02155 2 School

More information

On the Interaction and Competition among Internet Service Providers

On the Interaction and Competition among Internet Service Providers On the Interaction and Competition among Internet Service Providers Sam C.M. Lee John C.S. Lui + Abstract The current Internet architecture comprises of different privately owned Internet service providers

More information

Advanced Microeconomics

Advanced Microeconomics Advanced Microeconomics Ordinal preference theory Harald Wiese University of Leipzig Harald Wiese (University of Leipzig) Advanced Microeconomics 1 / 68 Part A. Basic decision and preference theory 1 Decisions

More information

U = x 1 2. 1 x 1 4. 2 x 1 4. What are the equilibrium relative prices of the three goods? traders has members who are best off?

U = x 1 2. 1 x 1 4. 2 x 1 4. What are the equilibrium relative prices of the three goods? traders has members who are best off? Chapter 7 General Equilibrium Exercise 7. Suppose there are 00 traders in a market all of whom behave as price takers. Suppose there are three goods and the traders own initially the following quantities:

More information

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

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

More information

Follow links for Class Use and other Permissions. For more information send email to: permissions@pupress.princeton.edu

Follow links for Class Use and other Permissions. For more information send email to: permissions@pupress.princeton.edu COPYRIGHT NOTICE: Ariel Rubinstein: Lecture Notes in Microeconomic Theory is published by Princeton University Press and copyrighted, c 2006, by Princeton University Press. All rights reserved. No part

More information

Duality in Linear Programming

Duality in Linear Programming Duality in Linear Programming 4 In the preceding chapter on sensitivity analysis, we saw that the shadow-price interpretation of the optimal simplex multipliers is a very useful concept. First, these shadow

More information

Mathematical finance and linear programming (optimization)

Mathematical finance and linear programming (optimization) Mathematical finance and linear programming (optimization) Geir Dahl September 15, 2009 1 Introduction The purpose of this short note is to explain how linear programming (LP) (=linear optimization) may

More information

Security Pools and Efficiency

Security Pools and Efficiency Security Pools and Efficiency John Geanakoplos Yale University William R. Zame UCLA Abstract Collateralized mortgage obligations, collateralized debt obligations and other bundles of securities that are

More information

Atomic Cournotian Traders May Be Walrasian

Atomic Cournotian Traders May Be Walrasian Atomic Cournotian Traders May Be Walrasian Giulio Codognato, Sayantan Ghosal, Simone Tonin September 2014 Abstract In a bilateral oligopoly, with large traders, represented as atoms, and small traders,

More information

Economics of Insurance

Economics of Insurance Economics of Insurance In this last lecture, we cover most topics of Economics of Information within a single application. Through this, you will see how the differential informational assumptions allow

More information

A Simple Model of Price Dispersion *

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

More information

Metric Spaces. Chapter 7. 7.1. Metrics

Metric Spaces. Chapter 7. 7.1. Metrics Chapter 7 Metric Spaces A metric space is a set X that has a notion of the distance d(x, y) between every pair of points x, y X. The purpose of this chapter is to introduce metric spaces and give some

More information

1 Introduction. Linear Programming. Questions. A general optimization problem is of the form: choose x to. max f(x) subject to x S. where.

1 Introduction. Linear Programming. Questions. A general optimization problem is of the form: choose x to. max f(x) subject to x S. where. Introduction Linear Programming Neil Laws TT 00 A general optimization problem is of the form: choose x to maximise f(x) subject to x S where x = (x,..., x n ) T, f : R n R is the objective function, S

More information

2.3 Convex Constrained Optimization Problems

2.3 Convex Constrained Optimization Problems 42 CHAPTER 2. FUNDAMENTAL CONCEPTS IN CONVEX OPTIMIZATION Theorem 15 Let f : R n R and h : R R. Consider g(x) = h(f(x)) for all x R n. The function g is convex if either of the following two conditions

More information

Chapter 4. Duality. 4.1 A Graphical Example

Chapter 4. Duality. 4.1 A Graphical Example Chapter 4 Duality Given any linear program, there is another related linear program called the dual. In this chapter, we will develop an understanding of the dual linear program. This understanding translates

More information

Duality of linear conic problems

Duality of linear conic problems Duality of linear conic problems Alexander Shapiro and Arkadi Nemirovski Abstract It is well known that the optimal values of a linear programming problem and its dual are equal to each other if at least

More information

Practice with Proofs

Practice with Proofs Practice with Proofs October 6, 2014 Recall the following Definition 0.1. A function f is increasing if for every x, y in the domain of f, x < y = f(x) < f(y) 1. Prove that h(x) = x 3 is increasing, using

More information

Moral Hazard. Itay Goldstein. Wharton School, University of Pennsylvania

Moral Hazard. Itay Goldstein. Wharton School, University of Pennsylvania Moral Hazard Itay Goldstein Wharton School, University of Pennsylvania 1 Principal-Agent Problem Basic problem in corporate finance: separation of ownership and control: o The owners of the firm are typically

More information

REVIEW OF MICROECONOMICS

REVIEW OF MICROECONOMICS ECO 352 Spring 2010 Precepts Weeks 1, 2 Feb. 1, 8 REVIEW OF MICROECONOMICS Concepts to be reviewed Budget constraint: graphical and algebraic representation Preferences, indifference curves. Utility function

More information

Separation Properties for Locally Convex Cones

Separation Properties for Locally Convex Cones Journal of Convex Analysis Volume 9 (2002), No. 1, 301 307 Separation Properties for Locally Convex Cones Walter Roth Department of Mathematics, Universiti Brunei Darussalam, Gadong BE1410, Brunei Darussalam

More information

6.207/14.15: Networks Lecture 15: Repeated Games and Cooperation

6.207/14.15: Networks Lecture 15: Repeated Games and Cooperation 6.207/14.15: Networks Lecture 15: Repeated Games and Cooperation Daron Acemoglu and Asu Ozdaglar MIT November 2, 2009 1 Introduction Outline The problem of cooperation Finitely-repeated prisoner s dilemma

More information

Sensitivity Analysis 3.1 AN EXAMPLE FOR ANALYSIS

Sensitivity Analysis 3.1 AN EXAMPLE FOR ANALYSIS Sensitivity Analysis 3 We have already been introduced to sensitivity analysis in Chapter via the geometry of a simple example. We saw that the values of the decision variables and those of the slack and

More information

1 Calculus of Several Variables

1 Calculus of Several Variables 1 Calculus of Several Variables Reading: [Simon], Chapter 14, p. 300-31. 1.1 Partial Derivatives Let f : R n R. Then for each x i at each point x 0 = (x 0 1,..., x 0 n) the ith partial derivative is defined

More information

4.6 Linear Programming duality

4.6 Linear Programming duality 4.6 Linear Programming duality To any minimization (maximization) LP we can associate a closely related maximization (minimization) LP. Different spaces and objective functions but in general same optimal

More information

Arrow Debreu Prices. Dirk Becherer, Mark H.A. Davis - this draft: May 26, 2008

Arrow Debreu Prices. Dirk Becherer, Mark H.A. Davis - this draft: May 26, 2008 Arrow Debreu Prices Dirk Becherer, Mark H.A. Davis - this draft: May 26, 2008 Arrow Debreu prices are the prices of atomic time and state contingent claims which deliver one unit of a specific consumption

More information

ALMOST COMMON PRIORS 1. INTRODUCTION

ALMOST COMMON PRIORS 1. INTRODUCTION ALMOST COMMON PRIORS ZIV HELLMAN ABSTRACT. What happens when priors are not common? We introduce a measure for how far a type space is from having a common prior, which we term prior distance. If a type

More information

Practical Guide to the Simplex Method of Linear Programming

Practical Guide to the Simplex Method of Linear Programming Practical Guide to the Simplex Method of Linear Programming Marcel Oliver Revised: April, 0 The basic steps of the simplex algorithm Step : Write the linear programming problem in standard form Linear

More information

Bargaining Solutions in a Social Network

Bargaining Solutions in a Social Network Bargaining Solutions in a Social Network Tanmoy Chakraborty and Michael Kearns Department of Computer and Information Science University of Pennsylvania Abstract. We study the concept of bargaining solutions,

More information

Adverse Selection and the Market for Health Insurance in the U.S. James Marton

Adverse Selection and the Market for Health Insurance in the U.S. James Marton Preliminary and Incomplete Please do not Quote Adverse Selection and the Market for Health Insurance in the U.S. James Marton Washington University, Department of Economics Date: 4/24/01 Abstract Several

More information

TOPIC 4: DERIVATIVES

TOPIC 4: DERIVATIVES TOPIC 4: DERIVATIVES 1. The derivative of a function. Differentiation rules 1.1. The slope of a curve. The slope of a curve at a point P is a measure of the steepness of the curve. If Q is a point on the

More information

Definition and Properties of the Production Function: Lecture

Definition and Properties of the Production Function: Lecture Definition and Properties of the Production Function: Lecture II August 25, 2011 Definition and : Lecture A Brief Brush with Duality Cobb-Douglas Cost Minimization Lagrangian for the Cobb-Douglas Solution

More information

THE FUNDAMENTAL THEOREM OF ARBITRAGE PRICING

THE FUNDAMENTAL THEOREM OF ARBITRAGE PRICING THE FUNDAMENTAL THEOREM OF ARBITRAGE PRICING 1. Introduction The Black-Scholes theory, which is the main subject of this course and its sequel, is based on the Efficient Market Hypothesis, that arbitrages

More information

IMPLEMENTING ARROW-DEBREU EQUILIBRIA BY TRADING INFINITELY-LIVED SECURITIES

IMPLEMENTING ARROW-DEBREU EQUILIBRIA BY TRADING INFINITELY-LIVED SECURITIES IMPLEMENTING ARROW-DEBREU EQUILIBRIA BY TRADING INFINITELY-LIVED SECURITIES Kevin X.D. Huang and Jan Werner DECEMBER 2002 RWP 02-08 Research Division Federal Reserve Bank of Kansas City Kevin X.D. Huang

More information

On Lexicographic (Dictionary) Preference

On Lexicographic (Dictionary) Preference MICROECONOMICS LECTURE SUPPLEMENTS Hajime Miyazaki File Name: lexico95.usc/lexico99.dok DEPARTMENT OF ECONOMICS OHIO STATE UNIVERSITY Fall 993/994/995 Miyazaki.@osu.edu On Lexicographic (Dictionary) Preference

More information

Constrained optimization.

Constrained optimization. ams/econ 11b supplementary notes ucsc Constrained optimization. c 2010, Yonatan Katznelson 1. Constraints In many of the optimization problems that arise in economics, there are restrictions on the values

More information

Vector and Matrix Norms

Vector and Matrix Norms Chapter 1 Vector and Matrix Norms 11 Vector Spaces Let F be a field (such as the real numbers, R, or complex numbers, C) with elements called scalars A Vector Space, V, over the field F is a non-empty

More information

Multi-variable Calculus and Optimization

Multi-variable Calculus and Optimization Multi-variable Calculus and Optimization Dudley Cooke Trinity College Dublin Dudley Cooke (Trinity College Dublin) Multi-variable Calculus and Optimization 1 / 51 EC2040 Topic 3 - Multi-variable Calculus

More information

Gains from Trade. Christopher P. Chambers and Takashi Hayashi. March 25, 2013. Abstract

Gains from Trade. Christopher P. Chambers and Takashi Hayashi. March 25, 2013. Abstract Gains from Trade Christopher P. Chambers Takashi Hayashi March 25, 2013 Abstract In a market design context, we ask whether there exists a system of transfers regulations whereby gains from trade can always

More information

Chapter 7. Sealed-bid Auctions

Chapter 7. Sealed-bid Auctions Chapter 7 Sealed-bid Auctions An auction is a procedure used for selling and buying items by offering them up for bid. Auctions are often used to sell objects that have a variable price (for example oil)

More information

Linear Programming. March 14, 2014

Linear Programming. March 14, 2014 Linear Programming March 1, 01 Parts of this introduction to linear programming were adapted from Chapter 9 of Introduction to Algorithms, Second Edition, by Cormen, Leiserson, Rivest and Stein [1]. 1

More information

Unraveling versus Unraveling: A Memo on Competitive Equilibriums and Trade in Insurance Markets

Unraveling versus Unraveling: A Memo on Competitive Equilibriums and Trade in Insurance Markets Unraveling versus Unraveling: A Memo on Competitive Equilibriums and Trade in Insurance Markets Nathaniel Hendren January, 2014 Abstract Both Akerlof (1970) and Rothschild and Stiglitz (1976) show that

More information

24. The Branch and Bound Method

24. The Branch and Bound Method 24. The Branch and Bound Method It has serious practical consequences if it is known that a combinatorial problem is NP-complete. Then one can conclude according to the present state of science that no

More information

Online Appendix to Stochastic Imitative Game Dynamics with Committed Agents

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

More information

Schooling, Political Participation, and the Economy. (Online Supplementary Appendix: Not for Publication)

Schooling, Political Participation, and the Economy. (Online Supplementary Appendix: Not for Publication) Schooling, Political Participation, and the Economy Online Supplementary Appendix: Not for Publication) Filipe R. Campante Davin Chor July 200 Abstract In this online appendix, we present the proofs for

More information

Decentralization and Private Information with Mutual Organizations

Decentralization and Private Information with Mutual Organizations Decentralization and Private Information with Mutual Organizations Edward C. Prescott and Adam Blandin Arizona State University 09 April 2014 1 Motivation Invisible hand works in standard environments

More information

No: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics

No: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics No: 10 04 Bilkent University Monotonic Extension Farhad Husseinov Discussion Papers Department of Economics The Discussion Papers of the Department of Economics are intended to make the initial results

More information

Math 120 Final Exam Practice Problems, Form: A

Math 120 Final Exam Practice Problems, Form: A Math 120 Final Exam Practice Problems, Form: A Name: While every attempt was made to be complete in the types of problems given below, we make no guarantees about the completeness of the problems. Specifically,

More information

Numerical methods for American options

Numerical methods for American options Lecture 9 Numerical methods for American options Lecture Notes by Andrzej Palczewski Computational Finance p. 1 American options The holder of an American option has the right to exercise it at any moment

More information

Macroeconomics Lecture 1: The Solow Growth Model

Macroeconomics Lecture 1: The Solow Growth Model Macroeconomics Lecture 1: The Solow Growth Model Richard G. Pierse 1 Introduction One of the most important long-run issues in macroeconomics is understanding growth. Why do economies grow and what determines

More information

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a

More information

Follow links for Class Use and other Permissions. For more information send email to: permissions@pupress.princeton.edu

Follow links for Class Use and other Permissions. For more information send email to: permissions@pupress.princeton.edu COPYRIGHT NOTICE: Ariel Rubinstein: Lecture Notes in Microeconomic Theory is published by Princeton University Press and copyrighted, c 2006, by Princeton University Press. All rights reserved. No part

More information

On the Existence of Nash Equilibrium in General Imperfectly Competitive Insurance Markets with Asymmetric Information

On the Existence of Nash Equilibrium in General Imperfectly Competitive Insurance Markets with Asymmetric Information analysing existence in general insurance environments that go beyond the canonical insurance paradigm. More recently, theoretical and empirical work has attempted to identify selection in insurance markets

More information

15 Kuhn -Tucker conditions

15 Kuhn -Tucker conditions 5 Kuhn -Tucker conditions Consider a version of the consumer problem in which quasilinear utility x 2 + 4 x 2 is maximised subject to x +x 2 =. Mechanically applying the Lagrange multiplier/common slopes

More information

14.452 Economic Growth: Lecture 11, Technology Diffusion, Trade and World Growth

14.452 Economic Growth: Lecture 11, Technology Diffusion, Trade and World Growth 14.452 Economic Growth: Lecture 11, Technology Diffusion, Trade and World Growth Daron Acemoglu MIT December 2, 2014. Daron Acemoglu (MIT) Economic Growth Lecture 11 December 2, 2014. 1 / 43 Introduction

More information

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +

More information

6.254 : Game Theory with Engineering Applications Lecture 2: Strategic Form Games

6.254 : Game Theory with Engineering Applications Lecture 2: Strategic Form Games 6.254 : Game Theory with Engineering Applications Lecture 2: Strategic Form Games Asu Ozdaglar MIT February 4, 2009 1 Introduction Outline Decisions, utility maximization Strategic form games Best responses

More information

IBM Research Report. A Pricing Problem under Monge Property

IBM Research Report. A Pricing Problem under Monge Property RC23823 (W0512-010) December 2, 2005 Mathematics IBM Research Report A Pricing Problem under Monge Property Oktay Günlük IBM Research Division Thomas J. Watson Research Center P.O. Box 218 Yorktown Heights,

More information

ECON20310 LECTURE SYNOPSIS REAL BUSINESS CYCLE

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

More information

Migration with Local Public Goods and the Gains from Changing Places

Migration with Local Public Goods and the Gains from Changing Places Migration with Local Public Goods and the Gains from Changing Places Peter J. Hammond Department of Economics, University of Warwick, Coventry CV4 7AL, U.K. p.j.hammond@warwick.ac.edu Jaume Sempere C.E.E.,

More information

A short note on American option prices

A short note on American option prices A short note on American option Filip Lindskog April 27, 2012 1 The set-up An American call option with strike price K written on some stock gives the holder the right to buy a share of the stock (exercise

More information

Lecture 2: Consumer Theory

Lecture 2: Consumer Theory Lecture 2: Consumer Theory Preferences and Utility Utility Maximization (the primal problem) Expenditure Minimization (the dual) First we explore how consumers preferences give rise to a utility fct which

More information

The Walrasian Model and Walrasian Equilibrium

The Walrasian Model and Walrasian Equilibrium The Walrasian Model and Walrasian Equilibrium 1.1 There are only two goods in the economy and there is no way to produce either good. There are n individuals, indexed by i = 1,..., n. Individual i owns

More information

ECON 40050 Game Theory Exam 1 - Answer Key. 4) All exams must be turned in by 1:45 pm. No extensions will be granted.

ECON 40050 Game Theory Exam 1 - Answer Key. 4) All exams must be turned in by 1:45 pm. No extensions will be granted. 1 ECON 40050 Game Theory Exam 1 - Answer Key Instructions: 1) You may use a pen or pencil, a hand-held nonprogrammable calculator, and a ruler. No other materials may be at or near your desk. Books, coats,

More information

Math 4310 Handout - Quotient Vector Spaces

Math 4310 Handout - Quotient Vector Spaces Math 4310 Handout - Quotient Vector Spaces Dan Collins The textbook defines a subspace of a vector space in Chapter 4, but it avoids ever discussing the notion of a quotient space. This is understandable

More information

MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.

MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1. MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column

More information

What is Linear Programming?

What is Linear Programming? Chapter 1 What is Linear Programming? An optimization problem usually has three essential ingredients: a variable vector x consisting of a set of unknowns to be determined, an objective function of x to

More information

The Heat Equation. Lectures INF2320 p. 1/88

The Heat Equation. Lectures INF2320 p. 1/88 The Heat Equation Lectures INF232 p. 1/88 Lectures INF232 p. 2/88 The Heat Equation We study the heat equation: u t = u xx for x (,1), t >, (1) u(,t) = u(1,t) = for t >, (2) u(x,) = f(x) for x (,1), (3)

More information

Maximum Likelihood Estimation

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

More information

1 Solving LPs: The Simplex Algorithm of George Dantzig

1 Solving LPs: The Simplex Algorithm of George Dantzig Solving LPs: The Simplex Algorithm of George Dantzig. Simplex Pivoting: Dictionary Format We illustrate a general solution procedure, called the simplex algorithm, by implementing it on a very simple example.

More information

The Cobb-Douglas Production Function

The Cobb-Douglas Production Function 171 10 The Cobb-Douglas Production Function This chapter describes in detail the most famous of all production functions used to represent production processes both in and out of agriculture. First used

More information

Mathematics Course 111: Algebra I Part IV: Vector Spaces

Mathematics Course 111: Algebra I Part IV: Vector Spaces Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are

More information

Systems of Linear Equations

Systems of Linear Equations Systems of Linear Equations Beifang Chen Systems of linear equations Linear systems A linear equation in variables x, x,, x n is an equation of the form a x + a x + + a n x n = b, where a, a,, a n and

More information

Linear Programming. April 12, 2005

Linear Programming. April 12, 2005 Linear Programming April 1, 005 Parts of this were adapted from Chapter 9 of i Introduction to Algorithms (Second Edition) /i by Cormen, Leiserson, Rivest and Stein. 1 What is linear programming? The first

More information

Game Theory: Supermodular Games 1

Game Theory: Supermodular Games 1 Game Theory: Supermodular Games 1 Christoph Schottmüller 1 License: CC Attribution ShareAlike 4.0 1 / 22 Outline 1 Introduction 2 Model 3 Revision questions and exercises 2 / 22 Motivation I several solution

More information

1. Prove that the empty set is a subset of every set.

1. Prove that the empty set is a subset of every set. 1. Prove that the empty set is a subset of every set. Basic Topology Written by Men-Gen Tsai email: b89902089@ntu.edu.tw Proof: For any element x of the empty set, x is also an element of every set since

More information

The previous chapter introduced a number of basic facts and posed the main questions

The previous chapter introduced a number of basic facts and posed the main questions 2 The Solow Growth Model The previous chapter introduced a number of basic facts and posed the main questions concerning the sources of economic growth over time and the causes of differences in economic

More information

Microeconomic Theory: Basic Math Concepts

Microeconomic Theory: Basic Math Concepts Microeconomic Theory: Basic Math Concepts Matt Van Essen University of Alabama Van Essen (U of A) Basic Math Concepts 1 / 66 Basic Math Concepts In this lecture we will review some basic mathematical concepts

More information

Linear Programming Supplement E

Linear Programming Supplement E Linear Programming Supplement E Linear Programming Linear programming: A technique that is useful for allocating scarce resources among competing demands. Objective function: An expression in linear programming

More information

Discrete Optimization

Discrete Optimization Discrete Optimization [Chen, Batson, Dang: Applied integer Programming] Chapter 3 and 4.1-4.3 by Johan Högdahl and Victoria Svedberg Seminar 2, 2015-03-31 Todays presentation Chapter 3 Transforms using

More information

Notes on Determinant

Notes on Determinant ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 9-18/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without

More information

Consumer Theory. The consumer s problem

Consumer Theory. The consumer s problem Consumer Theory The consumer s problem 1 The Marginal Rate of Substitution (MRS) We define the MRS(x,y) as the absolute value of the slope of the line tangent to the indifference curve at point point (x,y).

More information

Example 1. Consider the following two portfolios: 2. Buy one c(s(t), 20, τ, r) and sell one c(s(t), 10, τ, r).

Example 1. Consider the following two portfolios: 2. Buy one c(s(t), 20, τ, r) and sell one c(s(t), 10, τ, r). Chapter 4 Put-Call Parity 1 Bull and Bear Financial analysts use words such as bull and bear to describe the trend in stock markets. Generally speaking, a bull market is characterized by rising prices.

More information

The Multiplicative Weights Update method

The Multiplicative Weights Update method Chapter 2 The Multiplicative Weights Update method The Multiplicative Weights method is a simple idea which has been repeatedly discovered in fields as diverse as Machine Learning, Optimization, and Game

More information

Lecture 2. Marginal Functions, Average Functions, Elasticity, the Marginal Principle, and Constrained Optimization

Lecture 2. Marginal Functions, Average Functions, Elasticity, the Marginal Principle, and Constrained Optimization Lecture 2. Marginal Functions, Average Functions, Elasticity, the Marginal Principle, and Constrained Optimization 2.1. Introduction Suppose that an economic relationship can be described by a real-valued

More information

4: SINGLE-PERIOD MARKET MODELS

4: SINGLE-PERIOD MARKET MODELS 4: SINGLE-PERIOD MARKET MODELS Ben Goldys and Marek Rutkowski School of Mathematics and Statistics University of Sydney Semester 2, 2015 B. Goldys and M. Rutkowski (USydney) Slides 4: Single-Period Market

More information

Linear Programming Notes V Problem Transformations

Linear Programming Notes V Problem Transformations Linear Programming Notes V Problem Transformations 1 Introduction Any linear programming problem can be rewritten in either of two standard forms. In the first form, the objective is to maximize, the material

More information

Choice under Uncertainty

Choice under Uncertainty Choice under Uncertainty Part 1: Expected Utility Function, Attitudes towards Risk, Demand for Insurance Slide 1 Choice under Uncertainty We ll analyze the underlying assumptions of expected utility theory

More information

Chapter 27: Taxation. 27.1: Introduction. 27.2: The Two Prices with a Tax. 27.2: The Pre-Tax Position

Chapter 27: Taxation. 27.1: Introduction. 27.2: The Two Prices with a Tax. 27.2: The Pre-Tax Position Chapter 27: Taxation 27.1: Introduction We consider the effect of taxation on some good on the market for that good. We ask the questions: who pays the tax? what effect does it have on the equilibrium

More information

Continued Fractions and the Euclidean Algorithm

Continued Fractions and the Euclidean Algorithm Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction

More information