Problem Set 3: Model Solutions

Similar documents
CS473-Algorithms I. Lecture 12b. Dynamic Tables. CS 473 Lecture X 1

1. Linear second-order circuits

10.2 Series. , we get. which is called an infinite series ( or just a series) and is denoted, for short, by the symbol. i i n

Collapsing to Sample and Remainder Means. Ed Stanek. In order to collapse the expanded random variables to weighted sample and remainder

D KL (P Q) := p i ln p i q i

AUCTION CHOICE * Huagang Li and John G. Riley. Hong Kong University of Science and Technology. and. University of California, Los Angeles

Debabrata Dey and Atanu Lahiri

INEQUALITIES USING CONVEX COMBINATION CENTERS AND SET BARYCENTERS

Linear Approximating to Integer Addition

Simple Linear Regression Analysis

Lecture 25 Highlights Phys 402

STK4011 and STK9011 Autumn 2016

UNIVERSITY OF OSLO DEPARTMENT OF ECONOMICS

REVIEW OF SIMPLE LINEAR REGRESSION SIMPLE LINEAR REGRESSION

CIS 800/002 The Algorithmic Foundations of Data Privacy October 13, Lecture 9. Database Update Algorithms: Multiplicative Weights

( ) Thermal noise ktb (T is absolute temperature in kelvin, B is bandwidth, k is Boltzamann s constant) Shot noise

EVALUATION OF PERFORMANCE MEASURES OF FMS Bottleneck Model. Part mix Mix of the various part or product styles produced by the system

5 Short Proofs of Simplified Stirling s Approximation

Trignometric Inequations and Fuzzy Information Theory

Point Estimation: definition of estimators

= lim. (x 1 x 2... x n ) 1 n. = log. x i. = M, n

Lecture 8: S-modular Games and Power Control

The Mathematical Appendix

means the first term, a2 means the term, etc. Infinite Sequences: follow the same pattern forever.

MATH 247/Winter Notes on the adjoint and on normal operators.

ROOT-LOCUS ANALYSIS. Lecture 11: Root Locus Plot. Consider a general feedback control system with a variable gain K. Y ( s ) ( ) K

2. Independence and Bernoulli Trials

2SLS Estimates ECON In this case, begin with the assumption that E[ i

3. REVIEW OF PROPERTIES OF EIGENVALUES AND EIGENVECTORS

å 1 13 Practice Final Examination Solutions - = CS109 Dec 5, 2018

European Journal of Mathematics and Computer Science Vol. 5 No. 2, 2018 ISSN

New Trade Theory (1979)

University of Pavia, Pavia, Italy. North Andover MA 01845, USA

Improvements on Waring s Problem

On Eccentricity Sum Eigenvalue and Eccentricity Sum Energy of a Graph

Scheduling Jobs with a Common Due Date via Cooperative Game Theory

Pr[X (p + t)n] e D KL(p+t p)n.

Non-uniform Turán-type problems

Chain Rules for Entropy

European Journal of Mathematics and Computer Science Vol. 5 No. 2, 2018 ISSN

Journal of Engineering and Natural Sciences Mühendislik ve Fen Bilimleri Dergisi FACTORIZATION PROPERTIES IN POLYNOMIAL EXTENSION OF UFR S

1 Solution to Problem 6.40

Reaction Time VS. Drug Percentage Subject Amount of Drug Times % Reaction Time in Seconds 1 Mary John Carl Sara William 5 4

Multiple Choice Test. Chapter Adequacy of Models for Regression

Theory study about quarter-wave-stack dielectric mirrors

Random Variables. ECE 313 Probability with Engineering Applications Lecture 8 Professor Ravi K. Iyer University of Illinois

Lecture 4 Sep 9, 2015

Assignment 5/MATH 247/Winter Due: Friday, February 19 in class (!) (answers will be posted right after class)

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 16 11/04/2013. Ito integral. Properties

Solutions to Odd-Numbered End-of-Chapter Exercises: Chapter 17

UNIVERSITY OF OSLO DEPARTMENT OF ECONOMICS

We will look for series solutions to (1) around (at most) regular singular points, which without

THE PUBLISHING HOUSE PROCEEDINGS OF THE ROMANIAN ACADEMY, Series A, OF THE ROMANIAN ACADEMY Volume 6, Number 1/2005, pp

ECON 482 / WH Hong The Simple Regression Model 1. Definition of the Simple Regression Model

Department of Agricultural Economics. PhD Qualifier Examination. August 2011

Comments on Discussion Sheet 18 and Worksheet 18 ( ) An Introduction to Hypothesis Testing

PTAS for Bin-Packing

On a Truncated Erlang Queuing System. with Bulk Arrivals, Balking and Reneging

Minimum Hyper-Wiener Index of Molecular Graph and Some Results on Szeged Related Index

MA 524 Homework 6 Solutions

Quiz 1- Linear Regression Analysis (Based on Lectures 1-14)

X ε ) = 0, or equivalently, lim

CHAPTER 6. d. With success = observation greater than 10, x = # of successes = 4, and

1 Lyapunov Stability Theory

Chapter Newton-Raphson Method of Solving Simultaneous Nonlinear Equations

Chapter 5 Properties of a Random Sample

Lecture 9: Tolerant Testing

1. a. Houston Chronicle, Des Moines Register, Chicago Tribune, Washington Post

Last time: Completed solution to the optimum linear filter in real-time operation

Strong Convergence of Weighted Averaged Approximants of Asymptotically Nonexpansive Mappings in Banach Spaces without Uniform Convexity

MATH 371 Homework assignment 1 August 29, 2013

On the energy of complement of regular line graphs

Some distances and sequences in a weighted graph

ANSWER KEY 7 GAME THEORY, ECON 395

Qualifying Exam Statistical Theory Problem Solutions August 2005

MOSFET Internal Capacitances

Lecture Notes Types of economic variables

NONDIFFERENTIABLE MATHEMATICAL PROGRAMS. OPTIMALITY AND HIGHER-ORDER DUALITY RESULTS

On the periodic continued radicals of 2 and generalization for Vieta s product

Bounds on the expected entropy and KL-divergence of sampled multinomial distributions. Brandon C. Roy

Solved problems 4 th exercise

1 Bertrand duopoly with incomplete information

Harmonic Curvatures in Lorentzian Space

,m = 1,...,n; 2 ; p m (1 p) n m,m = 0,...,n; E[X] = np; n! e λ,n 0; E[X] = λ.

Lecture 9. Some Useful Discrete Distributions. Some Useful Discrete Distributions. The observations generated by different experiments have

. The set of these sums. be a partition of [ ab, ]. Consider the sum f( x) f( x 1)

Econometric Methods. Review of Estimation

(A1) and bˆ represents the expected price conditional on b. being one of the winning bids. Rewrite expression (A1) as follows:.

Ch5 Appendix Q-factor and Smith Chart Matching

ANSWERS TO EVEN NUMBERED EXERCISES IN CHAPTER 9

Mu Sequences/Series Solutions National Convention 2014

α1 α2 Simplex and Rectangle Elements Multi-index Notation of polynomials of degree Definition: The set P k will be the set of all functions:

Chapter 9 Jordan Block Matrices

Discrete Mathematics and Probability Theory Fall 2016 Seshia and Walrand DIS 10b

7.0 Equality Contraints: Lagrange Multipliers

Course 10 Shading. 1. Basic Concepts: Radiance: the light energy. Light Source:

UNIT 2 SOLUTION OF ALGEBRAIC AND TRANSCENDENTAL EQUATIONS

Lecture 3 Probability review (cont d)

Pseudo-random Functions

The multivariate Gaussian probability density function for random vector X (X 1,,X ) T. diagonal term of, denoted

Transcription:

Ecoomc 73 Adaced Mcroecoomc Problem et 3: Model oluto. Coder a -bdder aucto wth aluato deedetly ad detcally dtrbuted accordg to F( ) o uort [,]. Let the hghet bdder ay the rce ( - k)b f + kb to the eller, where k [,], b f = the (frt) hghet of the bd, ad b = the ecod-hghet of the bd. h a k+ t rce aucto: f k = we hae a frt-rce aucto, ad f k = we hae a ecod-rce aucto. he utlty fucto for bdder the u (b,b,, ) [( k)b k max b ] f b max b, otherwe. o f the - other bdder lay the trategy b( ), ' bet reoe ole max ( k)b kb(y)}dg(y) b b (b ) where y max ad G(y) = F (y) the dtrbuto of the hghet of - radom arable deedetly dtrbuted accordg to F(). he frt-order codto L b (b ) N M O Q P d (- k)dg(y) b (b ) { [( k)b kb(b (b ))]}g[b (b )] db where g(y) = ( - )F -2 (y)f(y) the dety of G ad f the dety of F. Ug the fact that he frt-order-codto become d db b (b ) = b [b ( b )], ( [ ( f[b (b )] k)b b b )] = ( b )( ) = F[b ( b )]. For the ecod-rce aucto (k = ), the aboe mle b = o matter what trategy b() the other are layg. I fact, t a domat trategy for each layer to bd b =. 2. he ayoff fucto for th game are u (b,b,, ) b - f b m b, - m b otherwe. If the - other are layg b() the ' bet reoe ge alue ole

where b b ( b ) Z Y ( b ) max (b - ) dh(z) + - b(z)dh(z) b he frt-order codto H(z) = Pr{m < z} = - Pr{m Z Y d dh(z) b ( b ) z} = -[- F(z)]. db b b b h b b b b b h b ( ) ( ) ( ( )) ( ( )) ( ( b )), where h(z) = H'(z). By the uual ere of te, th codto become F I HG K J h( ) b ( ) H( ) b( ) ( ) f( ) F( ) Ug a tegratg factor a aboe yeld b( ) [ F(z)] dz [ F( )] F HG U V W, b( ) I K J. where the cotat the defte tegral are determed the ame way a aboe. For the uform cae, F(z) = z, o we get b( ) + ( ). 3. We characterze aget tratege term of qualty q roduced at a ge kll leel, rather tha the effort e exerted. ecallg that q = e, ad aget are rk-eutral, we ca wrte the exected utlty of aget a u (q, ) = Pr[q > q ] q (a) h a ubcae of art (b) ad (c); whe = 2, the equlbrum trategy we foud there recely q() = 2 /2, whch quadratc kll a ecfed. (b) We how that q mootoe odecreag. Fx two kll leel, for aget, ad let q, q be the roduced qualte at thee kll leel, reectely. ce aget mut (weakly) refer reortg q to reortg q at kll leel, we hae Pr[q > q ] q Pr[q > q ] q mlarly, ce q (weakly) referred to q at, we hae Pr[q > q ] q Pr[q > q ] q UVW 2

Combg thee ge u that q q (Pr[q > q ] Pr[q > q ]) q q or, equaletly, ( )(q q ), ad o q mut be mootoe. (c) Coder ome aget, ad aume all aget emloy the equlbrum trategy q(). At kll leel, roducg qualty q ge exected utlty u (q, ) = Pr[q > q( ) ] q ce we kow q mootoe, ad kll leel are dtrbuted d uformly o [,], u (q, ) = (q (q )) q akg the F.O.C. wth reect to q ge du dq = ( )(q (q )) 2 q (q (q )) = ce q the equlbrum trategy, we make the ubttuto q (q ) = aboe ad rearrage term to get q () = ( ) ce I mle that t a bet reoe to roduce qualty q = at kll leel =, we coclude that the ymmetrc equlbrum trategy q() = ( ) d = ( ) (d) Mootocty of q mle that the maxmum-qualty ubmo wll come from the mot klled artcat. ce kll leel are dtrbuted d uformly o [,], the dtrbuto of the max kll leel wll be F max () =. hu, the exected qualty of the wg ubmo E [max q( )] = q( )df max ( ) = ( ) d = 2 ( ). O the other had, each aget wll exed (exected) effort E [ q() ] = ( ) d = ( ). ce there are artcat we ca ee that, exectato, the total effort exeded by all artcat wll be twce the tem qualty receed by the comay. 4. ecall that both buyer ad eller hae alue draw d from U[,]. Alo, both the buyer ad eller are treated a bdder the acedg aucto; oly the aymet fucto dtguh them. (a) Otmalty for the buyer mmedate, ce by drog out before the rce reache b the buyer mly forgoe the oblty of ome roftable trade ad by cotug after the rce exceed b the buyer' ayoff at mot ad may be egate. Ge th trategy of the buyer, the eller' roblem to determe a dro out rce to 3

max ( )d ( )( ) whch ha a uque maxmum at = /2 +/2. Note that th aucto rocedure reult the ame outcome a a ecod-rce ealed bd aucto, a doe a extee-form whch the eller make a gle take-t-or-leae-t offer. (b) he cotructo of the eller-otmal ex ate effcet mecham mlar to the cotructo of the mecham that maxmze the exected ga from trade Myero ad atterthwate [983]. Our roblem to max U()d.t. (IC) ad (I).,x By alyg Lemma the ote to tate U() term of P() ad the tatg (IC) ad (I) a (*) the Corollary, are roblem become (aumg U() = ):.t. (*) max Z Y P(t)dtd [2b - 2](, b)ddb Z Y. ecallg the defto of P(), our obecte t Z Y Z Y Z Y Z Y Z Y Z Y Z Y (t, b)dbdtd (t, b)ddtdb (, b)ddb where the frt equalty follow from chagg the order of tegrato, ad the ecod from erformg the tegrato (ad reamg t a ). he Lagraga for the otmzato Z Y Z Y L(, ) [ + (2b - 2)](, b)ddb. We wh to fd ad to maxmze L(,) uch that the cotrat (*) bdg. For a fxed, L(,) maxmzed (otwe) by,b) = f b 2 ( f b 2 where = - /(2). he otmal foud by determg the alue of for whch the cotrat (*), 4

bdg. mle calculu reeal that the otmal = /2 (ote that > a requred), ce (*) the reduce to [2b - 2]dbd Z Y. /2+/2 Hece, the ex ate effcet mecham,b) = f b 2 2 * ( f b 2 2. But th mly the outcome of the aucto (a). 5