Assignment for Mathematics for Economists Fall 2016

Similar documents
Bogoliubov Transformation in Classical Mechanics

Lecture 21. The Lovasz splitting-off lemma Topics in Combinatorial Optimization April 29th, 2004

(b) Is the game below solvable by iterated strict dominance? Does it have a unique Nash equilibrium?

Stochastic Neoclassical Growth Model

Problem Set 8 Solutions

Feedback Control Systems (FCS)

Chapter 4. The Laplace Transform Method

μ + = σ = D 4 σ = D 3 σ = σ = All units in parts (a) and (b) are in V. (1) x chart: Center = μ = 0.75 UCL =

Laplace Transformation

Convex Hulls of Curves Sam Burton

Department of Mechanical Engineering Massachusetts Institute of Technology Modeling, Dynamics and Control III Spring 2002

SOME RESULTS ON INFINITE POWER TOWERS

Clustering Methods without Given Number of Clusters

Lecture 7: Testing Distributions

Preemptive scheduling on a small number of hierarchical machines

An Inequality for Nonnegative Matrices and the Inverse Eigenvalue Problem

Riemann s Functional Equation is Not a Valid Function and Its Implication on the Riemann Hypothesis. Armando M. Evangelista Jr.

7.2 INVERSE TRANSFORMS AND TRANSFORMS OF DERIVATIVES 281

TRANSITION PROBABILITY MATRIX OF BRIDGE MEMBERS DAMAGE RATING

Codes Correcting Two Deletions

Riemann s Functional Equation is Not Valid and its Implication on the Riemann Hypothesis. Armando M. Evangelista Jr.

1. The F-test for Equality of Two Variances

Chapter Landscape of an Optimization Problem. Local Search. Coping With NP-Hardness. Gradient Descent: Vertex Cover

Jul 4, 2005 turbo_code_primer Revision 0.0. Turbo Code Primer

DIFFERENTIAL EQUATIONS

March 18, 2014 Academic Year 2013/14

Target-Hardening Decisions Based on Uncertain Multiattribute Terrorist Utility

SIMON FRASER UNIVERSITY School of Engineering Science ENSC 320 Electric Circuits II. Solutions to Assignment 3 February 2005.

Uniform Acceleration Problems Chapter 2: Linear Motion

Social Studies 201 Notes for November 14, 2003

STOCHASTIC GENERALIZED TRANSPORTATION PROBLEM WITH DISCRETE DISTRIBUTION OF DEMAND

Constant Force: Projectile Motion

Sociology 376 Exam 1 Spring 2011 Prof Montgomery

DIVISIBLE UPDATING MARTIN W. CRIPPS

Linear System Fundamentals

SOLUTIONS TO ALGEBRAIC GEOMETRY AND ARITHMETIC CURVES BY QING LIU. I will collect my solutions to some of the exercises in this book in this document.

ON A CERTAIN FAMILY OF QUARTIC THUE EQUATIONS WITH THREE PARAMETERS. Volker Ziegler Technische Universität Graz, Austria

Avoiding Forbidden Submatrices by Row Deletions

Theoretical Computer Science. Optimal algorithms for online scheduling with bounded rearrangement at the end

Computers and Mathematics with Applications. Sharp algebraic periodicity conditions for linear higher order

Exercises for lectures 19 Polynomial methods

ON A CERTAIN FAMILY OF QUARTIC THUE EQUATIONS WITH THREE PARAMETERS

c n b n 0. c k 0 x b n < 1 b k b n = 0. } of integers between 0 and b 1 such that x = b k. b k c k c k

MAE140 Linear Circuits Fall 2012 Final, December 13th

Lecture 15 - Current. A Puzzle... Advanced Section: Image Charge for Spheres. Image Charge for a Grounded Spherical Shell

State Space: Observer Design Lecture 11

Hybrid Control and Switched Systems. Lecture #6 Reachability

NAME (pinyin/italian)... MATRICULATION NUMBER... SIGNATURE

arxiv: v1 [math.mg] 25 Aug 2011

6. KALMAN-BUCY FILTER

IEOR 3106: Fall 2013, Professor Whitt Topics for Discussion: Tuesday, November 19 Alternating Renewal Processes and The Renewal Equation

Social Studies 201 Notes for March 18, 2005

TESTABLE IMPLICATIONS OF TRANSLATION INVARIANCE AND HOMOTHETICITY: VARIATIONAL, MAXMIN, CARA AND CRRA PREFERENCES

Dimensional Analysis A Tool for Guiding Mathematical Calculations

Singular perturbation theory

TRIPLE SOLUTIONS FOR THE ONE-DIMENSIONAL

1 Routh Array: 15 points

1 Bertrand duopoly with incomplete information

Technical Appendix: Auxiliary Results and Proofs

Optimal Coordination of Samples in Business Surveys

CMSC 474, Introduction to Game Theory Maxmin and Minmax Strategies

Financial Frictions, Investment, and Tobin s q

Notes on Strategic Substitutes and Complements in Global Games

Reinforcement Learning

Chapter 2 Sampling and Quantization. In order to investigate sampling and quantization, the difference between analog

Physics 741 Graduate Quantum Mechanics 1 Solutions to Final Exam, Fall 2014

Optimal financing and dividend control of the insurance company with proportional reinsurance policy

Research Article Existence for Nonoscillatory Solutions of Higher-Order Nonlinear Differential Equations

Stratified Analysis of Probabilities of Causation

Given the following circuit with unknown initial capacitor voltage v(0): X(s) Immediately, we know that the transfer function H(s) is

A FUNCTIONAL BAYESIAN METHOD FOR THE SOLUTION OF INVERSE PROBLEMS WITH SPATIO-TEMPORAL PARAMETERS AUTHORS: CORRESPONDENCE: ABSTRACT

Correction for Simple System Example and Notes on Laplace Transforms / Deviation Variables ECHE 550 Fall 2002

Conservation of Energy

MATEMATIK Datum: Tid: eftermiddag. A.Heintz Telefonvakt: Anders Martinsson Tel.:

Source slideplayer.com/fundamentals of Analytical Chemistry, F.J. Holler, S.R.Crouch. Chapter 6: Random Errors in Chemical Analysis

Pacific Journal of Mathematics

A PROOF OF TWO CONJECTURES RELATED TO THE ERDÖS-DEBRUNNER INEQUALITY

Primitive Digraphs with the Largest Scrambling Index

An inventory model with temporary price discount when lead time links to order quantity

Control of Delayed Integrating Processes Using Two Feedback Controllers R MS Approach

Beta Burr XII OR Five Parameter Beta Lomax Distribution: Remarks and Characterizations

DIFFERENTIAL EQUATIONS Laplace Transforms. Paul Dawkins

LINEAR ALGEBRA METHOD IN COMBINATORICS. Theorem 1.1 (Oddtown theorem). In a town of n citizens, no more than n clubs can be formed under the rules

Bayesian Learning, Randomness and Logic. Marc Snir

ME2142/ME2142E Feedback Control Systems


ON THE APPROXIMATION ERROR IN HIGH DIMENSIONAL MODEL REPRESENTATION. Xiaoqun Wang

Linear Motion, Speed & Velocity

Lecture 8. PID control. Industrial process control ( today) PID control. Insights about PID actions

Online Appendix for Corporate Control Activism

ALLOCATING BANDWIDTH FOR BURSTY CONNECTIONS

NCAAPMT Calculus Challenge Challenge #3 Due: October 26, 2011

Comparing Means: t-tests for Two Independent Samples

Savage in the Market 1

PHYS 110B - HW #6 Spring 2004, Solutions by David Pace Any referenced equations are from Griffiths Problem statements are paraphrased

A Constraint Propagation Algorithm for Determining the Stability Margin. The paper addresses the stability margin assessment for linear systems

A Partially Backlogging Inventory Model for Deteriorating Items with Ramp Type Demand Rate

Minimal state space realization of MIMO systems in the max algebra

CS 170: Midterm Exam II University of California at Berkeley Department of Electrical Engineering and Computer Sciences Computer Science Division

arxiv: v1 [math.co] 17 Nov 2014

Transcription:

Due date: Mon. Nov. 1. Reading: CSZ, Ch. 5, Ch. 8.1 Aignment for Mathematic for Economit Fall 016 We now turn to finihing our coverage of concavity/convexity. There are two part: Jenen inequality for concave/convex function and it implication in expected utility theory and the value of information; contrained optimization. Below you will find a hort et of note on the value of information (in the finite etting where thing are eaiet). A to contrained maximization: CSZ 5.8 give more practice with Lagrangean multiplier; CSZ 5.9 fixe firmly in your mind that the multiplier are the derivative of the value function. For twice continuouly differentiable function, CSZ 5.10 take you through a proof of the alternating ign of principal minor of the Jacobean implie concavity reult. We will cover it in lecture with a quick review of the neceary linear algebra. In the Spring emeter, you will be taking Econometric I, remembering, or learning, or re-learning linear algebra hould happen before then. A Very Short Introduction to the Value of Information There i a joint ditribution pdf, q(, ), for a random ignal, S and a random tate X, that i, q(x, ) = P rob(x = x, S = ), everything taking value in finite pace, X for X and S for S. The time line i: S = i oberved for ome S, but the value of X i not oberved, perhap becaue it han t happened yet; the deciion maker pick an action a A, ince it can be, and uually i, a function of, thi i written a(); the value of X = x i oberved; von Neumann-Morgentern utility of u(a, x) i received. The expected utility maximization problem i to pick a function from obervation to action, a(), o a to maximize (1) ( ) E u(a(s), X) = x, u(a(), x)q(x, ). One can olve thi problem by formulating a complete contingent plan, a(), or one can cro that bridge when one come to it, that i, wait until S = ha been oberved and figure out at that point what a() hould be. Let = x q(x, ), rewrite E u = x, u(a(), x)q(x, ) a () q(x,) x u(a(), x). β(x ) := q(x,) i the poterior probability that X = x after S = ha been oberved. A i well-known and eay to verify, if a () olve max a x u(a, x) β(x ) at each with > 0, then a ( ) olve the original maximization problem in ( ). In other word, the dynamically conitent optimality of bet reponding to belief formed by Bayeian updating arie from the linearity of expected utility in probabilitie. The piece of the baic tatitical deciion model are: 1

β 0 (x) := q(x, ), the marginal of q on X, known a the prior ditribution a in the probability ditribution that the deciion maker ha prior to oberving and incorporating any information contained in the ignal; := x q(x, ), the marginal of q on S, the ditribution of the ignal; and β( ) = q(,), the poterior ditribution, i.e. the conditional ditribution of X given that S =. The martingale property of belief i the obervation that the prior i the π-weighted convex combination of the poterior, for all x, (3) E (β(x S)) = β(x ) = q(x, ) = q(x, ) = β 0 (x). To put thi more directly, the average of the poterior i the prior, or, thinking of B a a random vector of belief and S a the random ignal, thi i repeating the law of iterated expectation, E (E (B S)) = E B. Belief at, β( ) belong to (X ) and have ditribution π. Re-writing, Information i a ditribution, π ( (X )) having mean equal to the prior. Blackwell (1950, 1951) howed that all ignal tructure are equivalent to uch ditribution. Now, the value of the information, π, i the increae in expected utility that come from receiving ignal and acting optimally in repone. To get at thi, for β (X ), define (4) V (β) = max a A x u(a, x) β(x). Being the maximimum of affine function, V ( ) i convex, thi becaue it epigraph, {(β, r) : V (β) r} i, by the definition, equal to the interection of a et of cloed half-plane. Returning to the increae in expected utility that come from receiving ignal and acting optimally in repone, if there i no information, the expected utility i V (β 0 ), o the value of π i (5) V (β) dπ(β) V (β (X ) 0). An eay obervation: if information never lead to a change in the action picked at β 0, then the value of π i 0. Problem A. Prove the eay obervation jut given. [If you tart working very hard on thi problem, then you are doing it the wrong way.] B. From Chapter 8.1: 8.1.3 and 8.1.4. C. [Infratructure invetment] X = G or X = B correpond to the future weather pattern, the action are to Leave the infratructure alone or to put in New infratructure, and the ignal,, i the reult of invetigation and reearch into the ditribution of future value of X. The utilitie u(a, x) are given in the following table where c i the cot of the new infratructure.

Good Bad L 10 6 N (10 c) (9 c) 1. After you ee a ignal S =, you form your poterior belief β(g ) and β(b ). For what value of β(g ) do you optimally chooe to leave the infratructure a it i? Expre thi inequality a L if c > M, give the value of M in term of β(g ), and interpret. [You hould have omething like leave the old infratructure a it i if cot are larger than expected gain. ]. If c = 0.60, that i, if the new infratructure cot 0% of the damage it prevent, give the et of β(g ) for which it optimal to leave the old infratructure in place. For the ret of thi problem, aume that c = 0.60. 3. Suppoe that the original or prior ditribution ha β(g) = 0.75 o that, without any extra information, one would put in the N ew infratructure. We now introduce ome ignal tructure. Suppoe that we can run tet/experiment that yield S = G or S = B with P (S = G G) = α 1 and P (S = B B) = γ 1. The joint ditribution, q(, ), i Good Bad G α 0.75 (1 γ) 0.5 B (1 α) 0.75 γ 0.5 Give β( S = G ) and β( S = B ). Verify that the average of the poterior belief i the prior, that i, verify that β( x) = β( ). 4. Show that if α = γ = 1, then the ignal tructure i worthle. 5. Give the et of (α, γ) ( 1, 1 ) for which the information tructure trictly increae the expected utility of the deciion maker. [You hould find that what matter for increaing utility i having a poitive probability of changing the deciion.] D. [The value of repeated independent obervation] Thi problem continue where the previou problem left off. Now uppoe that the tet/experiment can be run twice and that the reult are independent acro the trial. Thu, P (S = ( G, G ) G) = α, P (S = ( G, B ) G) = P (S = ( B, G ) G) = α(1 α), and P (S = ( B, B ) G) = (1 α) with the parallel pattern for B. 1. Fill in the probabilitie in the following joint ditribution q(, ). Verify that the average of poterior belief i the prior belief. ( G, G ) ( G, B ) ( B, G ) ( B, B ) Good. Give β(g ( G, G )), β(g ( G, B )), β(g ( B, G )), and β(g ( B, B )). 3. Show that if α = β = 1, then the ignal tructure i worthle. 4. Give the et of (α, β) ( 1, 1 ) for which the information tructure trictly increae the expected utility of the deciion maker. Bad 3

5. Explain why the et i larger here than it wa in the previou problem. E. [A more theoretical problem] We ay that ignal tructure A i unambiguouly better than ignal tructure B if every deciion maker, no matter what their action et and what their utility function are, would at leat weakly prefer A to B. Thi problem ak you to examine ome part of thi definition. Let u uppoe that the random variable take on two poible value, x and x, with probabilitie p > 0 and p = (1 p) > 0, that there are two poible action, a and b, that the ignal take on two value and, that the ignal tructure i given by and that the utilitie are given by x x αp (1 γ)p (1 α)p γp x x a u(a, x) u(a, x ) b u(b, x) u(b, x ) We aume that α > 1 and γ > 1 and we let V (α, γ) denote the maximal expected utility when the ignal are ditributed a above and the utilitie are above. 1. Show that V (α, γ) V ( 1, 1), that i, the information tructure with α > 1 and γ > 1 i unambiguouly better than the tructure with α = γ = 1.. Give utilitie uch that V (α, γ) > V ( 1, 1 ), that i, how that ome deciion maker trictly prefer the information tructure with α > 1 and γ > 1 to the tructure with α = γ = 1. 3. Show that for any utilitie, if α > α 1 and γ > γ 1, then V (α, γ ) V (α, γ). 4. Give utilitie uch that V (α, γ ) V (α, γ) for α > α 1 and γ > γ 1. F. [Another theoretical problem] A way to make information le valuable i to cramble it. Let T be a random ignal that ha ditribution P ( S = ) and uppoe that, conditional on S =, T i independent of X. (Note that thi rule out the more valuable cae of repeated obervation above.) Show that the ignal tructure T i (weakly) le valuable than the ignal tructure S. [Do not tart thi problem until you have found a good definition of conditional independence.] G. The Joint Stock Act of 1844 (in Britain) allowed for the formation of joint-tock companie that were, for the firt time, not government granted monopolie. The Limited Liability Act of 1855 meant that one could loe up to and including one entire invetment in a firm, but no more. It i not urpriing that thi led to more invetment. Let X be a random variable taking both negative and poitive value and having E X = (1 + r) for r > 0 being the expected rate of return, and let Y = max{0, X}. 1. Show that ay firt order tochatically dominate ax for all a 0. 4

. Show that it i poible to have a random variable X be rikier than X and have Y := max{0, X } firt order tochatically dominate Y = max{0, X}. 3. Conider the two problem max a 0 [u(w 0 a) + ρe u(w 1 + ax)] and max a 0 [u(w 0 a) + ρe u(w 1 + ay )] where 0 < ρ < 1. Give general condition under which the olution to the econd problem i larger than the olution to the firt problem, and prove that your condition deliver thi concluion. H. The deciion maker ha wealth w 0 at preent and next period wealth i a random variable W 1. Saving can be put into a rik-free aet with rate of return r. Conider the problem max a 0 [u(w 0 a) + ρe u(w 1 + a(1 + r))] where 0 < ρ < 1. 1. Give ufficient condition for a to be larger when W 1 become rikier and prove that your condition deliver thi concluion.. Now uppoe that one can alo invet b 0 in a riky aet with return X 0 per each unit inveted and that E X > (1 + r). Conider the problem max a,b 0 [u(w 0 (a + b)) + ρe u(w 1 + a(1 + r) + bx)] where X i tochatically independent of W 1. Under the condition you found above, can you tell what happen to a and b if X become rikier? What about if W 1 become rikier? I. From Chapter 5.8: 5.8.17, 5.8.18, and 5.8.19. J. From Chapter 5.8: 5.8.0, and 5.8.1. K. From Chapter 5.8: 5.8., 5.8.3, and 5.8.4. L. From Chapter 5.9: 5.9., 5.9.5, 5.9.6, and 5.9.7. 5