Answers to Econ 210A Midterm, October A. The function f is homogeneous of degree 1/2. To see this, note that for all t > 0 and all (x 1, x 2 )
|
|
- Marilyn Chase
- 5 years ago
- Views:
Transcription
1 Question. Answers to Econ 20A Midter, October 200 f(x, x 2 ) = ax {x, x 2 } A. The function f is hoogeneous of degree /2. To see this, note that for all t > 0 and all (x, x 2 ) f(tx, x 2 ) = ax {tx, tx 2 } = t ax {x, x 2 } = t /2 ax {x, x 2 } () = t /2 f(x, x 2 ) B. The function f is neither concave, nor quasi-concave. One should be able to see this quickly by drawing an indifference curve and seeing that the at-leastas-good set is not convex. Therefore the function is not quasi-concave. Since a concave function ust be quasi-concave, f cannot be concave either. One can show that the function is not quasi-concave by eans of a single exaple. Let x = (, 0) and x = (0, ). Then f(x) = f(x ) =. Now consider the convex cobination tx + ( t)x = (t, t) where 0 < t <. If f is quasi-concave, then it ust be that f(tx + ( t)x ) f(x ). But f(tx + ( t)x ) = t < f(x ) =. So f cannot be quasi-concave. We also note fro this sae exaple that tf(x) + ( t)f(x ) = > f(tx + ( t)x ) = t. But if f is a concave function tf(x) + ( t)f(x ) f(tx + ( t)x ), so x is not a concave function. C The function f is not a convex function. The square root sign should be a tipoff. Square root is a strictly concave function. To show that f is not a convex function, consider the two points x = (, 0) and x = (4, 0). Then f(x) = and f(x ) = 2. Therefore 2 f(x) + 2 f(x ) = 2.5. But f( 2 x + 2 x ) = f(2.5, 0) = 2.5 < 2 f(x) + 2 f(x ) The function f is a quasi-convex function. A quick way to see that this ust be true is to look at an indifference curve and see that it looks like the worse-than sets ust be convex. To show this forally, suppose f(x, x 2 ) f(x, x 2). Then f(x, x 2 ) = ax x, x 2, x 3, x 4 If 0 < t <, then f(tx + ( t)x ) = ax{tx + ( t)x 2, tx + ( t)x 2} ax x, x 2, x 3, x 4 = f(x, x 2 )
2 Therefore if f(x) f(x ), then f(tx + ( t)x ) f(x ) which eans that f is quasiconcave. Question 2. Ms Rodent s utility function is Wild Thing s utility function is u(x, x 2 ) = (in{x, x 2 }) 2. u(x, x 2 ) = ax{x, x 2 }. A. Ms Rodent s Marshallian deand function is x (p, ) = x 2 (p, ) = Her indirect utility function is ( v(p, ) = ) 2 Her expenditure function is e(p, u) = u( ). Her Hicksian deand function is h (p, u) = u h 2 (p, u) = u B. Wild Thing s deand function is defined as follows: If p < p 2, x (p, ) = p and x 2 (p, ) = 0. If p > p 2, x (p, ) = 0 and x 2 (p, ) = p 2. If p = p 2 = p, then Wild Thing can axiize his utility at either of two possible deand vectors. These are (x, x 2 ) = ( p, 0), and (x, x 2 ) = (0, p ). Wild Thing s indirect utility function is His expenditure function is v(p, ) = in{p, p 2 } e(p, u) = in {p, p 2 }u If p < p 2, his Hicksian deands are h (p, u) = u and h 2 (p, u) = 0. If p > p 2, his Hicksian deands are h (p, u) = 0 and h 2 (p, u) = u. 2
3 If p = p 2 = p, then there are two bundles either of which would iniize cost of achieving utility u. These are (/p, 0) and (0, /p). C. The Slutsky substitution atrix for Ms Rodent is ( 0 0 ) 0 0 The substitution effect of a price change is zero. If prices are changed, she will continue to consue equal aounts of the two goods. If her incoe is adjusted so that she is exactly as well off as before the price change, she will consue exactly as uch of each bundle as before the price change. Question 3. f(x, x 2 ) = x + x 2 + ax x 2 x2 2 x2 2 2 A. The gradient of f is the vector ( + ax 2 x, + ax x 2 ). Evaluated at (x, x 2 ) = (, 2), this gradient is (2a, a ). B. The Hessian of f is ( a ) a C. The function f will be concave if and only if the Hessian is negative seidefinite. This will be the case if the deterinants of the odd-nubered principle inors are nonpositive and the even-nubered are nonnegative. In the case of our atrix this eans that the diagonals ust be non-positive and the 2x2 Hessian ust be non-negative. In out case, both diagonals are negative. The deterinant of the Hessian is a 2 which is nonnegative if and only if a. So f is concave if and only if a. D. The point at which the gradient of f is zero will be a global ax if f is strictly concave. The function f will be strictly concave if < a <. The gradient of f is zero at (x, x 2 ) if + ax 2 x = 0 and + ax x 2 = 0. Solving these two equations, we find x = x 2 = a. Assuing that < a <, at the point of axiization, we have f(x, x 2 ) = 2 a + a ( a) 2 = a. Notice that if a, then f(x, x) = 2x + (a )x 2, which can be ade arbitrarily large by choosing x large enough. So f has no axiu. 3
4 If a <, then f(x, x) = ( a )x 2 where a > 0. Therefore f can be ade arbitrarily large by choosing x large enough. So again f has no axiu. We have one ore case to worry about. What if a =? Here is one way to dispose of this case. If a =, then f is concave, but not strictly concave. If there is a global axiu, it ust be at the point ( ) x 0 = a, = (/2, /2). a Consider the function F (t) = f(x 0 + ty). Consider the Taylor s series expansion of F, which is F (t) = F (0) + tf (0) + t2 2 F (t) + ultiples of higher derivatives of F. Since the Hessian H(x 0 ) of f is negative seidefinite when a =, we know that F (t) = i j H ijy i y j 0 for all y. The second derivative F (t) does not depend on t. So all higher derivatives are zero. Therefore F (t) = F (0) + tf (0) + t2 2 F (t) 0. This eans that for all y and all t, F (x 0 + ty) F ( 0 ) which iplies that f achieves a global axiu at x 0 = (/2, /2). At this point, f(x 0 ) = /2. Here is an alternative way to show the result for a =. This ethod has the advantage of giving us a full description of all the points at which f takes a global axiu. If a =, then f(x, x 2 ) = 2 ( (x + x 2 ) 2) + 2. The first ter of this expression is necessarily non-positive and is axiized when x + x 2 =. Therefore f(x, x 2 ) is axiized whenever x + x 2 = and at any such point takes a axiu value of /2. Question 4. A. Euler s theore on hoogeneous functions is as follows: If f is a real valued function of n variables and if f is hoogenous of degree k, then n f(x,..., x n ) x i = kf(x,..., x n ). B. If f is hoogeneous of degree k, then partial derivative functions f i (x,..., x n ) are hoogeneous of degree k. C. Proof of Euler s theore: If f is hoogeneous of degree k, then f(tx,..., tx n ) = t k f(x,..., x n ) 4
5 for all t > 0 and all x in the doain of f. Therefore the derivative with respect to t of the left side of this identity is equal to the derivative of the right side with respect to t. This iplies that n x i f(tx,..., tx n ) = kt k f(x,..., x n ) for all t > 0. In particular, this equation holds when t =, which eans that n x i f(x,..., x n ) = kf(x,..., x n ). Proof that if f is hoogeneous of degree k, its partial derivatives are hoogeneous of degree k : If f is hoogeneous of degree k, then f(tx,..., tx n ) = t k f(x,..., x n ) for all t > 0 and all x in the doain of f. equation with respect to x i. This gives us Differentiate both sides of this t f(tx,..., tx n ) = t k f(x,..., x n ). Dividing both sides of this equation by t, we have f(tx,..., tx n ) = t k f(x,..., x n ) which eans that the function f(x,...,xn) is hoogeneous of degree k. 5
Midterm Exam, Econ 210A, Fall 2008
Midterm Exam, Econ 0A, Fall 008 ) Elmer Kink s utility function is min{x, x }. Draw a few indifference curves for Elmer. These are L-shaped, with the corners lying on the line x = x. Find each of the following
More informationMidterm Examination: Economics 210A October 2011
Midterm Examination: Economics 210A October 2011 The exam has 6 questions. Answer as many as you can. Good luck. 1) A) Must every quasi-concave function must be concave? If so, prove it. If not, provide
More informationGS/ECON 5010 section B Answers to Assignment 1 September Q1. Are the preferences described below transitive? Strictly monotonic? Convex?
GS/ECON 5010 section B Answers to Assignment 1 September 2011 Q1. Are the preferences described below transitive? Strictly monotonic? Convex? Explain briefly. The person consumes 2 goods, food and clothing.
More informationIntermediate microeconomics. Lecture 2: Consumer Theory II: demand. Varian, chapters 6, 8, 9
Interediate icroeconoics Lecture 2: Consuer Theory II: deand. Varian, chapters 6, 8, 9 Agenda 1. Noral and inferior goods 2. Incoe offer curves and Engel curves 3. Ordinary goods and Giffen goods 4. Price
More informationRevealed Preference with Stochastic Demand Correspondence
Revealed Preference with Stochastic Deand Correspondence Indraneel Dasgupta School of Econoics, University of Nottingha, Nottingha NG7 2RD, UK. E-ail: indraneel.dasgupta@nottingha.ac.uk Prasanta K. Pattanaik
More informationRevealed Preference and Stochastic Demand Correspondence: A Unified Theory
Revealed Preference and Stochastic Deand Correspondence: A Unified Theory Indraneel Dasgupta School of Econoics, University of Nottingha, Nottingha NG7 2RD, UK. E-ail: indraneel.dasgupta@nottingha.ac.uk
More informationNotes I Classical Demand Theory: Review of Important Concepts
Notes I Classical Demand Theory: Review of Important Concepts The notes for our course are based on: Mas-Colell, A., M.D. Whinston and J.R. Green (1995), Microeconomic Theory, New York and Oxford: Oxford
More informationIntroduction to Discrete Optimization
Prof. Friedrich Eisenbrand Martin Nieeier Due Date: March 9 9 Discussions: March 9 Introduction to Discrete Optiization Spring 9 s Exercise Consider a school district with I neighborhoods J schools and
More informationTopic 5a Introduction to Curve Fitting & Linear Regression
/7/08 Course Instructor Dr. Rayond C. Rup Oice: A 337 Phone: (95) 747 6958 E ail: rcrup@utep.edu opic 5a Introduction to Curve Fitting & Linear Regression EE 4386/530 Coputational ethods in EE Outline
More informationSOLVING LITERAL EQUATIONS. Bundle 1: Safety & Process Skills
SOLVING LITERAL EQUATIONS Bundle 1: Safety & Process Skills Solving Literal Equations An equation is a atheatical sentence with an equal sign. The solution of an equation is a value for a variable that
More informationLecture 21. Interior Point Methods Setup and Algorithm
Lecture 21 Interior Point Methods In 1984, Kararkar introduced a new weakly polynoial tie algorith for solving LPs [Kar84a], [Kar84b]. His algorith was theoretically faster than the ellipsoid ethod and
More informationWeek 9: Topics in Consumer Theory (Jehle and Reny, Chapter 2)
Week 9: Topics in Consumer Theory (Jehle and Reny, Chapter 2) Tsun-Feng Chiang *School of Economics, Henan University, Kaifeng, China November 15, 2015 Microeconomic Theory Week 9: Topics in Consumer Theory
More informationPrinciples of Optimal Control Spring 2008
MIT OpenCourseWare http://ocw.it.edu 16.323 Principles of Optial Control Spring 2008 For inforation about citing these aterials or our Ters of Use, visit: http://ocw.it.edu/ters. 16.323 Lecture 10 Singular
More informationEC /11. Math for Microeconomics September Course, Part II Lecture Notes. Course Outline
LONDON SCHOOL OF ECONOMICS Professor Leonardo Felli Department of Economics S.478; x7525 EC400 20010/11 Math for Microeconomics September Course, Part II Lecture Notes Course Outline Lecture 1: Tools for
More informationSolutions to selected exercises from Jehle and Reny (2001): Advanced Microeconomic Theory
Solutions to selected exercises from Jehle and Reny (001): Advanced Microeconomic Theory Thomas Herzfeld September 010 Contents 1 Mathematical Appendix 1.1 Chapter A1..................................
More informationWeek 7: The Consumer (Malinvaud, Chapter 2 and 4) / Consumer November Theory 1, 2015 (Jehle and 1 / Reny, 32
Week 7: The Consumer (Malinvaud, Chapter 2 and 4) / Consumer Theory (Jehle and Reny, Chapter 1) Tsun-Feng Chiang* *School of Economics, Henan University, Kaifeng, China November 1, 2015 Week 7: The Consumer
More informationFeature Extraction Techniques
Feature Extraction Techniques Unsupervised Learning II Feature Extraction Unsupervised ethods can also be used to find features which can be useful for categorization. There are unsupervised ethods that
More informationMathematical Economics: Lecture 16
Mathematical Economics: Lecture 16 Yu Ren WISE, Xiamen University November 26, 2012 Outline 1 Chapter 21: Concave and Quasiconcave Functions New Section Chapter 21: Concave and Quasiconcave Functions Concave
More informationApplications I: consumer theory
Applications I: consumer theory Lecture note 8 Outline 1. Preferences to utility 2. Utility to demand 3. Fully worked example 1 From preferences to utility The preference ordering We start by assuming
More informationAdvanced Microeconomic Analysis Solutions to Midterm Exam
Advanced Microeconomic Analsis Solutions to Midterm Exam Q1. (0 pts) An individual consumes two goods x 1 x and his utilit function is: u(x 1 x ) = [min(x 1 + x x 1 + x )] (a) Draw some indifference curves
More informationA Simple Regression Problem
A Siple Regression Proble R. M. Castro March 23, 2 In this brief note a siple regression proble will be introduced, illustrating clearly the bias-variance tradeoff. Let Y i f(x i ) + W i, i,..., n, where
More informationCourse Notes for EE227C (Spring 2018): Convex Optimization and Approximation
Course Notes for EE7C (Spring 018: Convex Optiization and Approxiation Instructor: Moritz Hardt Eail: hardt+ee7c@berkeley.edu Graduate Instructor: Max Sichowitz Eail: sichow+ee7c@berkeley.edu October 15,
More informationEcon 5150: Applied Econometrics Empirical Demand Analysis. Sung Y. Park CUHK
Econ 5150: Applied Econometrics Empirical Analysis Sung Y. Park CUHK Marshallian demand Under some mild regularity conditions on preferences the preference relation x ર z ( the bundle x us weakly preferred
More informationIntelligent Systems: Reasoning and Recognition. Perceptrons and Support Vector Machines
Intelligent Systes: Reasoning and Recognition Jaes L. Crowley osig 1 Winter Seester 2018 Lesson 6 27 February 2018 Outline Perceptrons and Support Vector achines Notation...2 Linear odels...3 Lines, Planes
More informationSolutions 1. Introduction to Coding Theory - Spring 2010 Solutions 1. Exercise 1.1. See Examples 1.2 and 1.11 in the course notes.
Solutions 1 Exercise 1.1. See Exaples 1.2 and 1.11 in the course notes. Exercise 1.2. Observe that the Haing distance of two vectors is the iniu nuber of bit flips required to transfor one into the other.
More informationADVANCES ON THE BESSIS- MOUSSA-VILLANI TRACE CONJECTURE
ADVANCES ON THE BESSIS- MOUSSA-VILLANI TRACE CONJECTURE CHRISTOPHER J. HILLAR Abstract. A long-standing conjecture asserts that the polynoial p(t = Tr(A + tb ] has nonnegative coefficients whenever is
More informationList Scheduling and LPT Oliver Braun (09/05/2017)
List Scheduling and LPT Oliver Braun (09/05/207) We investigate the classical scheduling proble P ax where a set of n independent jobs has to be processed on 2 parallel and identical processors (achines)
More informationEC /11. Math for Microeconomics September Course, Part II Problem Set 1 with Solutions. a11 a 12. x 2
LONDON SCHOOL OF ECONOMICS Professor Leonardo Felli Department of Economics S.478; x7525 EC400 2010/11 Math for Microeconomics September Course, Part II Problem Set 1 with Solutions 1. Show that the general
More informationNew Classes of Positive Semi-Definite Hankel Tensors
Miniax Theory and its Applications Volue 017, No., 1 xxx New Classes of Positive Sei-Definite Hankel Tensors Qun Wang Dept. of Applied Matheatics, The Hong Kong Polytechnic University, Hung Ho, Kowloon,
More informationConsumer theory Topics in consumer theory. Microeconomics. Joana Pais. Fall Joana Pais
Microeconomics Fall 2016 Indirect utility and expenditure Properties of consumer demand The indirect utility function The relationship among prices, incomes, and the maximised value of utility can be summarised
More informationCourse Notes for EE227C (Spring 2018): Convex Optimization and Approximation
Course Notes for EE227C (Spring 2018): Convex Optiization and Approxiation Instructor: Moritz Hardt Eail: hardt+ee227c@berkeley.edu Graduate Instructor: Max Sichowitz Eail: sichow+ee227c@berkeley.edu October
More information1 + x 1/2. b) For what values of k is g a quasi-concave function? For what values of k is g a concave function? Explain your answers.
Questions and Answers from Econ 0A Final: Fall 008 I have gone to some trouble to explain the answers to all of these questions, because I think that there is much to be learned b working through them
More informationOn Strongly Jensen m-convex Functions 1
Pure Matheatical Sciences, Vol. 6, 017, no. 1, 87-94 HIKARI Ltd, www.-hikari.co https://doi.org/10.1988/ps.017.61018 On Strongly Jensen -Convex Functions 1 Teodoro Lara Departaento de Física y Mateáticas
More informationHicksian Demand and Expenditure Function Duality, Slutsky Equation
Hicksian Demand and Expenditure Function Duality, Slutsky Equation Econ 2100 Fall 2017 Lecture 6, September 14 Outline 1 Applications of Envelope Theorem 2 Hicksian Demand 3 Duality 4 Connections between
More informationMulti-Dimensional Hegselmann-Krause Dynamics
Multi-Diensional Hegselann-Krause Dynaics A. Nedić Industrial and Enterprise Systes Engineering Dept. University of Illinois Urbana, IL 680 angelia@illinois.edu B. Touri Coordinated Science Laboratory
More informationStatic Problem Set 2 Solutions
Static Problem Set Solutions Jonathan Kreamer July, 0 Question (i) Let g, h be two concave functions. Is f = g + h a concave function? Prove it. Yes. Proof: Consider any two points x, x and α [0, ]. Let
More informationŞtefan ŞTEFĂNESCU * is the minimum global value for the function h (x)
7Applying Nelder Mead s Optiization Algorith APPLYING NELDER MEAD S OPTIMIZATION ALGORITHM FOR MULTIPLE GLOBAL MINIMA Abstract Ştefan ŞTEFĂNESCU * The iterative deterinistic optiization ethod could not
More informationThe Methods of Solution for Constrained Nonlinear Programming
Research Inventy: International Journal Of Engineering And Science Vol.4, Issue 3(March 2014), PP 01-06 Issn (e): 2278-4721, Issn (p):2319-6483, www.researchinventy.co The Methods of Solution for Constrained
More informationOn the Navier Stokes equations
On the Navier Stokes equations Daniel Thoas Hayes April 26, 2018 The proble on the existence and soothness of the Navier Stokes equations is resolved. 1. Proble description The Navier Stokes equations
More informationSupport Vector Machines. Maximizing the Margin
Support Vector Machines Support vector achines (SVMs) learn a hypothesis: h(x) = b + Σ i= y i α i k(x, x i ) (x, y ),..., (x, y ) are the training exs., y i {, } b is the bias weight. α,..., α are the
More informationThe Weierstrass Approximation Theorem
36 The Weierstrass Approxiation Theore Recall that the fundaental idea underlying the construction of the real nubers is approxiation by the sipler rational nubers. Firstly, nubers are often deterined
More informationCurious Bounds for Floor Function Sums
1 47 6 11 Journal of Integer Sequences, Vol. 1 (018), Article 18.1.8 Curious Bounds for Floor Function Sus Thotsaporn Thanatipanonda and Elaine Wong 1 Science Division Mahidol University International
More informationCharles Blackorby, David Donaldson, and John A. Weymark
HICKSIAN SURPLUS MEASURES OF INDIVIDUAL WELFARE CHANGE WHEN THERE IS PRICE AND INCOME UNCERTAINTY by Charles Blackorby, David Donaldson, and John A. Weyark Working Paper No. 06-W18R August 2006 Revised
More information1 Convexity, concavity and quasi-concavity. (SB )
UNIVERSITY OF MARYLAND ECON 600 Summer 2010 Lecture Two: Unconstrained Optimization 1 Convexity, concavity and quasi-concavity. (SB 21.1-21.3.) For any two points, x, y R n, we can trace out the line of
More informationLinear Transformations
Linear Transforations Hopfield Network Questions Initial Condition Recurrent Layer p S x W S x S b n(t + ) a(t + ) S x S x D a(t) S x S S x S a(0) p a(t + ) satlins (Wa(t) + b) The network output is repeatedly
More informationLakehead University ECON 4117/5111 Mathematical Economics Fall 2002
Test 1 September 20, 2002 1. Determine whether each of the following is a statement or not (answer yes or no): (a) Some sentences can be labelled true and false. (b) All students should study mathematics.
More informationarxiv: v1 [cs.ds] 3 Feb 2014
arxiv:40.043v [cs.ds] 3 Feb 04 A Bound on the Expected Optiality of Rando Feasible Solutions to Cobinatorial Optiization Probles Evan A. Sultani The Johns Hopins University APL evan@sultani.co http://www.sultani.co/
More informationMechanics Physics 151
Mechanics Physics 5 Lecture Oscillations (Chapter 6) What We Did Last Tie Analyzed the otion of a heavy top Reduced into -diensional proble of θ Qualitative behavior Precession + nutation Initial condition
More informationOn Constant Power Water-filling
On Constant Power Water-filling Wei Yu and John M. Cioffi Electrical Engineering Departent Stanford University, Stanford, CA94305, U.S.A. eails: {weiyu,cioffi}@stanford.edu Abstract This paper derives
More informationFunctions: Review of Algebra and Trigonometry
Sec. and. Functions: Review o Algebra and Trigonoetry A. Functions and Relations DEFN Relation: A set o ordered pairs. (,y) (doain, range) DEFN Function: A correspondence ro one set (the doain) to anther
More informationChapter 13. Convex and Concave. Josef Leydold Mathematical Methods WS 2018/19 13 Convex and Concave 1 / 44
Chapter 13 Convex and Concave Josef Leydold Mathematical Methods WS 2018/19 13 Convex and Concave 1 / 44 Monotone Function Function f is called monotonically increasing, if x 1 x 2 f (x 1 ) f (x 2 ) It
More informationTight Information-Theoretic Lower Bounds for Welfare Maximization in Combinatorial Auctions
Tight Inforation-Theoretic Lower Bounds for Welfare Maxiization in Cobinatorial Auctions Vahab Mirrokni Jan Vondrák Theory Group, Microsoft Dept of Matheatics Research Princeton University Redond, WA 9805
More information3.3 Variational Characterization of Singular Values
3.3. Variational Characterization of Singular Values 61 3.3 Variational Characterization of Singular Values Since the singular values are square roots of the eigenvalues of the Heritian atrices A A and
More informationThe Transactional Nature of Quantum Information
The Transactional Nature of Quantu Inforation Subhash Kak Departent of Coputer Science Oklahoa State University Stillwater, OK 7478 ABSTRACT Inforation, in its counications sense, is a transactional property.
More informationMA304 Differential Geometry
MA304 Differential Geoetry Hoework 4 solutions Spring 018 6% of the final ark 1. The paraeterised curve αt = t cosh t for t R is called the catenary. Find the curvature of αt. Solution. Fro hoework question
More informationSequence Analysis, WS 14/15, D. Huson & R. Neher (this part by D. Huson) February 5,
Sequence Analysis, WS 14/15, D. Huson & R. Neher (this part by D. Huson) February 5, 2015 31 11 Motif Finding Sources for this section: Rouchka, 1997, A Brief Overview of Gibbs Sapling. J. Buhler, M. Topa:
More informationSTOPPING SIMULATED PATHS EARLY
Proceedings of the 2 Winter Siulation Conference B.A.Peters,J.S.Sith,D.J.Medeiros,andM.W.Rohrer,eds. STOPPING SIMULATED PATHS EARLY Paul Glasseran Graduate School of Business Colubia University New Yor,
More informationStructural Properties of Utility Functions Walrasian Demand
Structural Properties of Utility Functions Walrasian Demand Econ 2100 Fall 2017 Lecture 4, September 7 Outline 1 Structural Properties of Utility Functions 1 Local Non Satiation 2 Convexity 3 Quasi-linearity
More informationMULTIAGENT Resource Allocation (MARA) is the
EDIC RESEARCH PROPOSAL 1 Designing Negotiation Protocols for Utility Maxiization in Multiagent Resource Allocation Tri Kurniawan Wijaya LSIR, I&C, EPFL Abstract Resource allocation is one of the ain concerns
More informationIntroduction to Optimization Techniques. Nonlinear Programming
Introduction to Optiization echniques Nonlinear Prograing Optial Solutions Consider the optiization proble in f ( x) where F R n xf Definition : x F is optial (global iniu) for this proble, if f( x ) f(
More informationModel Fitting. CURM Background Material, Fall 2014 Dr. Doreen De Leon
Model Fitting CURM Background Material, Fall 014 Dr. Doreen De Leon 1 Introduction Given a set of data points, we often want to fit a selected odel or type to the data (e.g., we suspect an exponential
More informationSupport Vector Machine Classification of Uncertain and Imbalanced data using Robust Optimization
Recent Researches in Coputer Science Support Vector Machine Classification of Uncertain and Ibalanced data using Robust Optiization RAGHAV PAT, THEODORE B. TRAFALIS, KASH BARKER School of Industrial Engineering
More informationarxiv: v1 [math.nt] 14 Sep 2014
ROTATION REMAINDERS P. JAMESON GRABER, WASHINGTON AND LEE UNIVERSITY 08 arxiv:1409.411v1 [ath.nt] 14 Sep 014 Abstract. We study properties of an array of nubers, called the triangle, in which each row
More informationARE211, Fall 2005 CONTENTS. 5. Characteristics of Functions Surjective, Injective and Bijective functions. 5.2.
ARE211, Fall 2005 LECTURE #18: THU, NOV 3, 2005 PRINT DATE: NOVEMBER 22, 2005 (COMPSTAT2) CONTENTS 5. Characteristics of Functions. 1 5.1. Surjective, Injective and Bijective functions 1 5.2. Homotheticity
More informationLeast Squares Fitting of Data
Least Squares Fitting of Data David Eberly, Geoetric Tools, Redond WA 98052 https://www.geoetrictools.co/ This work is licensed under the Creative Coons Attribution 4.0 International License. To view a
More informationFoundations of Machine Learning Boosting. Mehryar Mohri Courant Institute and Google Research
Foundations of Machine Learning Boosting Mehryar Mohri Courant Institute and Google Research ohri@cis.nyu.edu Weak Learning Definition: concept class C is weakly PAC-learnable if there exists a (weak)
More informationMonotone Function. Function f is called monotonically increasing, if. x 1 x 2 f (x 1 ) f (x 2 ) x 1 < x 2 f (x 1 ) < f (x 2 ) x 1 x 2
Monotone Function Function f is called monotonically increasing, if Chapter 3 x x 2 f (x ) f (x 2 ) It is called strictly monotonically increasing, if f (x 2) f (x ) Convex and Concave x < x 2 f (x )
More informationBlock designs and statistics
Bloc designs and statistics Notes for Math 447 May 3, 2011 The ain paraeters of a bloc design are nuber of varieties v, bloc size, nuber of blocs b. A design is built on a set of v eleents. Each eleent
More informationEcon 121b: Intermediate Microeconomics
Econ 121b: Intermediate Microeconomics Dirk Bergemann, Spring 2012 Week of 1/29-2/4 1 Lecture 7: Expenditure Minimization Instead of maximizing utility subject to a given income we can also minimize expenditure
More informationExact tensor completion with sum-of-squares
Proceedings of Machine Learning Research vol 65:1 54, 2017 30th Annual Conference on Learning Theory Exact tensor copletion with su-of-squares Aaron Potechin Institute for Advanced Study, Princeton David
More informationINCOME AND SUBSTITUTION EFFECTS. Two Demand Functions CHANGES IN INCOME. [See Chapter 5 and 6]
INCOME AND SUBSTITUTION EFFECTS [See Chater 5 and 6] Two Deand Functions Marshallian deand i ( n describes how consution varies with rices and incoe. Obtained by aiizing utility subject to the budget constraint.
More informationMicroeconomics. Joana Pais. Fall Joana Pais
Microeconomics Fall 2016 Primitive notions There are four building blocks in any model of consumer choice. They are the consumption set, the feasible set, the preference relation, and the behavioural assumption.
More information13.2 Fully Polynomial Randomized Approximation Scheme for Permanent of Random 0-1 Matrices
CS71 Randoness & Coputation Spring 018 Instructor: Alistair Sinclair Lecture 13: February 7 Disclaier: These notes have not been subjected to the usual scrutiny accorded to foral publications. They ay
More informationA function(al) f is convex if dom f is a convex set, and. f(θx + (1 θ)y) < θf(x) + (1 θ)f(y) f(x) = x 3
Convex functions The domain dom f of a functional f : R N R is the subset of R N where f is well-defined. A function(al) f is convex if dom f is a convex set, and f(θx + (1 θ)y) θf(x) + (1 θ)f(y) for all
More informationWeek 6: Consumer Theory Part 1 (Jehle and Reny, Chapter 1)
Week 6: Consumer Theory Part 1 (Jehle and Reny, Chapter 1) Tsun-Feng Chiang* *School of Economics, Henan University, Kaifeng, China November 2, 2014 1 / 28 Primitive Notions 1.1 Primitive Notions Consumer
More informationz 6y 3x x x x x4 x, y, z,,,,,, UNCONSTRAINED OPTIMIZATION EXAMPLES
UNCONSTRAINED OPTIMIZATION EXAMPLES z. Eaple: Find a local iniu of a function. FOC: Solutions to FOC: z z 6 (a),, Eaple: Find a local iniu of a function z 8 6 6 7 4 4. FOC: z 6 z z 6 6 z4 4 z 6 z z 6 6
More informationSeptember Math Course: First Order Derivative
September Math Course: First Order Derivative Arina Nikandrova Functions Function y = f (x), where x is either be a scalar or a vector of several variables (x,..., x n ), can be thought of as a rule which
More informationMidterm 1 Sample Solution
Midter 1 Saple Solution NOTE: Throughout the exa a siple graph is an undirected, unweighted graph with no ultiple edges (i.e., no exact repeats of the sae edge) and no self-loops (i.e., no edges fro a
More informationUniform Approximation and Bernstein Polynomials with Coefficients in the Unit Interval
Unifor Approxiation and Bernstein Polynoials with Coefficients in the Unit Interval Weiang Qian and Marc D. Riedel Electrical and Coputer Engineering, University of Minnesota 200 Union St. S.E. Minneapolis,
More informationA Bernstein-Markov Theorem for Normed Spaces
A Bernstein-Markov Theore for Nored Spaces Lawrence A. Harris Departent of Matheatics, University of Kentucky Lexington, Kentucky 40506-0027 Abstract Let X and Y be real nored linear spaces and let φ :
More informationEXACT BOUNDS FOR JUDICIOUS PARTITIONS OF GRAPHS
EXACT BOUNDS FOR JUDICIOUS PARTITIONS OF GRAPHS B. BOLLOBÁS1,3 AND A.D. SCOTT,3 Abstract. Edwards showed that every grah of size 1 has a biartite subgrah of size at least / + /8 + 1/64 1/8. We show that
More informationConvex Functions. Daniel P. Palomar. Hong Kong University of Science and Technology (HKUST)
Convex Functions Daniel P. Palomar Hong Kong University of Science and Technology (HKUST) ELEC5470 - Convex Optimization Fall 2017-18, HKUST, Hong Kong Outline of Lecture Definition convex function Examples
More informationOn Nonlinear Controllability of Homogeneous Systems Linear in Control
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 48, NO. 1, JANUARY 2003 139 On Nonlinear Controllability of Hoogeneous Systes Linear in Control Jaes Melody, Taer Başar, and Francesco Bullo Abstract This work
More information4 = (0.02) 3 13, = 0.25 because = 25. Simi-
Theore. Let b and be integers greater than. If = (. a a 2 a i ) b,then for any t N, in base (b + t), the fraction has the digital representation = (. a a 2 a i ) b+t, where a i = a i + tk i with k i =
More informationTEST OF HOMOGENEITY OF PARALLEL SAMPLES FROM LOGNORMAL POPULATIONS WITH UNEQUAL VARIANCES
TEST OF HOMOGENEITY OF PARALLEL SAMPLES FROM LOGNORMAL POPULATIONS WITH UNEQUAL VARIANCES S. E. Ahed, R. J. Tokins and A. I. Volodin Departent of Matheatics and Statistics University of Regina Regina,
More informationProperties of Walrasian Demand
Properties of Walrasian Demand Econ 2100 Fall 2017 Lecture 5, September 12 Problem Set 2 is due in Kelly s mailbox by 5pm today Outline 1 Properties of Walrasian Demand 2 Indirect Utility Function 3 Envelope
More information1 Bounding the Margin
COS 511: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #12 Scribe: Jian Min Si March 14, 2013 1 Bounding the Margin We are continuing the proof of a bound on the generalization error of AdaBoost
More informationCS Lecture 13. More Maximum Likelihood
CS 6347 Lecture 13 More Maxiu Likelihood Recap Last tie: Introduction to axiu likelihood estiation MLE for Bayesian networks Optial CPTs correspond to epirical counts Today: MLE for CRFs 2 Maxiu Likelihood
More informationLinear Algebra (I) Yijia Chen. linear transformations and their algebraic properties. 1. A Starting Point. y := 3x.
Linear Algebra I) Yijia Chen Linear algebra studies Exaple.. Consider the function This is a linear function f : R R. linear transforations and their algebraic properties.. A Starting Point y := 3x. Geoetrically
More information1 Proof of learning bounds
COS 511: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #4 Scribe: Akshay Mittal February 13, 2013 1 Proof of learning bounds For intuition of the following theore, suppose there exists a
More informationOn the Existence of Pure Nash Equilibria in Weighted Congestion Games
MATHEMATICS OF OPERATIONS RESEARCH Vol. 37, No. 3, August 2012, pp. 419 436 ISSN 0364-765X (print) ISSN 1526-5471 (online) http://dx.doi.org/10.1287/oor.1120.0543 2012 INFORMS On the Existence of Pure
More informationThe Euler-Maclaurin Formula and Sums of Powers
DRAFT VOL 79, NO 1, FEBRUARY 26 1 The Euler-Maclaurin Forula and Sus of Powers Michael Z Spivey University of Puget Sound Tacoa, WA 98416 spivey@upsedu Matheaticians have long been intrigued by the su
More informationa a a a a a a m a b a b
Algebra / Trig Final Exa Study Guide (Fall Seester) Moncada/Dunphy Inforation About the Final Exa The final exa is cuulative, covering Appendix A (A.1-A.5) and Chapter 1. All probles will be ultiple choice
More informationBoosting with log-loss
Boosting with log-loss Marco Cusuano-Towner Septeber 2, 202 The proble Suppose we have data exaples {x i, y i ) i =... } for a two-class proble with y i {, }. Let F x) be the predictor function with the
More informationCh 12: Variations on Backpropagation
Ch 2: Variations on Backpropagation The basic backpropagation algorith is too slow for ost practical applications. It ay take days or weeks of coputer tie. We deonstrate why the backpropagation algorith
More informationChapter 6: Economic Inequality
Chapter 6: Econoic Inequality We are interested in inequality ainly for two reasons: First, there are philosophical and ethical grounds for aversion to inequality per se. Second, even if we are not interested
More informationLecture 21 Principle of Inclusion and Exclusion
Lecture 21 Principle of Inclusion and Exclusion Holden Lee and Yoni Miller 5/6/11 1 Introduction and first exaples We start off with an exaple Exaple 11: At Sunnydale High School there are 28 students
More informationFourier Series Summary (From Salivahanan et al, 2002)
Fourier Series Suary (Fro Salivahanan et al, ) A periodic continuous signal f(t), - < t
More informationLecture Notes for Chapter 12
Lecture Notes for Chapter 12 Kevin Wainwright April 26, 2014 1 Constrained Optimization Consider the following Utility Max problem: Max x 1, x 2 U = U(x 1, x 2 ) (1) Subject to: Re-write Eq. 2 B = P 1
More informationPaul Schrimpf. October 18, UBC Economics 526. Unconstrained optimization. Paul Schrimpf. Notation and definitions. First order conditions
Unconstrained UBC Economics 526 October 18, 2013 .1.2.3.4.5 Section 1 Unconstrained problem x U R n F : U R. max F (x) x U Definition F = max x U F (x) is the maximum of F on U if F (x) F for all x U and
More information