Multivariate Lorenz dominance A review and new perspectives
|
|
|
- Elisabeth McCarthy
- 9 years ago
- Views:
Transcription
1 Siena Conference, May 23 26, A review and new perspectives by Karl Mosler University of Cologne mosler@statistikuni-koelnde and Gleb Koshevoy CEMI, Russian Academy of Science, Moscow koshevoy@cemirssiru
2 Siena Conference, May 23 26, Keywords: Multivariate Lorenz order, directional majorization, majorization by positive combination, price Lorenz order, generalized Lorenz function AMS (2000) Subject Classification: Primary 60E15, Secondary 62H99, 91B14 JEL: C49, D31, D69, I30
3 Siena Conference, May 23 26, Principal properties of the celebrated Lorenz curve 1 The Lorenz curve is visual: it indicates the degree of scatter the more the curve is bent 2 Up to a scale parameter, the Lorenz curve fully describes the underlying distribution 3 The pointwise ordering of Lorenz functions is the Lorenz order
4 Siena Conference, May 23 26, Measuring dispersion The Lorenz curve has been employed in virtually every field of statistical application In the economic and social sciences, economic inequality and poverty (Kolm, 1969; Atkinson, 1970; Sen, 1973), industrial concentration (Hart, 1971), social segregation (Alker, 1965), the distribution of publishing activities (Goldie, 1977), and many others are measured by the Lorenz curve
5 Siena Conference, May 23 26, Further applications The Lorenz curve is connected, eg, with a fundamental notion of risk (Rothschild and Stiglitz, 1970, 1971) and the evaluation of decisions under risk (?), the measurement of ecological diversity (Thompson, 1976) and notions of increasing efficiency and power in statistical inference For a comprehensive guide to the widely dispersed literature up to 1993 see Mosler and Scarsini (1993)
6 Siena Conference, May 23 26, Multivariate dispersion In many applications it is natural to consider several variables instead of a single one and to measure their multivariate dispersion Eg, in economic and social inequality: income, wealth, education, health, poverty: the same, decision under risk: multiple attributes, multiple goals See the early literature on social choice (Tobin, 1970; Sen, 1973; Kolm, 1977) and its multidimensional measurement (Atkinson and Bourguignon, 1982, 1989; Kolm, 1977; Maasoumi, 1986; Mosler, 1994; Tsui, 1995)
7 Siena Conference, May 23 26, Overview Inverse Lorenz function Three multivariate Lorenz orderings Dominance of absolute endowments Other multivariate dominance relations Transfers Outlook
8 Siena Conference, May 23 26, Eg, consider three households having (wealth, income) pairs (1000, 0), (0, 80), (0, 20) The usual univariate Lorenz curve for income and wealth alone are: L 1 (t) = z 1 L 2 (t) = z 1 1 t = l 1 (z) 1 t = l 2 (z)
9 Siena Conference, May 23 26, Distribution matrix and matrix of shares Let A = [a ik ] denote the distribution matrix of d commodities among n households, and let Ă = [ă ik] be the matrix of shares, ă ik = a ik / i a ik In the example we have A = , Ă =
10 Siena Conference, May 23 26, Basic idea: Inverse Lorenz function d = 1: The usual Lorenz curve can also be seen as the graph of the inverse Lorenz function: Given a portion of the total income, the inverse Lorenz function indicates the maximum percentage of the population that receives this portion d 1: Consider shares of the total endowments in each commodity and determine the largest percentage of the population by which these shares or less are held This percentage, depending on the vector of shares, is the d-variate inverse Lorenz function Its graph is named the Lorenz hypersurface
11 Siena Conference, May 23 26,
12 Siena Conference, May 23 26, y 1 y 2 l A (y 1, y 2 ) Figure 1: Lorenz hypersurface in the income-wealth example
13 Siena Conference, May 23 26, Inverse Lorenz function (ILF) of an empirical distribution An n d distribution matrix A = [a 1,, a n ] corresponds to the n-point empirical distribution F A in R d + The share vector of the i-th household is ( ) a i a ă i = i1 a n j=1 a = id n j j=1 a,, n j1 j=1 a jd The inverse Lorenz function of A is defined by { } 1 n n l A (y) = max θ i : θ i ă i y, 0 θ i 1 n i=1 i=1, y [0, 1] d (1)
14 Siena Conference, May 23 26, Economic interpretation The ILF is defined on the unit cube of R d Its argument y represents a vector of relative endowments with respect to mean endowments in the d attributes l F (y) equals the maximum percentage of households who hold a vector of shares less than or equal to y = (y 1,, y d ) θ i is a weight by which the endowment of the i-th household enters y In case d = 1 the ILF is the inverse function of the Lorenz function The Lorenz dominance between univariate distributions consists in the pointwise ordering of their Lorenz functions or, equivalently, of their ILFs
15 Siena Conference, May 23 26, ILF of a general probability distribution Consider a probability distribution function F on R d + whose first moment exists and is strictly positive, in symbols F P + The inverse Lorenz function (ILF) is given by l F (y) = max g(x)df (x), y [0, 1] d, (2) R d + where the maximum extends over all measurable functions g : R d + [0, 1] for which x g(x) df (x) y ɛ(f ) R d + The graph {(z 0, y) : z 0 = l F (y), y [0, 1] d } of the ILF is named the Lorenz hypersurface
16 Siena Conference, May 23 26, The function g : R d + [0, 1] can be considered as a selection of some part of the population Ω: Of all those households which have endowment vector x the percentage g(x) is selected x R d + ɛ(f ) g(x)df (x) amounts to the total portion vector held by this subpopulation and g(x)df (x) is the size of the subpopulation R d + selected by g Given a vector y [0, 1] d, we determine the maximum of g(x)df (x) over all measurable g such that x g(x)df (x) y ɛ(f ) R d + R d +
17 Siena Conference, May 23 26, Proposition 1 (Properties of the ILF) (i) l F is monotone increasing, concave, and has values in [0, 1], (ii) l F (1) = 1, l F (0) = F (0), (iii) l F (y J, 1 J ) = l FJ (y J ) Here, F J denotes the marginal distribution with respect to coordinates in J {1,, d}, and (y J, 1 J ) is the vector in R d with components y j, j J, and remaining components equal to 1
18 Siena Conference, May 23 26, Egalitarian distribution The egalitarian distribution, δ ξ, puts unit mass to some point ξ R d + It has ILF independently of ξ l δξ (y) = min y i for y [0, 1] d, i=1,d The next figure shows the graph of l δξ when d = 2 In this case, x g(x)df (x) = g(ξ) and g(x) df (x) = (g(ξ), g(ξ)) ɛ(f ) R d + R d +
19 Siena Conference, May 23 26, l A (y 1, y 2 ) y 1 y 2
20 Siena Conference, May 23 26, ILF and Lorenz zonoid Definition 1 (Lorenz zonoid) The Lorenz zonoid LZ(F ) of a distribution F P 1+ is the lift zonoid of the scaled distribution F, where F (x) = F (ɛ(f ) x) In symbols, LZ(F ) = Ẑ( F ) Proposition 2 (Lorenz zonoid boundary) The graph of l F is the intersection of the unit cube [0, 1] d+1 with the boundary of the set LZ(F ) + (R R d +) Equivalently, [0, 1] d+1 ( LZ(F ) + (R R d +) ) is the hypograph of l F
21 Siena Conference, May 23 26, More properties of the ILF Proposition 3 (Uniqueness) The ILF defines the underlying distribution uniquely, up to a vector of scale factors Proposition 4 (Continuity) Let a sequence F n in P 1+ weakly converge to F Then l F n converges uniformly to l F if F n is uniformly integrable In particular, F n is uniformly integrable if one of the following three restrictions holds: (i) There exists a compact set that includes the supports of all F n, (ii) there exists a distribution G such that l F n l G for all n, (iii) there exists a distribution G such that l F n converges uniformly to l G
22 Siena Conference, May 23 26, Proposition 5 (Law of large numbers) Let F P 1+ and Femp n be the empirical distribution function of a random sample X 1,, X n from F Then the ILF of Femp n converges uniformly to the ILF of F with probability one, that is, ( ) P lim sup l F n n emp (y) l F (y) = 0 = 1 y
23 Siena Conference, May 23 26, The ILF of an empirical distribution F A The ILF of an empirical distribution is a piecewise linear function, and the Lorenz hypersurface is a piecewise linear hypersurface with extreme points as follows: A point ( I n, i I ăi,j, 1 J ) is an extreme point of the Lorenz hypersurface if and only if the vector θ = (1 I, 0 I ) provides a solution to the following maximization problem: { 1 max n n θ i : i=1 n θ i ă i,j i I i=1 } ă i,j, θ i [0, 1] (3) Obviously, in the case d = 1, such points have the form ( k n, k i=1 ă(i)), k = 0,, n, where ă (1),, ă (n) are the shares ordered from below
24 Siena Conference, May 23 26, Ordering of ILFs There are many possibilities to extend the classic Lorenz dominance to a multivariate setting An economically meaningful notion is the following: Definition 2 (ILF dominance) F dominates G, F P L G, if l F (y) l G (y) for all y [0, 1] d (4) The ILF of an empirical distribution can be described by the extreme points of its graph
25 Siena Conference, May 23 26, ILF dominance The pointwise ordering of ILFs yields a partial order among probability distributions having finite strictly positive first moments It has been considered by many authors under different names, multivariate majorization by positive combinations ((Joe and Verducci, 1992)), price Lorenz order (Koshevoy and Mosler (1999)), convex-posilinear order (Müller and Stoyan (2002)), exchange rate Lorenz order (Arnold 2005)
26 Siena Conference, May 23 26, When d = 1, the order is the usual Lorenz order With two univariate empirical distributions F A on a 1,, a n and F B on b 1,, b n, F A P L F B if and only if k ă (i) i=1 k b(i), k = 1,, n 1 i=1
27 Siena Conference, May 23 26, Let X and Y be distributed as F and G, respectively If F P L G, we notate X P L Y Proposition 6 (Dominance by positive combinations) X P L Y if and only if Xp L Y p for all p R d + Proposition 7 (Convex scaled dominance, d = 1) X L Y if and only if [ ( )] [ ( )] X X E φ E φ for all convex φ : R + R,, E[X] E[X] as far as the expectations exist
28 Siena Conference, May 23 26, Notate X = ( X1 E[X 1 ],, ) X d E[X d ] Proposition 8 (Convex-posilinear dominance) X P L Y if and only if E[ψ( Xp )] E[ψ(Ỹ p )] for all convex ψ : R + R and all p R d +, as far as the expectations exist Definition 3 (Convex-linear scaled dominance) X s lz Y if E[ψ( Xp )] E[ψ(Ỹ p )] for all convex ψ : R + R and all p R d, as far as the expectations exist Definition 4 (Convex scaled dominance) X s cx Y if E[φ( Xp )] E[φ(Ỹ p )] for all convex φ : R d + R, as far as the expectations exist
29 Siena Conference, May 23 26, It obviously holds X s cx Y X s lz Y X P L Y Proposition 9 (Properties of the three multivariate Lorenz orders) For each of the three orders holds: (i) There exists a set of smallest elements containing all one-point distributions (ii) The order is scale invariant (iii) If two distribution are ordered, all their marginals are ordered in the same way (iv) With stochastically independent attributes, the order is equivalent to the usual Lorenz order of all univariate marginals
30 Siena Conference, May 23 26, (v) The order is continuous in the following sense: If the sequence G n converges weakly to G and F G n holds for all n, then F G If the sequence G n is uniformly integrable and converges weakly to G and G n F holds for all n, then G F
31 Siena Conference, May 23 26, Dominance of absolute endowments Distributions of absolute endowments can be ordered in a similar way For a probability distribution F on R +, the generalized Lorenz function is given by GL F (t) = t 0 F 1 (s)ds, 0 t 1 Hence GL F (0) = 0, GL F (1) = ɛ(f ), and GL F (t) = ɛ(f )L F (t) if ɛ(f ) is finite The dual generalized Lorenz function of F is DGL F (t) = ɛ(f ) GL F (1 t), 0 t 1
32 Siena Conference, May 23 26, Supermajorization and submajorization, d = 1 For two univariate distributions F and G, consider the pointwise ordering of these functions, F w G if GL F (t) GL G (t) for all t, F w G if DGL F (t) DGL G (t) for all t F w G is mentioned as supermajorization, and F w G as submajorization of F over G Obviously F w G ɛ(f ) ɛ(g), F w G ɛ(f ) ɛ(g), F w G and F w G F P L G and ɛ(f ) = ɛ(g) On the other hand, if ɛ(f ) = ɛ(g), submajorization as well as supermajorization coincide with the usual Lorenz order
33 Siena Conference, May 23 26, Supermajorization and submajorization, d 1 We use the notation F p (t) = xp t df (x) Definition 5 (Price supermajorization, price submajorization) For F and G P 1+, define F w P G if F p w G p for all p R d +, F wp G if F p w G p for all p R d + w P is called price supermajorization, wp price submajorization Both w P and wp are called weak price majorizations Definition 6 (Price majorization) If both F w P G and F wp G hold, we say that F price majorizes G, in symbols, F P G
34 Siena Conference, May 23 26, Corollary 10 (Equivalent definitions) (i) (ii) If ɛ(f ) = ɛ(g), F P G F P L G and ɛ(f ) = ɛ(g) F P G F wp G F w P G For the weak majorizations we have another characterization which involves a generalized version of the ILF and its dual:
35 Siena Conference, May 23 26, Definition 7 (Inverse generalized Lorenz function) For y R d + consider gl F (y) = max R d + g(x) df (x), (5) where the maximum is taken over all measurable g : R d + [0, 1] with g(x) x df (x) y R d + The function gl F : R d + [0, 1] is the inverse generalized Lorenz function (IGLF) of F
36 Siena Conference, May 23 26, Definition 8 (Dual inverse generalized Lorenz function) The function dgl F is called the dual inverse generalized Lorenz function (DIGLF) of F, dgl F (y) = min g(x) df (x), y R d g +, (6) where the minimum is taken over all measurable functions g : R d + [0, 1] for which g(x) x df (x) y R d + R d +
37 Siena Conference, May 23 26, price super- F w P G: ordering of IGLFs majorization p 0 F p w G p price F P G: ɛ(f ) = ɛ(g) and F w P G and majorization p 0 F p G p F wp G price sub- F wp G: ordering of DIGLFs majorization p 0 F p w G p Table 1: Price majorization and weak price majorizations and their characterization by inverse generalized Lorenz functions (IGLFs) and their duals (DIGLFs)
38 Siena Conference, May 23 26, Atkinson-Bourguignon dominance Atkinson and Bourguignon (1982) suggested two other orderings to rank distributions of commodity vectors: F lo G if F (x) G(x) for every x R d, F locc G if y x F (y)dy y x G(y)dy for every x Rd The orderings are known in the literature as the lower orthant ordering and the lower orthant concave ordering, respectively; see, eg, Dyckerhoff and Mosler (1997) In general, the first Atkinson-Bourguignon (A-B) dominance implies the second one, and both can be characterized by inequalities on expected utilities If d = 1, the two A-B orderings amount to usual first and second degree stochastic dominance, respectively
39 Siena Conference, May 23 26, In dimension d = 2, the first A-B dominance implies the order of IGLFs, that is, the price supermajorization: A class of utility functions generating the price supermajorization: U wp = { u : u(x) = v(px ), x R d, with v : R R concave, p R d +} When d = 2, obtain { U lo = u : R 2 R : u 0, u 0, x 1 x 2 2 } u 0 x 1 x 2 and the inclusion U wp U lo holds Then F lo G implies F wp G For d > 2 the first A-B dominance does not imply the weak price majorization The second A-B dominance, in dimension d = 1, equals price supermajorization But for d 2 it neither implies nor is implied by price supermajorization,
40 Siena Conference, May 23 26, Other multivariate majorizations The multivariate dilation order (Kolm, 1977; Russell and Seo, 1978): is generated by expected utility inequalities for all convex utility functions The dilation order implies the lift zonoid order and equal expectation vectors, hence the price Lorenz order
41 Siena Conference, May 23 26, Transfers In dimension one, the Lorenz order is closely connected with Pigou-Dalton transfers Since price Lorenz dominance is equivalent to univariate Lorenz order of expenditures, whatever the prices, it is tantamount saying that for any prices there exists a series of usual Pigou-Dalton transfers of expenditures
42 Siena Conference, May 23 26, A multivariate Pigou-Dalton transfer is a transfer of commodity vectors among two agents such that the resulting two endowments are in the convex hull of the previous It leaves the total endowments unchanged A distribution matrix A is chain-majorized by another distribution matrix B if A is obtained by a finite number of multivariate Pigou-Dalton transfers from B Chain-majorization implies matrix majorization and equal total endowments (hence convex scaled dominance), but for n 3 and d 2 the reverse is not true (Marshall and Olkin, 1979, p 431) Thus, the ordering induced by multivariate Pigou-Dalton transfers is stronger than dilation, convex scaled dominance, convex-linear dominance, and convex-posilinear (price Lorenz) dominance
43 Siena Conference, May 23 26, We started with three principal properties of the classical Lorenz curve: The pointwise ordering by Lorenz functions is the Lorenz order The Lorenz curve is visual: it indicates the degree of disparity as the bow is bent Up to a scale parameter, the Lorenz curve fully describes the underlying distribution No information is lost when we look at the Lorenz curve instead of the distribution function or the density
44 Siena Conference, May 23 26, All these properties are shared by the graph of the multivariate inverse Lorenz function: The pointwise ordering of inverse Lorenz functions is equivalent to the price Lorenz order The Lorenz hypersurface is visual in the same way as the Lorenz curve is: increasing deviation from the egalitarian hypersurface indicates more disparity The Lorenz hypersurface determines the underlying distribution uniquely, up to a vector of scaling constants
45 Siena Conference, May 23 26, Outlook
46 Siena Conference, May 23 26, References Alker, H (1965) Mathematics and Politics MacMillan, New York Application of Lorenz curve Atkinson, A (1970) On the measurement of inequality Journal of Economic Theory 2, Atkinson, A and Bourguignon, F (1982) The comparison of multidimensioned distributions of economic status Review of Economic Studies 49, Atkinson, A and Bourguignon, F (1989) The design of direct taxation and family benefits Journal of Public Economics 41, 3 29 Dyckerhoff, R and Mosler, K (1997) Orthant orderings of discrete random vectors Journal of Statistical Planning and Inference 62, Goldie, C (1977) Convergence theorems for empirical Lorenz curves and their inverses Advances in Applied Probability 9, Application of Lorenz curve
47 Siena Conference, May 23 26, Hart, P (1971) Entropy and other measures of concentration Journal of the Royal Statistical Society, Series A 134, Application of Lorenz curve Joe, H and Verducci, J (1992) Multivariate majorization by positive combinations In M Shaked and Y Tong, eds, Stochastic Inequalities, Hayward, California Kolm, S C (1969) The optimal production of social justice In J Marjolis and H Guitton, eds, Public Economics, MacMillan, New York Kolm, S C (1977) Multidimensional egalitarianisms Quarterly Journal of Economics 91, 1 13 Koshevoy, G and Mosler, K (1999) Price majorization and the inverse Lorenz function Discussion Papers in Statistics and Econometrics 3, Universität zu Köln Maasoumi, E (1986) The measurement and decomposition of multidimensional inequality Econometrica 54,
48 Siena Conference, May 23 26, Marshall, A W and Olkin, I (1979) Inequalities: Theory of Majorization and Its Applications Academic Press, New York Mosler, K (1994) Multidimensional welfarisms In W Eichhorn, ed, Models and Measurement of Welfare and Inequality, Springer, Berlin Mosler, K and Scarsini, M, eds (1993) Stochastic Orders and Applications A Classified Bibliography Lecture Notes in Economics and Mathematical Systems Springer, Berlin Müller, A and Stoyan, D (2002) Comparison Methods for Stochastic Models and Risks J Wiley, New York Rothschild, M and Stiglitz, J (1970) Increasing risk: I A definition Journal of Economic Theory 2, Rothschild, M and Stiglitz, J (1971) Increasing risk: II Its economic consequences Journal of Economic Theory 3, Russell, W R and Seo, T K (1978) Ordering uncertain prospects: The multivariate utility functions case Review of Economic Studies 45,
49 Siena Conference, May 23 26, Sen, A K (1973) On Economic Inequality Oxford University Press, Oxford Thompson, W (1976) Fisherman s luck Biometrics 32, Application of Lorenz curve Tobin, J (1970) On limiting the domain of inequality Journal of Law and Economics 13, Tsui, K (1995) Multidimensional generalizations of the relative and absolute inequality indices: The Atkinson Kolm Sen approach Journal of Economic Theory 67,
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
Convex analysis and profit/cost/support functions
CALIFORNIA INSTITUTE OF TECHNOLOGY Division of the Humanities and Social Sciences Convex analysis and profit/cost/support functions KC Border October 2004 Revised January 2009 Let A be a subset of R m
INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS
INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS STEVEN P. LALLEY AND ANDREW NOBEL Abstract. It is shown that there are no consistent decision rules for the hypothesis testing problem
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
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
1 if 1 x 0 1 if 0 x 1
Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or
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
Two-Stage Stochastic Linear Programs
Two-Stage Stochastic Linear Programs Operations Research Anthony Papavasiliou 1 / 27 Two-Stage Stochastic Linear Programs 1 Short Reviews Probability Spaces and Random Variables Convex Analysis 2 Deterministic
E3: PROBABILITY AND STATISTICS lecture notes
E3: PROBABILITY AND STATISTICS lecture notes 2 Contents 1 PROBABILITY THEORY 7 1.1 Experiments and random events............................ 7 1.2 Certain event. Impossible event............................
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
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
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
Overview of Violations of the Basic Assumptions in the Classical Normal Linear Regression Model
Overview of Violations of the Basic Assumptions in the Classical Normal Linear Regression Model 1 September 004 A. Introduction and assumptions The classical normal linear regression model can be written
Basics of Statistical Machine Learning
CS761 Spring 2013 Advanced Machine Learning Basics of Statistical Machine Learning Lecturer: Xiaojin Zhu [email protected] Modern machine learning is rooted in statistics. You will find many familiar
On a comparison result for Markov processes
On a comparison result for Markov processes Ludger Rüschendorf University of Freiburg Abstract A comparison theorem is stated for Markov processes in polish state spaces. We consider a general class of
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
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
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
A FIRST COURSE IN OPTIMIZATION THEORY
A FIRST COURSE IN OPTIMIZATION THEORY RANGARAJAN K. SUNDARAM New York University CAMBRIDGE UNIVERSITY PRESS Contents Preface Acknowledgements page xiii xvii 1 Mathematical Preliminaries 1 1.1 Notation
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES Contents 1. Random variables and measurable functions 2. Cumulative distribution functions 3. Discrete
6. Budget Deficits and Fiscal Policy
Prof. Dr. Thomas Steger Advanced Macroeconomics II Lecture SS 2012 6. Budget Deficits and Fiscal Policy Introduction Ricardian equivalence Distorting taxes Debt crises Introduction (1) Ricardian equivalence
Charting Income Inequality
Charting Inequality Resources for policy making Module 000 Charting Inequality Resources for policy making Charting Inequality by Lorenzo Giovanni Bellù, Agricultural Policy Support Service, Policy Assistance
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
Tail inequalities for order statistics of log-concave vectors and applications
Tail inequalities for order statistics of log-concave vectors and applications Rafał Latała Based in part on a joint work with R.Adamczak, A.E.Litvak, A.Pajor and N.Tomczak-Jaegermann Banff, May 2011 Basic
Convex Hull Probability Depth: first results
Conve Hull Probability Depth: first results Giovanni C. Porzio and Giancarlo Ragozini Abstract In this work, we present a new depth function, the conve hull probability depth, that is based on the conve
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
Measuring pro-poor growth
Economics Letters 78 (2003) 93 99 www.elsevier.com/ locate/ econbase q Measuring pro-poor growth * Martin Ravallion, Shaohua Chen World Bank, MSN MC 3-306 Development Research Group, 1818 H Street NW,
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
Pacific Journal of Mathematics
Pacific Journal of Mathematics GLOBAL EXISTENCE AND DECREASING PROPERTY OF BOUNDARY VALUES OF SOLUTIONS TO PARABOLIC EQUATIONS WITH NONLOCAL BOUNDARY CONDITIONS Sangwon Seo Volume 193 No. 1 March 2000
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
Scalar Valued Functions of Several Variables; the Gradient Vector
Scalar Valued Functions of Several Variables; the Gradient Vector Scalar Valued Functions vector valued function of n variables: Let us consider a scalar (i.e., numerical, rather than y = φ(x = φ(x 1,
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
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
Follow links for Class Use and other Permissions. For more information send email to: [email protected]
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
The sample space for a pair of die rolls is the set. The sample space for a random number between 0 and 1 is the interval [0, 1].
Probability Theory Probability Spaces and Events Consider a random experiment with several possible outcomes. For example, we might roll a pair of dice, flip a coin three times, or choose a random real
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
NOTES ON LINEAR TRANSFORMATIONS
NOTES ON LINEAR TRANSFORMATIONS Definition 1. Let V and W be vector spaces. A function T : V W is a linear transformation from V to W if the following two properties hold. i T v + v = T v + T v for all
Notes on metric spaces
Notes on metric spaces 1 Introduction The purpose of these notes is to quickly review some of the basic concepts from Real Analysis, Metric Spaces and some related results that will be used in this course.
The Cumulative Distribution and Stochastic Dominance
The Cumulative Distribution and Stochastic Dominance L A T E X file: StochasticDominance Daniel A. Graham, September 1, 2011 A decision problem under uncertainty is frequently cast as the problem of choosing
Non Parametric Inference
Maura Department of Economics and Finance Università Tor Vergata Outline 1 2 3 Inverse distribution function Theorem: Let U be a uniform random variable on (0, 1). Let X be a continuous random variable
Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics
Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights
Logistic Regression. Jia Li. Department of Statistics The Pennsylvania State University. Logistic Regression
Logistic Regression Department of Statistics The Pennsylvania State University Email: [email protected] Logistic Regression Preserve linear classification boundaries. By the Bayes rule: Ĝ(x) = arg max
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
Institute for Empirical Research in Economics University of Zurich. Working Paper Series ISSN 1424-0459. Working Paper No. 229
Institute for Empirical Research in Economics University of Zurich Working Paper Series ISSN 1424-0459 Working Paper No. 229 On the Notion of the First Best in Standard Hidden Action Problems Christian
Modern Optimization Methods for Big Data Problems MATH11146 The University of Edinburgh
Modern Optimization Methods for Big Data Problems MATH11146 The University of Edinburgh Peter Richtárik Week 3 Randomized Coordinate Descent With Arbitrary Sampling January 27, 2016 1 / 30 The Problem
BANACH AND HILBERT SPACE REVIEW
BANACH AND HILBET SPACE EVIEW CHISTOPHE HEIL These notes will briefly review some basic concepts related to the theory of Banach and Hilbert spaces. We are not trying to give a complete development, but
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 [email protected] On Lexicographic (Dictionary) Preference
T ( a i x i ) = a i T (x i ).
Chapter 2 Defn 1. (p. 65) Let V and W be vector spaces (over F ). We call a function T : V W a linear transformation form V to W if, for all x, y V and c F, we have (a) T (x + y) = T (x) + T (y) and (b)
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
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
Continuity of the Perron Root
Linear and Multilinear Algebra http://dx.doi.org/10.1080/03081087.2014.934233 ArXiv: 1407.7564 (http://arxiv.org/abs/1407.7564) Continuity of the Perron Root Carl D. Meyer Department of Mathematics, North
Regret and Rejoicing Effects on Mixed Insurance *
Regret and Rejoicing Effects on Mixed Insurance * Yoichiro Fujii, Osaka Sangyo University Mahito Okura, Doshisha Women s College of Liberal Arts Yusuke Osaki, Osaka Sangyo University + Abstract This papers
Increasing for all. Convex for all. ( ) Increasing for all (remember that the log function is only defined for ). ( ) Concave for all.
1. Differentiation The first derivative of a function measures by how much changes in reaction to an infinitesimal shift in its argument. The largest the derivative (in absolute value), the faster is evolving.
Fuzzy Differential Systems and the New Concept of Stability
Nonlinear Dynamics and Systems Theory, 1(2) (2001) 111 119 Fuzzy Differential Systems and the New Concept of Stability V. Lakshmikantham 1 and S. Leela 2 1 Department of Mathematical Sciences, Florida
Lecture Notes on Measure Theory and Functional Analysis
Lecture Notes on Measure Theory and Functional Analysis P. Cannarsa & T. D Aprile Dipartimento di Matematica Università di Roma Tor Vergata [email protected] [email protected] aa 2006/07 Contents
Section 6.1 - Inner Products and Norms
Section 6.1 - Inner Products and Norms Definition. Let V be a vector space over F {R, C}. An inner product on V is a function that assigns, to every ordered pair of vectors x and y in V, a scalar in F,
Predict the Popularity of YouTube Videos Using Early View Data
000 001 002 003 004 005 006 007 008 009 010 011 012 013 014 015 016 017 018 019 020 021 022 023 024 025 026 027 028 029 030 031 032 033 034 035 036 037 038 039 040 041 042 043 044 045 046 047 048 049 050
MULTIVARIATE PROBABILITY DISTRIBUTIONS
MULTIVARIATE PROBABILITY DISTRIBUTIONS. PRELIMINARIES.. Example. Consider an experiment that consists of tossing a die and a coin at the same time. We can consider a number of random variables defined
Metric Spaces Joseph Muscat 2003 (Last revised May 2009)
1 Distance J Muscat 1 Metric Spaces Joseph Muscat 2003 (Last revised May 2009) (A revised and expanded version of these notes are now published by Springer.) 1 Distance A metric space can be thought of
M2S1 Lecture Notes. G. A. Young http://www2.imperial.ac.uk/ ayoung
M2S1 Lecture Notes G. A. Young http://www2.imperial.ac.uk/ ayoung September 2011 ii Contents 1 DEFINITIONS, TERMINOLOGY, NOTATION 1 1.1 EVENTS AND THE SAMPLE SPACE......................... 1 1.1.1 OPERATIONS
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
Techniques algébriques en calcul quantique
Techniques algébriques en calcul quantique E. Jeandel Laboratoire de l Informatique du Parallélisme LIP, ENS Lyon, CNRS, INRIA, UCB Lyon 8 Avril 25 E. Jeandel, LIP, ENS Lyon Techniques algébriques en calcul
15.062 Data Mining: Algorithms and Applications Matrix Math Review
.6 Data Mining: Algorithms and Applications Matrix Math Review The purpose of this document is to give a brief review of selected linear algebra concepts that will be useful for the course and to develop
f(x) = g(x), if x A h(x), if x B.
1. Piecewise Functions By Bryan Carrillo, University of California, Riverside We can create more complicated functions by considering Piece-wise functions. Definition: Piecewise-function. A piecewise-function
Statistical Machine Learning
Statistical Machine Learning UoC Stats 37700, Winter quarter Lecture 4: classical linear and quadratic discriminants. 1 / 25 Linear separation For two classes in R d : simple idea: separate the classes
MATH 304 Linear Algebra Lecture 20: Inner product spaces. Orthogonal sets.
MATH 304 Linear Algebra Lecture 20: Inner product spaces. Orthogonal sets. Norm The notion of norm generalizes the notion of length of a vector in R n. Definition. Let V be a vector space. A function α
1 The Brownian bridge construction
The Brownian bridge construction The Brownian bridge construction is a way to build a Brownian motion path by successively adding finer scale detail. This construction leads to a relatively easy proof
This unit will lay the groundwork for later units where the students will extend this knowledge to quadratic and exponential functions.
Algebra I Overview View unit yearlong overview here Many of the concepts presented in Algebra I are progressions of concepts that were introduced in grades 6 through 8. The content presented in this course
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
Class Meeting # 1: Introduction to PDEs
MATH 18.152 COURSE NOTES - CLASS MEETING # 1 18.152 Introduction to PDEs, Fall 2011 Professor: Jared Speck Class Meeting # 1: Introduction to PDEs 1. What is a PDE? We will be studying functions u = u(x
Lecture 5 Principal Minors and the Hessian
Lecture 5 Principal Minors and the Hessian Eivind Eriksen BI Norwegian School of Management Department of Economics October 01, 2010 Eivind Eriksen (BI Dept of Economics) Lecture 5 Principal Minors and
Least-Squares Intersection of Lines
Least-Squares Intersection of Lines Johannes Traa - UIUC 2013 This write-up derives the least-squares solution for the intersection of lines. In the general case, a set of lines will not intersect at a
F. ABTAHI and M. ZARRIN. (Communicated by J. Goldstein)
Journal of Algerian Mathematical Society Vol. 1, pp. 1 6 1 CONCERNING THE l p -CONJECTURE FOR DISCRETE SEMIGROUPS F. ABTAHI and M. ZARRIN (Communicated by J. Goldstein) Abstract. For 2 < p
ON PRICE CAPS UNDER UNCERTAINTY
ON PRICE CAPS UNDER UNCERTAINTY ROBERT EARLE CHARLES RIVER ASSOCIATES KARL SCHMEDDERS KSM-MEDS, NORTHWESTERN UNIVERSITY TYMON TATUR DEPT. OF ECONOMICS, PRINCETON UNIVERSITY APRIL 2004 Abstract. This paper
The Ergodic Theorem and randomness
The Ergodic Theorem and randomness Peter Gács Department of Computer Science Boston University March 19, 2008 Peter Gács (Boston University) Ergodic theorem March 19, 2008 1 / 27 Introduction Introduction
Properties of BMO functions whose reciprocals are also BMO
Properties of BMO functions whose reciprocals are also BMO R. L. Johnson and C. J. Neugebauer The main result says that a non-negative BMO-function w, whose reciprocal is also in BMO, belongs to p> A p,and
SEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS. Nickolay Khadzhiivanov, Nedyalko Nenov
Serdica Math. J. 30 (2004), 95 102 SEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS Nickolay Khadzhiivanov, Nedyalko Nenov Communicated by V. Drensky Abstract. Let Γ(M) where M V (G) be the set of all vertices
Lecture 10. Finite difference and finite element methods. Option pricing Sensitivity analysis Numerical examples
Finite difference and finite element methods Lecture 10 Sensitivities and Greeks Key task in financial engineering: fast and accurate calculation of sensitivities of market models with respect to model
Geometrical Characterization of RN-operators between Locally Convex Vector Spaces
Geometrical Characterization of RN-operators between Locally Convex Vector Spaces OLEG REINOV St. Petersburg State University Dept. of Mathematics and Mechanics Universitetskii pr. 28, 198504 St, Petersburg
Principle of Data Reduction
Chapter 6 Principle of Data Reduction 6.1 Introduction An experimenter uses the information in a sample X 1,..., X n to make inferences about an unknown parameter θ. If the sample size n is large, then
STA 4273H: Statistical Machine Learning
STA 4273H: Statistical Machine Learning Russ Salakhutdinov Department of Statistics! [email protected]! http://www.cs.toronto.edu/~rsalakhu/ Lecture 6 Three Approaches to Classification Construct
Research Article Stability Analysis for Higher-Order Adjacent Derivative in Parametrized Vector Optimization
Hindawi Publishing Corporation Journal of Inequalities and Applications Volume 2010, Article ID 510838, 15 pages doi:10.1155/2010/510838 Research Article Stability Analysis for Higher-Order Adjacent Derivative
Probability Theory. Florian Herzog. A random variable is neither random nor variable. Gian-Carlo Rota, M.I.T..
Probability Theory A random variable is neither random nor variable. Gian-Carlo Rota, M.I.T.. Florian Herzog 2013 Probability space Probability space A probability space W is a unique triple W = {Ω, F,
Lecture 3: Linear methods for classification
Lecture 3: Linear methods for classification Rafael A. Irizarry and Hector Corrada Bravo February, 2010 Today we describe four specific algorithms useful for classification problems: linear regression,
A linear algebraic method for pricing temporary life annuities
A linear algebraic method for pricing temporary life annuities P. Date (joint work with R. Mamon, L. Jalen and I.C. Wang) Department of Mathematical Sciences, Brunel University, London Outline Introduction
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
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
1 = (a 0 + b 0 α) 2 + + (a m 1 + b m 1 α) 2. for certain elements a 0,..., a m 1, b 0,..., b m 1 of F. Multiplying out, we obtain
Notes on real-closed fields These notes develop the algebraic background needed to understand the model theory of real-closed fields. To understand these notes, a standard graduate course in algebra is
Tilings of the sphere with right triangles III: the asymptotically obtuse families
Tilings of the sphere with right triangles III: the asymptotically obtuse families Robert J. MacG. Dawson Department of Mathematics and Computing Science Saint Mary s University Halifax, Nova Scotia, Canada
THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS
THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS KEITH CONRAD 1. Introduction The Fundamental Theorem of Algebra says every nonconstant polynomial with complex coefficients can be factored into linear
MINIMIZATION OF ENTROPY FUNCTIONALS UNDER MOMENT CONSTRAINTS. denote the family of probability density functions g on X satisfying
MINIMIZATION OF ENTROPY FUNCTIONALS UNDER MOMENT CONSTRAINTS I. Csiszár (Budapest) Given a σ-finite measure space (X, X, µ) and a d-tuple ϕ = (ϕ 1,..., ϕ d ) of measurable functions on X, for a = (a 1,...,
Lecture 13: Risk Aversion and Expected Utility
Lecture 13: Risk Aversion and Expected Utility Uncertainty over monetary outcomes Let x denote a monetary outcome. C is a subset of the real line, i.e. [a, b]. A lottery L is a cumulative distribution
Chapter 4 One Dimensional Kinematics
Chapter 4 One Dimensional Kinematics 41 Introduction 1 4 Position, Time Interval, Displacement 41 Position 4 Time Interval 43 Displacement 43 Velocity 3 431 Average Velocity 3 433 Instantaneous Velocity
ORIENTATIONS. Contents
ORIENTATIONS Contents 1. Generators for H n R n, R n p 1 1. Generators for H n R n, R n p We ended last time by constructing explicit generators for H n D n, S n 1 by using an explicit n-simplex which
About the Gamma Function
About the Gamma Function Notes for Honors Calculus II, Originally Prepared in Spring 995 Basic Facts about the Gamma Function The Gamma function is defined by the improper integral Γ) = The integral is
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
Notes on Symmetric Matrices
CPSC 536N: Randomized Algorithms 2011-12 Term 2 Notes on Symmetric Matrices Prof. Nick Harvey University of British Columbia 1 Symmetric Matrices We review some basic results concerning symmetric matrices.
