Weak bidders prefer first-price (sealed-bid) auctions. (This holds both ex-ante, and once the bidders have learned their types)
|
|
- Cecily Lang
- 6 years ago
- Views:
Transcription
1 Econ 805 Advanced Micro Theory I Dan Quint Fall 2007 Lecture 9 Oct Last week, we egan relaxing the assumptions of the symmetric independent private values model. We examined private-value auctions with risk-averse idders, and showed that the first-price (sealed-id) auction led to higher expected revenue than the secondprice (or ascending) auction. Today, we return to risk-neutral idders, ut remove the assumption of symmetry that is, we allow for auctions where the idders values are drawn from different proaility distriutions. For simplicity, we will focus on the case of two idders, one strong and one weak, which we will define. Most of today s results come from the Maskin and Riley paper, Asymmetric Auctions. However, their paper kind of drowns you in notation. One of the nice things aout the Milgrom ook is that he simplifies the proofs of some of the results, so we ll e orrowing some proofs from there. Today s main results: trong idders (idders whose F i favor higher values) prefer second-price (or ascending) auctions Weak idders prefer first-price (sealed-id) auctions (This holds oth ex-ante, and once the idders have learned their types) The seller s preferences can go either way The general setup: two risk-neutral idders, one named trong and one named Weak, with independent private values drawn from F and F W. We will generally assume that F first-order stochastically dominates F W, which we showed earlier was equivalent to F (t) F W (t) for every t. Actually, we ll assume that this holds strictly at all interior values of t, plus something a it stronger. (Like efore, what we re really trying to do is to compare first-price sealed-id auctions to ascending (English) auctions; ut in this setting, that s the same as comparing them to second-price auctions.) In a second-price auction with asymmetric idders, it is still a dominant strategy to id your value; so the initial focus is on understanding equilirium id strategies in the asymmetric first-price auction. Maskin and Riley cite an earlier paper estalishing that in general, an asymmetric twoidder first-price auction has a unique equilirium, which is a solution to the differential equations defined y the idders first-order conditions, suject to the appropriate oundary
2 conditions. If we let and W e the equilirium id functions, then the strong idder s prolem is or with first-order condition max F W ( W ())(t ) max log F W ( W ()) + log(t ) f W ( W ()) ( ) F W ( W ()) W () t and, setting this equal to 0 at = (t ), or t = (), imilarly, for the weak type, f W ( W ()) ( F W ( W ()) W f ( ()) ( F ( ()) ) () = ) () = () W () In a first-price auction, it is never a est-response to id strictly higher than your opponent s highest id, so if we let the supports of the type distriutions e [t, t ] and [t W, t W ], then W (t W ) = (t ). As for the oundary condition at the ottom, first-order stochastic dominance implies that t W t. When these are equal, the other oundary condition is W (t W ) = (t ) = t W = t. (It s easy to show that these are necessary conditions for equilirium. Along with the differential equations, they turn out to e sufficient as well.) When t W < t, the oundary condition gets a little more complicated, as there may e a mass of weak idders who knowingly sumit losing ids. Later on, we ll also consider auctions with reserve prices, in which case the relevant oundary condition is W (r) = (r) = r if r is within the support of oth idders type distriutions. We can use the ranking lemma from last week to show that the proaility distriution of (t ) first-order stochastically dominates the distriution of W (t W ). Recall the ranking lemma: if g(x ) h(x ), and for x x, g(x) = h(x) g (x) > h (x), then g > h aove x. In this case, the oundary condition at the top is cleaner, so we ll rephrase the ranking lemma to start from the top. Lemma. Consider two continuous, differentiale functions g and h. uppose g(x ) h(x ), and for x x, g(x) = h(x) g (x) < h (x). Then g > h elow x. (Proof: see g and h as functions of x x, not x. Then the signs of the derivatives flip and satisfy the conditions of our original ranking lemma.) Lemma 2. If the strong idder s type distriution strictly FOD the weak idder s, then the strong idder s id distriution strictly FOD the weak idder s. 2
3 For i either or W, Pr( i (t i ) < ) = Pr(t i < i ()) = F i ( i ()), so what we want to show is F ( ()) < F W ( W ()) for in the interior of the range of the id functions. As we argued, the id functions must have the same upper ound, which we will call ; so F ( ( )) = F W ( W ( )) =. For <, suppose F ( ()) = F W ( W (). By assumption, F (t) < F W (t) (the type distriution of the strong idder first-order stochastically dominates); and F and F W are increasing, so this requires () > W (). Then from the two idders first-order conditions, f W ( W ()) ( ) F W ( W () = so we just showed that F W ( W ()) = F ( ()) implies W ()) () < F ( ()) W () = f ( ()) ( ) () d d F W ( W ()) < d d F ( ()) o the conditions for the ranking lemma are met, and F W ( W ()) > F ( ()); or the strong idder s id distriution strictly FOD the weak idder s. Maskin and Riley make a stronger assumption than FOD aout how the distriutions of the two idders values differ. pecifically, they require a condition they call Conditional tochastic Dominance: Assumption. For any t and t with t < t, Pr(t < t t < t ) < Pr(t W < t t W < t ). (Usual FOD is simply that this holds for t = t only; so CD implies FOD, ut is stronger.) This is equivalent to F (t) F (t ) < F W (t) F W (t ) for any t < t, which (rearranging) is equivalent to for any t < t, or F F W F (t) F W (t) < F (t ) F W (t ) strictly increasing, that is, which (taking the derivative) is equivalent to d F (t) dt F W (t) > 0 (F W (t)) 2 ( FW (t)f (t) F (t)f W (t) ) > 0 or, dropping the denominator and rearranging, F (t) F (t) > F W (t) F W (t) 3
4 (Milgrom recasts the type distriutions as F (t s), where s takes the value of 0 for the weak idder and for the strong idder. And since F /F is the derivative of log F, he recasts the assumption of Conditional tochastic Dominance as the requirement that d dt log F e increasing in s, or log F is supermodular i.e., has increasing differences in t and s.) Lemma 3. If F CD F W, then (t) < W (t) for interior t. That is, at the same type, a strong idder shades his id further elow his actual value. (Note that this immediately implies that asymmetric first-price auctions are not efficient the weak idder will get the oject when his type is slightly elow the strong idder s.) First-order stochastic dominance implies t W t (ecause F W (t ) F (t ) = ). ince the id functions have the same range and is increasing, W (t W ) = (t ) (t W ) Now pick t < t W, and suppose (t) = W (t). The two idders first-order conditions are f W (t) F W (t) W (t) = t W (t) = t (t) = f (t) F (t) (t) But Conditional tochastic Dominance implies f W (t) F W (t) < f (t) F (t), so for equality, W (t) < (t). Which implies (y the ranking lemma) that W (t) > (t) for t elow t W. o under the assumption that F conditionally first-order stochastically dominates F W, we now know that at the same value t, the weak idder ids more aggressively ut the strong idder s id distriution still first-order stochastically dominates Now we come to the interesting part: Theorem. uppose F conditionally first-order stochastically dominates F W. Then comparing a first-price and second-price auction, lowest. Every type of strong idder prefers the second-price auction Every type of weak idder prefers the first-price auction (For auctions without reserve prices, the preferences are strict for all types aove the For auctions with reserve prices, the preferences are strict for all types aove the reserve price. We prove it elow for a first- and second-price auctions with the same (inding) reserve price; for auctions without a reserve price, just set r = 0.) Proof. First of all, we know that (t) and W (t) have the same range, so define m(t) W ( (t)) as the type of weak idder who ids the same as a strong idder with type t in the first-price auction. (This function is sometimes referred to as a matching function or tying function.) ince (t) < W (t) for interior t, we know that m(t) < t for interior t. 4
5 We will calculate the strong idder s expected payoff at a type t using the envelope theorem. By the usual argument, Taking the derivative with respect to t gives and evaluating this at x = (t) gives f (x, t) = Pr( W (t W ) < x)(t x) f t (x, t) = Pr( W (t W ) < x) f t ( (t), t) = Pr( W (t W ) < (t)) = Pr(t W < m(t)) = F W (m(t)) ince given reserve price r, V (r) = 0, y the envelope theorem, V F P (t) = t r F W (m(s))ds in a first-price auction with a reserve price r. On the other hand, in a second-price auction, oth idders id their types, so and so f t ( (t), t) = Pr(t W < t) = F W (t) V P (t) = t r F W (s)ds ince m(s) < s and F W is strictly increasing, the strong idder strictly prefers the secondprice auction for t > r. By the same exact logic, the weak idder s expected payoff is V F P W (t) = t r F (m (s))ds in the first-price auction, and VW P (t) = t r F (s)ds in the second-price auction; since m (s) > s, the first is higher. o we have the nice, fairly general result that strong idders prefer open auctions and weak idders prefer sealed-id auctions. (My intuition for this is that strong idders are very likely to value the oject more, and therefore very likely to try to outid whatever the weak idder does. In an ascending auction, he can see the weak idder s id, so he can just arely outid him; in a sealed-id first-price auction, he has to guess, and since he likely values the good so highly, he has to aim near the top of the weak idder s id distriution. Maskin and Riley show the extreme example where F W = U[0, ] and F = U[2, 3]. In the second-price auction, the strong idder always wins and pays t W, which on average is 2. In the first-price auction, the equilirium is for the weak idder to id his type and the strong idder to always id, regardless of type; so the strong idder still always wins, and pays. In this case, the 5
6 results aove don t hold equilirium isn t characterized y the first-order conditions ut the intuition goes the same way.) Maskin and Riley point out that empirically, this seems to have een understood y idders, at least in some instances. In timer auctions in the Pacific Northwest, local insiders have loied hard for open auctions. imilarly, uyers who perceived themselves to e strong loied the FCC to use some form of open auction in the early spectrum auctions. This is also something Klemperer points to as one of the failings of the ill-fated 3G auction in witzerland, which raised one-thirtieth of the per-capita revenue of the British and German auctions held the same year: witzerland ran an ascending auction, causing potential entrants who were expected to e weaker than the few incument firms to give up. (At least one company hired idding consultants and then chose not to other idding.) Expected Revenue Now we come to the seller s prolem. Consider auctions without reserve prices. We know from efore that the expected revenue of any auction is the expected value of the marginal revenue of the winner. We know that the second-price auction is efficient gives the oject to the idder with the highest value which without symmetry need not e the idder with the highest marginal revenue. We just showed that the asymmetric first-price auction is not efficient the strong idder ids lower relative to his true valuation, so when the two idders types are close together, the first-price auction is iased toward giving the oject to the weak idder. Which is etter from the seller s point of view depends on whether the two distortions go in the same direction or different directions. To come up with a general principle... If, conditional on their types eing in the same allpark, the weak idder is likely to have significantly higher marginal revenue, then firstprice auction is proaly revenue-superior. If, conditional on their types eing in the same allpark, the weak idder is likely to have the same or lower marginal revenue, the secondprice auction is proaly revenue-superior. Two examples to ear out this intuition. First, suppose the weak idder s types are U[0, ], and the strong idder s types are U[0.5,.5]. Marginal revenue for each is { MR i (t) = t F i(t) t ( t) = 2t for weak idder = f i (t) t (.5 t) = 2t.5 for strong idder o for types that are reasonaly close together, the weak idder has higher marginal revenue than the strong idder; so the first-price auction, which is skewed towards giving the oject to the weak idder, turns out to e revenue-superior. Now suppose instead that the strong idder has types that are U[0, ], and the weak idder has types which with proaility 2 are U[0, ], and with proaility 2 are 0. The marginal revenue for a strong idder with type t is 2t ; the marginal revenue for a weak idder is MR W (t) = t F i(t) f i (t) 6 = t ( t)/2 /2 = 2t
7 o in this case, even though idders are asymmetric, the idder with the higher type also has the higher marginal revenue. In that case, the second-price auction, which is efficient, is also higher-revenue. Maskin and Riley give three results on settings where one auction is revenue-superior to another. Unfortunately, in each case, they need to e fairly restrictive aout the conditions they impose on the distriutions; so interpreting these as roust positive results is a little tricky. On the other hand, it s easy to interpret them as negative results: that is, that sometimes the first-price auction revenue-dominates, and sometimes the second-price auction revenue-dominates, and that it doesn t take a particularly pathological example for either one to happen. Theorem 2. uppose that F is just F W right-shifted y a constant. If F W is weakly convex and strictly log-concave, and MR W (t) 0 for t < t, then the sealed-id auction gives higher expected revenue than the ascending auction. The requirement that F W e convex rules out many familiar-looking distriutions; ut these conditions do allow the uniform distriution, the exponential distriution F (t) e t, and the distriution F (t) t. The other condition is asically that the right-shift not e too severe. (Our example with U[0, ] and U[.5,.5] fit these requirements. The example with U[0, ] and U[2, 3] does not, since the equilirium characterization y differential equations reaks down. In that particular example, the first-price auction still turns out to e revenuesuperior, ut the same proof doesn t work and the result may not generalize.) Theorem 3. uppose that F W is a truncation of F, that is, there is some t such that F W (t) = F (t)/f (t ). Under some regularity conditions on F, the sealed-id auction gives higher expected revenue than the ascending. Theorem 4. uppose F W is just F, with some of the weight taken from the distriution and moved to the lower end. If F has an increasing hazard rate, and with an assumption on how the mass is taken, the ascending auction gives higher expected revenue than the sealed-id auction. 7
Thus far, we ve made four key assumptions that have greatly simplified our analysis:
Econ 85 Advanced Micro Theory I Dan Quint Fall 29 Lecture 7 Thus far, we ve made four key assumptions that have greatly simplified our analysis:. Risk-neutral bidders 2. Ex-ante symmetric bidders 3. Independent
More informationQuestion 1 Affiliated Private Values
Econ 85 Fall 7 Problem Set Solutions Professor: Dan Quint Question Affiliated Private alues a - proving the ranking lemma Suppose g(y) < h(y) for some y > x. Let z = max {x : x < y, g(x) h(x)} (Since g
More informationRobert Wilson (1977), A Bidding Model of Perfect Competition, Review of Economic
Econ 805 Advanced Micro Theory I Dan Quint Fall 2008 Lecture 10 Oct 7 2008 No lecture on Thursday New HW, and solutions to last one, online Today s papers: Robert Wilson (1977), A Bidding Model of Perfect
More informationThe Revenue Equivalence Theorem 1
John Nachbar Washington University May 2, 2017 The Revenue Equivalence Theorem 1 1 Introduction. The Revenue Equivalence Theorem gives conditions under which some very different auctions generate the same
More informationAuctions. data better than the typical data set in industrial organization. auction game is relatively simple, well-specified rules.
Auctions Introduction of Hendricks and Porter. subject, they argue To sell interest in the auctions are prevalent data better than the typical data set in industrial organization auction game is relatively
More informationInterdependent Value Auctions with Insider Bidders
Interdependent Value Auctions with Insider Bidders Jinwoo Kim November 2003 Abstract I study auctions in which there exists an asymmetry in bidders knowledge about their interdependent valuations. Bidders
More informationEconS Microeconomic Theory II Midterm Exam #2 - Answer Key
EconS 50 - Microeconomic Theory II Midterm Exam # - Answer Key 1. Revenue comparison in two auction formats. Consider a sealed-bid auction with bidders. Every bidder i privately observes his valuation
More informationAdvanced Microeconomics II
Advanced Microeconomics Auction Theory Jiaming Mao School of Economics, XMU ntroduction Auction is an important allocaiton mechanism Ebay Artwork Treasury bonds Air waves ntroduction Common Auction Formats
More informationInterdependent Value Auctions with an Insider Bidder 1
Interdependent Value Auctions with an Insider Bidder Jinwoo Kim We study the efficiency of standard auctions with interdependent values in which one of two bidders is perfectly informed of his value while
More informationWorking Paper EQUILIBRIUM SELECTION IN COMMON-VALUE SECOND-PRICE AUCTIONS. Heng Liu
Working Paper EQUILIBRIUM SELECTION IN COMMON-VALUE SECOND-PRICE AUCTIONS Heng Liu This note considers equilibrium selection in common-value secondprice auctions with two bidders. We show that for each
More informationA Simple Example to Illustrate the Linkage Principle
A Simple Example to Illustrate the Linkage Principle Daniel Quint University of Wisconsin April 06 Abstract. I present a numerical example illustrating the revenue-superiority of an open over a closed
More informationSymmetric Separating Equilibria in English Auctions 1
Games and Economic Behavior 38, 19 27 22 doi:116 game21879, available online at http: wwwidealibrarycom on Symmetric Separating Equilibria in English Auctions 1 Sushil Bihchandani 2 Anderson Graduate School
More informationarxiv: v1 [cs.gt] 4 May 2015
Econometrics for Learning Agents DENIS NEKIPELOV, University of Virginia, denis@virginia.edu VASILIS SYRGKANIS, Microsoft Research, vasy@microsoft.com EVA TARDOS, Cornell University, eva.tardos@cornell.edu
More informationMathematical Foundations -1- Constrained Optimization. Constrained Optimization. An intuitive approach 2. First Order Conditions (FOC) 7
Mathematical Foundations -- Constrained Optimization Constrained Optimization An intuitive approach First Order Conditions (FOC) 7 Constraint qualifications 9 Formal statement of the FOC for a maximum
More informationReal option valuation for reserve capacity
Real option valuation for reserve capacity MORIARTY, JM; Palczewski, J doi:10.1016/j.ejor.2016.07.003 For additional information aout this pulication click this link. http://qmro.qmul.ac.uk/xmlui/handle/123456789/13838
More informationSome Notes on Adverse Selection
Some Notes on Adverse Selection John Morgan Haas School of Business and Department of Economics University of California, Berkeley Overview This set of lecture notes covers a general model of adverse selection
More informationWe set up the basic model of two-sided, one-to-one matching
Econ 805 Advanced Micro Theory I Dan Quint Fall 2009 Lecture 18 To recap Tuesday: We set up the basic model of two-sided, one-to-one matching Two finite populations, call them Men and Women, who want to
More informationMonotonicity in Asymmetric First-Price Auctions with Affiliation
Monotonicity in Asymmetric First-Price Auctions with Affiliation David McAdams Abstract I study monotonicity of equilibrium strategies in first-price auctions with asymmetric bidders, risk-aversion, affiliated
More informationCompeting Auctions. Glenn Ellison*, Drew Fudenberg**, and Markus Mobius** First draft: November 28, This draft: March 6, 2003
Competing Auctions Glenn Ellison, Drew Fudenerg, and Markus Moius First draft: Novemer 8, 00 This draft: March 6, 003 This paper studies the conditions under which two competing and otherwise identical
More informationThe Mean Version One way to write the One True Regression Line is: Equation 1 - The One True Line
Chapter 27: Inferences for Regression And so, there is one more thing which might vary one more thing aout which we might want to make some inference: the slope of the least squares regression line. The
More informationTHEORIES ON AUCTIONS WITH PARTICIPATION COSTS. A Dissertation XIAOYONG CAO
THEORIES ON AUCTIONS WITH PARTICIPATION COSTS A Dissertation by XIAOYONG CAO Submitted to the Office of Graduate Studies of Texas A&M University in partial fulfillment of the requirements for the degree
More informationPreliminary notes on auction design
Division of the Humanities and Social Sciences Preliminary notes on auction design kcb Revised Winter 2008 This note exposits a simplified version of Myerson s [8] paper on revenue-maximizing auction design
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 informationSUPPLEMENT TO A MECHANISM DESIGN APPROACH TO RANKING ASYMMETRIC AUCTIONS (Econometrica, Vol. 80, No. 5, September 2012, )
Econometrica Supplementary Material SUPPLEMENT TO A MECHANISM DESIGN APPROACH TO RANKING ASYMMETRIC AUCTIONS (Econometrica, Vol. 80, No. 5, September 2012, 2349 2364) BY RENÉ KIRKEGAARD A1. OTHER AUCTION
More informationf( x) f( y). Functions which are not one-to-one are often called many-to-one. Take the domain and the range to both be all the real numbers:
I. UNIVARIATE CALCULUS Given two sets X and Y, a function is a rule that associates each member of X with exactly one member of Y. That is, some x goes in, and some y comes out. These notations are used
More informationMicroeconomics II Lecture 4: Incomplete Information Karl Wärneryd Stockholm School of Economics November 2016
Microeconomics II Lecture 4: Incomplete Information Karl Wärneryd Stockholm School of Economics November 2016 1 Modelling incomplete information So far, we have studied games in which information was complete,
More informationRevenue Guarantee Equivalence
Revenue Guarantee Equivalence Dirk Bergemann Benjamin Brooks Stephen Morris November 7, 2018 Abstract We revisit the revenue comparison of standard auction formats, including first-price, second-price,
More informationChapter 2. Equilibrium. 2.1 Complete Information Games
Chapter 2 Equilibrium Equilibrium attempts to capture what happens in a game when players behave strategically. This is a central concept to these notes as in mechanism design we are optimizing over games
More informationFinQuiz Notes
Reading 9 A time series is any series of data that varies over time e.g. the quarterly sales for a company during the past five years or daily returns of a security. When assumptions of the regression
More information. Divide common fractions: 12 a. = a b. = a b b. = ac b c. 10. State that x 3 means x x x, . Cancel common factors in a fraction : 2a2 b 3.
Page 1 of 6 Target audience: Someone who understands the previous Overview chapters and can comfortaly: 2. Divide common fractions: 3 4 5 = 2 3 5 4 = 10 12 a = a 1 c c = a = ac c 1. Find common denominators:
More informationAn auction with finite types
This is a draft; email me with comments, typos, clarifications, etc. An auction with finite types Let s consider the simplest case of an auction with finite types: there are two players i {1, 2} with types
More informationMechanism Design II. Terence Johnson. University of Notre Dame. Terence Johnson (ND) Mechanism Design II 1 / 30
Mechanism Design II Terence Johnson University of Notre Dame Terence Johnson (ND) Mechanism Design II 1 / 30 Mechanism Design Recall: game theory takes the players/actions/payoffs as given, and makes predictions
More informationMinimum Wages, Employment and. Monopsonistic Competition
Minimum Wages, Employment and Monopsonistic Competition V. Bhaskar Ted To University of Essex Bureau of Laor Statistics August 2003 Astract We set out a model of monopsonistic competition, where each employer
More informationREPUTATION IN REPEATED SECOND-PRICE AUCTIONS. Sushil Bikhchandani. Abstract
REPUTATION IN REPEATED SECOND-PRICE AUCTIONS Sushil Bikhchandani Abstract A model in which two bidders take part in a series of second-price, commonvalue, auctions is examined. The question of an optimal
More informationEconS Sequential Competition
EconS 425 - Sequential Competition Eric Dunaway Washington State University eric.dunaway@wsu.edu Industrial Organization Eric Dunaway (WSU) EconS 425 Industrial Organization 1 / 47 A Warmup 1 x i x j (x
More informationWorking Paper EQUILIBRIUM SELECTION IN COMMON-VALUE SECOND-PRICE AUCTIONS. Heng Liu
Working Paper EQUILIBRIUM SELECTION IN COMMON-VALUE SECOND-PRICE AUCTIONS Heng Liu This paper considers the problem of equilibrium selection in a commonvalue second-price auction with two bidders. We show
More informationMechanism Design: Bayesian Incentive Compatibility
May 30, 2013 Setup X : finite set of public alternatives X = {x 1,..., x K } Θ i : the set of possible types for player i, F i is the marginal distribution of θ i. We assume types are independently distributed.
More informationSecond Price Auctions with Differentiated Participation Costs
Second Price Auctions with Differentiated Participation Costs Xiaoyong Cao Department of Economics Texas A&M University College Station, TX 77843 Guoqiang Tian Department of Economics Texas A&M University
More informationNon-Linear Regression Samuel L. Baker
NON-LINEAR REGRESSION 1 Non-Linear Regression 2006-2008 Samuel L. Baker The linear least squares method that you have een using fits a straight line or a flat plane to a unch of data points. Sometimes
More informationUniqueness and Existence of Equilibrium in Auctions with a Reserve Price
Games and Economic Behavior 30, 83 114 (2000) doi:10.1006/game.1998.0704, available online at http://www.idealibrary.com on Uniqueness and Existence of Equilibrium in Auctions with a Reserve Price Alessandro
More informationModule 9: Further Numbers and Equations. Numbers and Indices. The aim of this lesson is to enable you to: work with rational and irrational numbers
Module 9: Further Numers and Equations Lesson Aims The aim of this lesson is to enale you to: wor with rational and irrational numers wor with surds to rationalise the denominator when calculating interest,
More informationSecond-Price Auctions with Different Participation Costs
Second-Price Auctions with Different Participation Costs Xiaoyong Cao Department of Economics University of International Business and Economics Beijing, China, 100029 Guoqiang Tian Department of Economics
More informationParametric Equations, Function Composition and the Chain Rule: A Worksheet
Parametric Equations, Function Composition and the Chain Rule: A Worksheet Prof.Rebecca Goldin Oct. 8, 003 1 Parametric Equations We have seen that the graph of a function f(x) of one variable consists
More information1 Hoeffding s Inequality
Proailistic Method: Hoeffding s Inequality and Differential Privacy Lecturer: Huert Chan Date: 27 May 22 Hoeffding s Inequality. Approximate Counting y Random Sampling Suppose there is a ag containing
More informationThe Envelope Theorem
The Envelope Theorem In an optimization problem we often want to know how the value of the objective function will change if one or more of the parameter values changes. Let s consider a simple example:
More informationwe make slices perpendicular to the x-axis. If the slices are thin enough, they resemble x cylinders or discs. The formula for the x
Math Learning Centre Solids of Revolution When we rotate a curve around a defined ais, the -D shape created is called a solid of revolution. In the same wa that we can find the area under a curve calculating
More informationPolynomial Degree and Finite Differences
CONDENSED LESSON 7.1 Polynomial Degree and Finite Differences In this lesson, you Learn the terminology associated with polynomials Use the finite differences method to determine the degree of a polynomial
More informationThe key is that there are two disjoint populations, and everyone in the market is on either one side or the other
Econ 805 Advanced Micro Theory I Dan Quint Fall 2009 Lecture 17 So... two-sided matching markets. First off, sources. I ve updated the syllabus for the next few lectures. As always, most of the papers
More informationUniversity of Warwick, Department of Economics Spring Final Exam. Answer TWO questions. All questions carry equal weight. Time allowed 2 hours.
University of Warwick, Department of Economics Spring 2012 EC941: Game Theory Prof. Francesco Squintani Final Exam Answer TWO questions. All questions carry equal weight. Time allowed 2 hours. 1. Consider
More informationAsymmetric common-value auctions with applications to private-value auctions with resale
Econ Theory (1) 45:53 9 DOI 1.17/s199-9-55-6 SYMPOSIUM Asymmetric common-value auctions with applications to private-value auctions with resale Harrison H. Cheng Guofu Tan Received: 6 January 9 / Accepted:
More informationAnswers to the Exercises -- Chapter 1
Answers to the Exercises -- Chapter 1 SECTION 1 1. a Sentence, official notation ~~~P ~~P ~P P Sentence, informal notation ~Q ~R /\ ~Q ~R Q R c d e Not a sentence; it is impossile to construct "~ " Not
More informationCommon Value Auctions with Return Policies
Common Value Auctions with Return Policies Ruqu Wang Jun Zhang October 11, 2011 Abstract This paper eamines the role of return policies in common value auctions. In second-price auctions with continuous
More informationUncertainty. Michael Peters December 27, 2013
Uncertainty Michael Peters December 27, 20 Lotteries In many problems in economics, people are forced to make decisions without knowing exactly what the consequences will be. For example, when you buy
More informationGame Theory. Monika Köppl-Turyna. Winter 2017/2018. Institute for Analytical Economics Vienna University of Economics and Business
Monika Köppl-Turyna Institute for Analytical Economics Vienna University of Economics and Business Winter 2017/2018 Static Games of Incomplete Information Introduction So far we assumed that payoff functions
More informationLecture 10: Mechanism Design
Computational Game Theory Spring Semester, 2009/10 Lecture 10: Mechanism Design Lecturer: Yishay Mansour Scribe: Vera Vsevolozhsky, Nadav Wexler 10.1 Mechanisms with money 10.1.1 Introduction As we have
More informationMechanism Design: Dominant Strategies
May 20, 2014 Some Motivation Previously we considered the problem of matching workers with firms We considered some different institutions for tackling the incentive problem arising from asymmetric information
More informationNumerical Analysis of Asymmetric First Price Auctions with Reserve Prices
Numerical Analysis of Asymmetric First Price Auctions with Reserve Prices Wayne-Roy Gayle University of Pittsburgh February, 004 Preliminary: Comments Welcome Abstract We develop a powerful and user-friendly
More informationOn Ascending Vickrey Auctions for Heterogeneous Objects
On Ascending Vickrey Auctions for Heterogeneous Objects Sven de Vries James Schummer Rakesh Vohra (Zentrum Mathematik, Munich) (Kellogg School of Management, Northwestern) (Kellogg School of Management,
More informationEcon Slides from Lecture 10
Econ 205 Sobel Econ 205 - Slides from Lecture 10 Joel Sobel September 2, 2010 Example Find the tangent plane to {x x 1 x 2 x 2 3 = 6} R3 at x = (2, 5, 2). If you let f (x) = x 1 x 2 x3 2, then this is
More informationMultidimensional Private Value Auctions
Multidimensional Private Value Auctions Hanming Fang Stephen Morris First Draft: May 2002 This Draft: March 2003 Abstract We consider parametric examples of two-bidder private value auctions in which each
More informationMTH 65 WS 3 ( ) Radical Expressions
MTH 65 WS 3 (9.1-9.4) Radical Expressions Name: The next thing we need to develop is some new ways of talking aout the expression 3 2 = 9 or, more generally, 2 = a. We understand that 9 is 3 squared and
More informationSequential vs. single-round uniform-price auctions
Games and Economic Behavior 62 2008) 591 609 www.elsevier.com/locate/geb Sequential vs. single-round uniform-price auctions Claudio Mezzetti a,, Aleksandar Saša Pekeč b, Ilia Tsetlin c a University of
More informationNon-Existence of Equilibrium in Vickrey, Second-Price, and English Auctions
Non-Existence of Equilibrium in Vickrey, Second-Price, and English Auctions Matthew O. Jackson September 21, 2005 Forthcoming: Review of Economic Design Abstract A simple example shows that equilibria
More informationIdentification and Testing in Ascending Auctions with Unobserved Heterogeneity
Identification and Testing in Ascending Auctions with Unobserved Heterogeneity Andrés Aradillas-ópez, Amit Gandhi, Daniel Quint July 22, 2010 Abstract This paper empirically studies the consequences of
More informationLecture 6 Games with Incomplete Information. November 14, 2008
Lecture 6 Games with Incomplete Information November 14, 2008 Bayesian Games : Osborne, ch 9 Battle of the sexes with incomplete information Player 1 would like to match player 2's action Player 1 is unsure
More informationWelfare Maximization in Combinatorial Auctions
Welfare Maximization in Combinatorial Auctions Professor Greenwald 2018-03-14 We introduce the VCG mechanism, a direct auction for multiple goods, and argue that it is both welfare-imizing and DSIC. 1
More informationGame Theory: Spring 2017
Game Theory: Spring 2017 Ulle Endriss Institute for Logic, Language and Computation University of Amsterdam Ulle Endriss 1 Plan for Today In this second lecture on mechanism design we are going to generalise
More informationCorrelated Equilibrium in Games with Incomplete Information
Correlated Equilibrium in Games with Incomplete Information Dirk Bergemann and Stephen Morris Econometric Society Summer Meeting June 2012 Robust Predictions Agenda game theoretic predictions are very
More informationDeceptive Advertising with Rational Buyers
Deceptive Advertising with Rational Buyers September 6, 016 ONLINE APPENDIX In this Appendix we present in full additional results and extensions which are only mentioned in the paper. In the exposition
More informationEssential Maths 1. Macquarie University MAFC_Essential_Maths Page 1 of These notes were prepared by Anne Cooper and Catriona March.
Essential Maths 1 The information in this document is the minimum assumed knowledge for students undertaking the Macquarie University Masters of Applied Finance, Graduate Diploma of Applied Finance, and
More informationRationalizable Bidding in First-Price Auctions 1
Rationalizable Bidding in First-Price Auctions 1 Pierpaolo Battigalli Bocconi University Marciano Siniscalchi Princeton University December 2000; final revision March 2002 1 Email: pierpaolo.battigalli@uni-bocconi.it,
More informationDynamic Programming Theorems
Dynamic Programming Theorems Prof. Lutz Hendricks Econ720 September 11, 2017 1 / 39 Dynamic Programming Theorems Useful theorems to characterize the solution to a DP problem. There is no reason to remember
More informationLecture Notes on Monotone Comparative Statics and Producer Theory
Lecture Notes on Monotone Comparative Statics and Producer Theory Susan Athey Fall 1998 These notes summarize the material from the Athey, Milgrom, and Roberts monograph which is most important for this
More informationGeneralized Geometric Series, The Ratio Comparison Test and Raabe s Test
Generalized Geometric Series The Ratio Comparison Test and Raae s Test William M. Faucette Decemer 2003 The goal of this paper is to examine the convergence of a type of infinite series in which the summands
More informationGenetic Algorithms applied to Problems of Forbidden Configurations
Genetic Algorithms applied to Prolems of Foridden Configurations R.P. Anstee Miguel Raggi Department of Mathematics University of British Columia Vancouver, B.C. Canada V6T Z2 anstee@math.uc.ca mraggi@gmail.com
More informationMultidimensional private value auctions
Journal of Economic Theory 126 (2006) 1 30 www.elsevier.com/locate/jet Multidimensional private value auctions Hanming Fang a, Stephen Morris b, a Department of Economics, Yale University, P.O. Box 208264,
More informationEach element of this set is assigned a probability. There are three basic rules for probabilities:
XIV. BASICS OF ROBABILITY Somewhere out there is a set of all possile event (or all possile sequences of events which I call Ω. This is called a sample space. Out of this we consider susets of events which
More informationLecture Note II-3 Static Games of Incomplete Information. Games of incomplete information. Cournot Competition under Asymmetric Information (cont )
Lecture Note II- Static Games of Incomplete Information Static Bayesian Game Bayesian Nash Equilibrium Applications: Auctions The Revelation Principle Games of incomplete information Also called Bayesian
More informationEconomics 2010c: Lectures 9-10 Bellman Equation in Continuous Time
Economics 2010c: Lectures 9-10 Bellman Equation in Continuous Time David Laibson 9/30/2014 Outline Lectures 9-10: 9.1 Continuous-time Bellman Equation 9.2 Application: Merton s Problem 9.3 Application:
More informationThis work is distributed as a Discussion Paper by the STANFORD INSTITUTE FOR ECONOMIC POLICY RESEARCH
This work is distributed as a Discussion Paper by the STANFORD INSTITUTE FOR ECONOMIC POLICY RESEARCH SIEPR Discussion Paper No. 03-4 Optimal Second Price Auctions with Positively Correlated Private Values
More informationUNDERSTANDING FUNCTIONS
Learning Centre UNDERSTANDING FUNCTIONS Function As a Machine A math function can be understood as a machine that takes an input and produces an output. Think about your CD Player as a machine that takes
More informationMultidimensional Private Value Auctions
Multidimensional Private Value Auctions Hanming Fang Stephen Morris First Draft: May 2002 This Draft: February 2004 Abstract We consider parametric examples of symmetric two-bidder private value auctions
More informationWeak* Axiom of Independence and the Non-Expected Utility Theory
Review of Economic Analysis 4 (01) 67-75 1973-3909/01067 Weak* Axiom of Independence and the Non-Expected Utility Theory TAPAN BISWAS University of Hull 1 Introduction The axiomatic foundation of the expected
More informationUpper Bounds for Stern s Diatomic Sequence and Related Sequences
Upper Bounds for Stern s Diatomic Sequence and Related Sequences Colin Defant Department of Mathematics University of Florida, U.S.A. cdefant@ufl.edu Sumitted: Jun 18, 01; Accepted: Oct, 016; Pulished:
More informationANOVA 3/12/2012. Two reasons for using ANOVA. Type I Error and Multiple Tests. Review Independent Samples t test
// ANOVA Lectures - Readings: GW Review Independent Samples t test Placeo Treatment 7 7 7 Mean... Review Independent Samples t test Placeo Treatment 7 7 7 Mean.. t (). p. C. I.: p t tcrit s pt crit s t
More informationPosition Auctions with Interdependent Values
Position Auctions with Interdependent Values Haomin Yan August 5, 217 Abstract This paper extends the study of position auctions to an interdependent values model in which each bidder s value depends on
More informationEconS Advanced Microeconomics II Handout on Mechanism Design
EconS 503 - Advanced Microeconomics II Handout on Mechanism Design 1. Public Good Provision Imagine that you and your colleagues want to buy a co ee machine for your o ce. Suppose that some of you may
More informationOutline for Static Games of Incomplete Information
Outline for Static Games of Incomplete Information I. Example 1: An auction game with discrete bids II. Example 2: Cournot duopoly with one-sided asymmetric information III. Definition of Bayesian-Nash
More informationBayesian Games and Mechanism Design Definition of Bayes Equilibrium
Bayesian Games and Mechanism Design Definition of Bayes Equilibrium Harsanyi [1967] What happens when players do not know one another s payoffs? Games of incomplete information versus games of imperfect
More informationMechanism Design. Terence Johnson. December 7, University of Notre Dame. Terence Johnson (ND) Mechanism Design December 7, / 44
Mechanism Design Terence Johnson University of Notre Dame December 7, 2017 Terence Johnson (ND) Mechanism Design December 7, 2017 1 / 44 Market Design vs Mechanism Design In Market Design, we have a very
More informationChapter 2. Equilibrium. 2.1 Complete Information Games
Chapter 2 Equilibrium The theory of equilibrium attempts to predict what happens in a game when players behave strategically. This is a central concept to this text as, in mechanism design, we are optimizing
More informationInformation Acquisition in Interdependent Value Auctions
Information Acquisition in Interdependent Value Auctions Dirk Bergemann Xianwen Shi Juuso Välimäki July 16, 2008 Abstract We consider an auction environment with interdependent values. Each bidder can
More informationEquilibria in Second Price Auctions with Participation Costs
Equilibria in Second Price Auctions with Participation Costs Guofu Tan and Okan Yilankaya January 2005 Abstract We investigate equilibria of sealed-bid second price auctions with bidder participation costs
More informationNotes and Solutions #6 Meeting of 21 October 2008
HAVERFORD COLLEGE PROBLEM SOLVING GROUP 008-9 Notes and Solutions #6 Meeting of October 008 The Two Envelope Problem ( Box Problem ) An extremely wealthy intergalactic charitable institution has awarded
More informationDEPARTMENT OF ECONOMICS YALE UNIVERSITY P.O. Box New Haven, CT
DEPARTMENT OF ECONOMICS YALE UNIVERSITY P.O. Box 208268 New Haven, CT 06520-8268 http://www.econ.yale.edu/ Economics Department Working Paper No. 25 Cowles Foundation Discussion Paper No. 1619 Information
More informationLooking smart versus playing dumb in common-value auctions
Econ Theory (1) 44:469 49 DOI 1.17/s199-9-491-8 RESEARCH ARTICLE Looking smart versus playing dumb in common-value auctions Daniel Quint Received: 14 January 9 / Accepted: 8 July 9 / Published online:
More informationFirms and returns to scale -1- John Riley
Firms and returns to scale -1- John Riley Firms and returns to scale. Increasing returns to scale and monopoly pricing 2. Natural monopoly 1 C. Constant returns to scale 21 D. The CRS economy 26 E. pplication
More informationOnline Appendix for "Auctions in Markets: Common Outside Options and the Continuation Value Effect" Not intended for publication
Online Appendix for "Auctions in Markets: Common Outside Options and the Continuation Value Effect" Not intended for publication Stephan Lauermann Gabor Virag March 19, 2012 1 First-price and second-price
More informationInefficient Equilibria of Second-Price/English Auctions with Resale
Inefficient Equilibria of Second-Price/English Auctions with Resale Rod Garratt, Thomas Tröger, and Charles Zheng September 29, 2006 Abstract In second-price or English auctions involving symmetric, independent,
More informationEstimating a Finite Population Mean under Random Non-Response in Two Stage Cluster Sampling with Replacement
Open Journal of Statistics, 07, 7, 834-848 http://www.scirp.org/journal/ojs ISS Online: 6-798 ISS Print: 6-78X Estimating a Finite Population ean under Random on-response in Two Stage Cluster Sampling
More information