Auction Theory Lecture Note, David McAdams, Fall Bilateral Trade
|
|
- Carmella Willis
- 5 years ago
- Views:
Transcription
1 Auction Theory Lecture Note, Daid McAdams, Fall Bilateral Trade ** Reised : An error in the discussion after Theorem 4 has been corrected. We shall use the example of bilateral trade to introduce seeral key ideas of auction theory and mechanism design more generally. Basic setup There is one seller and one buyer, each of whom is risk-neutral. The seller can produce one unit of a perishable good at priate cost c [c, c] while the buyer has priate alue [, ]., c are assumed to be independently distributed, with pdfs, f S (c) and cdfs F B (), F S (c). Assume that these distributions satisfy the monotonicity requirement that 1 F B () and c + F S (c) are increasing in, c. (Interpretations of this assumption will f S (c) emerge later.) The players hae one opportunity to trade. We are interested in whether and when trade will occur. For the moment, we shall abstract from the details of the process that generates such trade, iewing that process as generating a mechanism, and focus on the outcome generated in that mechanism. 1 Namely, conditional on realized alues of (, c), what is the probability x(, c) that the seller produces the good and the buyer consumes it, and what are the expected payments t S (, c) made to the seller and the expected payment t B (, c) made by the buyer? (For simplicity, we assume that the good is neer produced and not consumed.) Payoffs. Since the players are assumed risk-neutral, these probabilities and expectations are sufficient to capture their ex post utility conditional on each realized (, c). Namely: (buyer s ex post utility) x(, c) t B (, c) (seller s ex post utility) t S (, c) cx(, c) Similarly, we may express each player s interim (or interim expected ) utility conditional on just his own priate information as: 1 Mechanisms were defined formally in Econ 302.
2 Auction Theory Lecture Note, Daid McAdams, Fall (buyer s interim utility) x B () t B () where x B () E[x(, c) ] and t B () E[t B (, c) ] (seller s interim utility) t S (c) cx S (c) where x S (c) E[x(, c) c] and t S (c) E[t S (, c) c] Restrictions. When the players hae limited recourse to an outside source of funds, transfers may be limited to satisfy a budget balance (BB) requirement. The most commonly studied are: (ex post BB) t B (, c) t S (, c) for all (, c) (ex ante BB) E[t B (, c)] E[t S (, c)] A weaker ersion of budget balance is so-called feasibility, which allows for the possibility that the seller may receie less than the buyer pays. If participation is oluntary, payoffs may also be restricted to be positie. This leads to an indiidual rationality (IR) requirement. The most commonly studied are: (ex post IR) x(, c) t B (, c) 0 and t S (, c) cx(, c) 0 for all (, c) (interim IR) x B () t B () 0 and t S (c) cx S (c) 0 for all (, c) Finally, since players are strategic, they must hae an incentie not to seek to change the mechanism outcome. This leads to an incentie compatibility (IC) requirement. The most commonly studied are: (ex post IC) x(, c) t B (, c) x(ṽ, c) t B (ṽ, c) and t S (, c) cx(, c) t S (, c) cx(, c) for all (, c) (interim IC) x B () t B () x B (ṽ) t B (ṽ) and t S (c) cx S (c) t S ( c) cx S ( c) for all (, c) When ex post IC is satisfied, the mechanism is implemented in dominant strategies. When interim IC is satisfied, the mechanism is implemented in Bayesian equilibrium strategies. In the interests of time, we will not discuss dominant strategy implementation, a rich field of its own. Howeer, for the interested student, I think it would be worth your time to find a simple proof of the following result. (Theorem 1 is a special case of Theorem 2, which is proen below.) Theorem 1. No mechanism exists that is efficient and that satisfies ex post IR, interim IC, and ex ante BB.
3 Auction Theory Lecture Note, Daid McAdams, Fall Bayesian implementation What outcomes can arise when we restrict attention to mechanisms in which players adopt Bayesian equilibrium strategies (interim IC) and neer get negatie interim payoffs (interim IR), and in which the buyer s payment must on aerage equal the seller s price (ex ante BB)? In many contexts, one may want to restrict attention further, say to mechanisms satisfying ex post IR and ex post BB. Clearly, the set of outcomes that can arise in such mechanisms is smaller than that which can arise under interim IR and ex ante BB. Efficiency s Budget-Balance Theorem 2. Suppose that < c. No mechanism exists that implements the efficient outcome and that satisfies interim IR, interim IC, and ex ante BB. Proof. For simplicity, assume that c m and c m. Suppose for the sake of contradiction that there exists an efficient mechanism satisfying interim IR, interim IC, and ex ante BB. Efficiency requires that trade occurs iff > c. Thus, x B () Pr c ( > c) F S () and x S (c) Pr ( > c) 1 F B (c). By interim IC for the buyer, arg maxṽ x B (ṽ) t B (ṽ). The firstorder condition of this maximization requires that dtb () dxb () f S (). Integrating, we may therefore express the buyer s expected transfer solely in terms of the transfer that he receies upon haing the lowest type: t B () t B () + ṽ dxb (ṽ) dṽ (1) Now, by efficiency (and using the simplifying assumption that c), buyertype has interim payoff t B () since he is neer awarded the object. Interim IR therefore requires that t B () 0 so that t B () ṽ dxb (ṽ) dṽ for all. Recalling that dxb () f S (), we may re-write this as t B () cf S (c)dc (2) Similarly, for the seller, c arg max c t S ( c) cx S ( c) requires that dts (c) dc
4 Auction Theory Lecture Note, Daid McAdams, Fall c dxs (c) dc cf B (c). Integrating, we get that t S (c) t S (c) + c c c dxs ( c) d c (3) dc Again by efficiency, seller-type c neer sells the object and so gets interim payoff t S (c) which must be non-negatie by interim IR. We conclude that t S (c) c d c for all c, which may be re-written as c dxs ( c) c dc Putting this together, t S (c) c c (4) E[t B (, c)] E[t S (, c)] m m m m >c >c t B () ( m m m t S (c)f S (c)dc ) cf S (c)dc cf S (c)dc >c (c )f S (c)dc < 0 m m ( m f S (c)dc c ) f S (c)dc contradicting the assumption of ex ante budget balance (as well as the weaker assumption of ex ante feasibility). By Theorem 2, efficient trade must be subsidized in enironments with a strategic buyer and seller haing priate information. This is the famous result of Myerson and Satterthwaite (1983). For example, one way to implement an efficient outcome is through a Vickrey auction. 2 The buyer and seller each submit a sealed bid, call them ṽ and c. If ṽ c, then the seller keeps the object and no payments are made. Otherwise, if ṽ c, the buyer receies the object, the buyer pays c, and the seller receies ṽ. 2 Such mechanisms are also known as Groes mechanism, piot mechanism, or Vickrey- Clarke-Groes mechanism (VCG) honoring seminal contributions in Vickrey (1961), Clarke (1971), and Groes (1973).
5 Auction Theory Lecture Note, Daid McAdams, Fall Theorem 3. The Vickrey auction implements the efficient outcome and satisfies ex post IR and ex post IC. It is not budget balanced, but its ex ante expected budget imbalance is the smallest possible in any efficient mechanism satisfying interim IR and interim IC. Characterizing interim IR and interim IC mechanisms Theorem 4. A mechanism with outcome {x(, c), t B (, c), t S (, c)} can be implemented in Bayesian equilibrium strategies, subject to interim IR and interim IC, iff three sets of conditions are satisfied: (monotone) x B () is increasing in and x S (c) is decreasing in c (local IC) 3 dt B () dxb () and dts (c) dc c dxs (c) dc (IR at the bottom ) x B () t B () 0 and t S (c) cx S (c) 0 Proof. Necessity. Monotonicity. Consider any two buyer-types 1 > 2. Interim IC requires that both: 1 x B ( 1 ) t B ( 1 ) 1 x B ( 2 ) t B ( 2 ) (5) 2 x B ( 2 ) t B ( 2 ) 2 x B ( 1 ) t B ( 1 ) (6) Summing these conditions, the payment terms cancel (since they do not depend on buyer types) and we are left with the requirement that ( 1 2 )(x B ( 1 ) x B ( 2 )) > 0. We conclude that x B ( 1 ) x B ( 2 ) > 0. The argument is similar for the seller. Local IC and IR at the bottom. Shown in the proof of Theorem 2. Sufficiency. Interim IC. We need to show that buyer-type does not strictly prefer to mimic type ṽ for all ṽ. Type s incremental expected
6 Auction Theory Lecture Note, Daid McAdams, Fall payoff from message relatie to ṽ is: ( x B () t B () ) ( x B (ṽ) t B (ṽ) ) ( x B () x B (ṽ) ) ( t B () t B (ṽ) ) ṽ ṽ ṽ dx B ( ) dx B ( ) ṽ ṽ dt B ( ) (7) dxb ( ) (8) ( ) dxb ( ) 0 (9) (8) follows from (7) by local IC, while (9) holds by monotonicity since dx B ( ) 0. Thus, type prefers not to deiate. The proof of interim IC for the seller is similar. [ d Interim IR. By local IC, x B () t B () ] x B () + dxb () x B () 0. So, x B () t B () x B () t B () 0 for all, where the second inequality follows is by IR at the bottom. dtb () It is worth pausing to reflect upon the power of Theorem 4 for applied work examining mechanisms. First, if an outcome function satisfies the three conditions of the theorem, then that outcome can be implemented in Bayesian equilibrium strategies in the corresponding direct reelation mechanism. Second, and perhaps een more powerful, Theorem 4 proides a shortcut that allows one to guess and erify equilibrium strategies in auctions. Suppose one has a guess about the allocation that will result in equilibrium. This determines the allocation probability functions which, in turn by local IC, determine the expected payments. Knowledge of expected payments can often then be used to back out player strategies. If these inferred strategies do indeed lead to the conjectured allocation, then Theorem 4 tells us that no bidder has any profitable deiation among the range of submitted bids. 4 Indeed, these are the only strategies that might possibly implement the conjectured allocation in Bayesian equilibrium! 4 ALERT: In the first ersion of this note, I incorrectly stated that Theorem 4 tells us that the inferred strategies constitute a Bayesian equilibrium. This is not correct. It remains possible that a bidder could hae a profitable deiation at some price outside of the range of bids made in these strategies. Often it is easy to rule out such bids. For example, imagine that bids in a first-price auction are submitted in the range [0, 1]. Since a bid of 1 always wins, any higher bid is strictly dominated.
7 Auction Theory Lecture Note, Daid McAdams, Fall Virtual aluations and optimal mechanisms So-called irtual aluations play an important role in auction theory and mechanism design more generally. (irtual alue) The buyer s irtual alue ψ B () 1 F B () (irtual cost) The seller s irtual cost ψ S (c) c + F S (c) f S (c). Theorem 5. Suppose that a mechanism with outcome {x B (, c), x S (, c), t B (, c), t S (, c)} can be implemented in Bayesian equilibrium strategies, subject to interim IR and interim IC. Then the net expected payments made by the players takes the form: E [ t B (, c) ] E [ t S (, c) ] E [ x(, c) (( 1 F ) ( B () c + F ))] S (c) f S (c) ( x B () t B () ) ( t S (c) cx S (c) ) (10) where the last two terms of (10) are zero when IR at the bottom is binding. Proof. The ex ante expected welfare created from trade is E[x(, c)( c)], and the last two terms of (10) are the expected profit (or rent or information rent ) of the lowest buyer type and highest seller type. Note that [ex ante expected buyer rent] + [ex ante seller rent] [total surplus] - [ex ante expected payment by the buyer] + [ex ante expected payment to the seller], and that [total surplus] E[x(, c)( c)]. Thus, after re-arranging, [ (10) ( is equialent to)] showing that the sum of the player s rent equals E x(, c) 1 F B () + F S (c). More than that, we will show that f S (c) [ ] [ex ante expected buyer rent] E x(, c) 1 F B () and [ex ante expected [ ] buyer rent] E x(, c) F S (c). f S (c) ( d Consider the buyer. Recall that, by local IC, x B () t B () ) x B (). Thus, a buyer s rent takes the form xb ( ) + [rent of -type]. So, it suffices for us to show that E[ xb ( ) ] E[x B () 1 F B () ], and
8 Auction Theory Lecture Note, Daid McAdams, Fall similarly for the seller. But this follows from integration by parts: E[ x B ( ) ] x B ( )f B ( ) x B ( ) ( 1 F B ( ) ) E[x B () 1 F B () ] The argument for the seller is similar, and omitted. Intuition for Theorem 5. Consider the problem of a social planner that absorbs any budget imbalance. This social planner would like to maximize the realized surplus from trade, while maximizing the amount of money that it is able to extract from the mechanism (or minimizing the amount of money that it must pump into the mechanism). If the realized alues of the players are (, c) with > c, the planner would like to induce trade. Howeer, doing so makes mimicking type more profitable for all buyer types with alues greater than, and makes mimicking type c more profitable for all seller types with alues less than c. So, there is a trade-off. On one hand, inducing this trade creates surplus c, surplus that the social planner might be able to extract from the buyer and seller. The expected pie grows due to this effect by ( c)f S (c). On the other hand, all higher buyer-types must hae their rent increase, leading to more of the pie being gien to the buyer as rent. So, the buyer s ex ante expected rent grows by (1 F B ())f S (c), since this is the probability that a higher buyer type would play against seller-type c. Similarly, the seller s ex ante expected rent grows by F S (c). Oerall, the ex ante expected reenue to the social planner attributable to this trade is proportional to (diiding by f S (c)) ( c) 1 F B () F S (c) f S (c) ψb () ψ S (c) (11) Virtual surplus rule. Let us refer to ψ B () ψ S (c) as the irtual surplus that is created when trade occurs gien buyer alue and seller cost c. The ex ante expected reenue to the social planner is therefore just the
9 Auction Theory Lecture Note, Daid McAdams, Fall ex ante expected irtual surplus from trade, E[x(, c)(ψ B () ψ S (c))]. In particular, the ex ante budget balance requirement is one that the social planner has zero ex ante expected surplus. Theorem 6. Consider the special case, c U[0, 1]. Subject to the requirements of interim IR, interim IC, and ex ante BB, the mechanism that maximizes social welfare is one in which trade occurs iff > c + x, where x is defined implicitly by: ( ψ B () ψ S (c) ) dc 0 (12) (,c):>c+x In the uniform case of Theorem 6, note that ψ B () ψ S (c) 2( c) 1 while d Pr( c x)/dx x for all x [0, 1]. (In class, we shall discuss a graphical interpretation.) After a change of ariables, x can therefore be defined implicitly as the non-zero solution of 1 x (2x 1) x (x ) ( x 2) 1 0, i.e. x 3/4. We conclude that the socially efficient mechanism induces trade iff c > 1. 4 Implementing the (constrained) socially efficient mechanism. An issue of practical interest is whether an outcome of interest can be implemented in equilibrium in a particular game. In the case of bilateral trade with uniform distributions, the (constrained) socially efficient mechanism is indeed implemented within a ery simple and appealing game. Uniform example continued. Consider a game in which the buyer and seller each announce prices, ṽ and c, trade occurs iff ṽ > c at a transaction price equal to the aerage of the announced prices, p ṽ+ c. It is an equilibrium of this game for the buyer to follow bidding strategy ṽ and c 2c+ 1. An important feature of these strategies is that ṽ c c+ 1, so trade occurs exactly when specified in Theorem 6... this is a socially efficient mechanism subject to the constraints of ex ante, interim IR, and interim IC! (Of course, since the payment receied by the seller is always equal to the payment made by the buyer, this outcome induced in this equilibrium in fact satisfies the stronger conditions of ex post BB and ex post IR.) Proof sketch: Consider seller s incenties to slightly shade down his bid by one marginal unit. He will lower his probability of winning by 3/2 and,
10 Auction Theory Lecture Note, Daid McAdams, Fall since he would hae tied on this margin, he will lose ṽ on these marginal units. Since ṽ 1 1/4 ( 1/4), this amounts to losing. On the other 3 2 hand, he will lower his payment when he wins by 1/2, and this happens with probability 1/4. Readings. Myerson and Satterthwaite (1983), Efficient Mechanisms for Bilateral Trading.
Game Theory Solutions to Problem Set 11
Game Theory Solutions to Problem Set. A seller owns an object that a buyer wants to buy. The alue of the object to the seller is c: The alue of the object to the buyer is priate information. The buyer
More informationOptimal Auctions. Game Theory Course: Jackson, Leyton-Brown & Shoham
Game Theory Course: Jackson, Leyton-Brown & Shoham So far we have considered efficient auctions What about maximizing the seller s revenue? she may be willing to risk failing to sell the good she may be
More informationGame Theory Lecture #16
Game Theory Lecture #16 Outline: Auctions Mechanism Design Vickrey-Clarke-Groves Mechanism Optimizing Social Welfare Goal: Entice players to select outcome which optimizes social welfare Examples: Traffic
More informationOptimal auctions with endogenous budgets
Optimal auctions with endogenous budgets Brian Baisa and Stanisla Rabinoich September 14, 2015 Abstract We study the benchmark independent priate alue auction setting when bidders hae endogenously determined
More informationRecap First-Price Revenue Equivalence Optimal Auctions. Auction Theory II. Lecture 19. Auction Theory II Lecture 19, Slide 1
Auction Theory II Lecture 19 Auction Theory II Lecture 19, Slide 1 Lecture Overview 1 Recap 2 First-Price Auctions 3 Revenue Equivalence 4 Optimal Auctions Auction Theory II Lecture 19, Slide 2 Motivation
More informationAuction Theory. Philip Selin. U.U.D.M. Project Report 2016:27. Department of Mathematics Uppsala University
U.U.D.M. Project Report 2016:27 Auction Theory Philip Selin Examensarbete i matematik, 15 hp Handledare: Erik Ekström Examinator: Veronica Crispin Quinonez Juni 2016 Department of Mathematics Uppsala Uniersity
More informationMechanism Design and Auctions
Multiagent Systems (BE4M36MAS) Mechanism Design and Auctions Branislav Bošanský and Michal Pěchouček Artificial Intelligence Center, Department of Computer Science, Faculty of Electrical Engineering, Czech
More informationNotes on Auctions. Theorem 1 In a second price sealed bid auction bidding your valuation is always a weakly dominant strategy.
Notes on Auctions Second Price Sealed Bid Auctions These are the easiest auctions to analyze. Theorem In a second price sealed bid auction bidding your valuation is always a weakly dominant strategy. Proof
More informationOn Existence of Equilibria. Bayesian Allocation-Mechanisms
On Existence of Equilibria in Bayesian Allocation Mechanisms Northwestern University April 23, 2014 Bayesian Allocation Mechanisms In allocation mechanisms, agents choose messages. The messages determine
More informationMechanism Design and Auctions
Mechanism Design and Auctions Game Theory Algorithmic Game Theory 1 TOC Mechanism Design Basics Myerson s Lemma Revenue-Maximizing Auctions Near-Optimal Auctions Multi-Parameter Mechanism Design and the
More information1 Theory of Auctions. 1.1 Independent Private Value Auctions
1 Theory of Auctions 1.1 Independent Private Value Auctions for the moment consider an environment in which there is a single seller who wants to sell one indivisible unit of output to one of n buyers
More informationSingle-Parameter Mechanisms
Algorithmic Game Theory, Summer 25 Single-Parameter Mechanisms Lecture 9 (6 pages) Instructor: Xiaohui Bei In the previous lecture, we learned basic concepts about mechanism design. The goal in this area
More informationProblem Set 3: Suggested Solutions
Microeconomics: Pricing 3E00 Fall 06. True or false: Problem Set 3: Suggested Solutions (a) Since a durable goods monopolist prices at the monopoly price in her last period of operation, the prices must
More informationThe Optimality of Being Efficient. Lawrence Ausubel and Peter Cramton Department of Economics University of Maryland
The Optimality of Being Efficient Lawrence Ausubel and Peter Cramton Department of Economics University of Maryland 1 Common Reaction Why worry about efficiency, when there is resale? Our Conclusion Why
More informationRobust Trading Mechanisms with Budget Surplus and Partial Trade
Robust Trading Mechanisms with Budget Surplus and Partial Trade Jesse A. Schwartz Kennesaw State University Quan Wen Vanderbilt University May 2012 Abstract In a bilateral bargaining problem with private
More informationMarch 30, Why do economists (and increasingly, engineers and computer scientists) study auctions?
March 3, 215 Steven A. Matthews, A Technical Primer on Auction Theory I: Independent Private Values, Northwestern University CMSEMS Discussion Paper No. 196, May, 1995. This paper is posted on the course
More informationDiscriminatory Information Disclosure
Discriminatory Information Disclosure Li, Hao Uniersity of British Columbia Xianwen Shi Uniersity of Toronto First Version: June 2, 29 This ersion: May 21, 213 Abstract We consider a price discrimination
More informationEC476 Contracts and Organizations, Part III: Lecture 3
EC476 Contracts and Organizations, Part III: Lecture 3 Leonardo Felli 32L.G.06 26 January 2015 Failure of the Coase Theorem Recall that the Coase Theorem implies that two parties, when faced with a potential
More informationOnline Appendix for The E ect of Diversi cation on Price Informativeness and Governance
Online Appendix for The E ect of Diersi cation on Price Informatieness and Goernance B Goernance: Full Analysis B. Goernance Through Exit: Full Analysis This section analyzes the exit model of Section.
More informationAuctions in the wild: Bidding with securities. Abhay Aneja & Laura Boudreau PHDBA 279B 1/30/14
Auctions in the wild: Bidding with securities Abhay Aneja & Laura Boudreau PHDBA 279B 1/30/14 Structure of presentation Brief introduction to auction theory First- and second-price auctions Revenue Equivalence
More informationGames of Incomplete Information ( 資訊不全賽局 ) Games of Incomplete Information
1 Games of Incomplete Information ( 資訊不全賽局 ) Wang 2012/12/13 (Lecture 9, Micro Theory I) Simultaneous Move Games An Example One or more players know preferences only probabilistically (cf. Harsanyi, 1976-77)
More informationCS364A: Algorithmic Game Theory Lecture #3: Myerson s Lemma
CS364A: Algorithmic Game Theory Lecture #3: Myerson s Lemma Tim Roughgarden September 3, 23 The Story So Far Last time, we introduced the Vickrey auction and proved that it enjoys three desirable and different
More informationMultiunit Auctions: Package Bidding October 24, Multiunit Auctions: Package Bidding
Multiunit Auctions: Package Bidding 1 Examples of Multiunit Auctions Spectrum Licenses Bus Routes in London IBM procurements Treasury Bills Note: Heterogenous vs Homogenous Goods 2 Challenges in Multiunit
More informationCS364B: Frontiers in Mechanism Design Lecture #18: Multi-Parameter Revenue-Maximization
CS364B: Frontiers in Mechanism Design Lecture #18: Multi-Parameter Revenue-Maximization Tim Roughgarden March 5, 2014 1 Review of Single-Parameter Revenue Maximization With this lecture we commence the
More informationLecture 3: Information in Sequential Screening
Lecture 3: Information in Sequential Screening NMI Workshop, ISI Delhi August 3, 2015 Motivation A seller wants to sell an object to a prospective buyer(s). Buyer has imperfect private information θ about
More informationProblem Set 3: Suggested Solutions
Microeconomics: Pricing 3E Fall 5. True or false: Problem Set 3: Suggested Solutions (a) Since a durable goods monopolist prices at the monopoly price in her last period of operation, the prices must be
More informationParkes Auction Theory 1. Auction Theory. Jacomo Corbo. School of Engineering and Applied Science, Harvard University
Parkes Auction Theory 1 Auction Theory Jacomo Corbo School of Engineering and Applied Science, Harvard University CS 286r Spring 2007 Parkes Auction Theory 2 Auctions: A Special Case of Mech. Design Allocation
More informationDirected Search and the Futility of Cheap Talk
Directed Search and the Futility of Cheap Talk Kenneth Mirkin and Marek Pycia June 2015. Preliminary Draft. Abstract We study directed search in a frictional two-sided matching market in which each seller
More informationHomework 3. Due: Mon 9th December
Homework 3 Due: Mon 9th December 1. Public Goods Provision A firm is considering building a public good (e.g. a swimming pool). There are n agents in the economy, each with IID private value θ i [0, 1].
More informationAuctions That Implement Efficient Investments
Auctions That Implement Efficient Investments Kentaro Tomoeda October 31, 215 Abstract This article analyzes the implementability of efficient investments for two commonly used mechanisms in single-item
More informationIndependent Private Value Auctions
John Nachbar April 16, 214 ndependent Private Value Auctions The following notes are based on the treatment in Krishna (29); see also Milgrom (24). focus on only the simplest auction environments. Consider
More informationAuction Theory: Some Basics
Auction Theory: Some Basics Arunava Sen Indian Statistical Institute, New Delhi ICRIER Conference on Telecom, March 7, 2014 Outline Outline Single Good Problem Outline Single Good Problem First Price Auction
More informationStrategy -1- Strategic equilibrium in auctions
Strategy -- Strategic equilibrium in auctions A. Sealed high-bid auction 2 B. Sealed high-bid auction: a general approach 6 C. Other auctions: revenue equivalence theorem 27 D. Reserve price in the sealed
More informationCountering the Winner s Curse: Optimal Auction Design in a Common Value Model
Countering the Winner s Curse: Optimal Auction Design in a Common Value Model Dirk Bergemann Benjamin Brooks Stephen Morris November 16, 2018 Abstract We characterize revenue maximizing mechanisms in a
More informationThe FedEx Problem (Working Paper)
The FedEx Problem (Working Paper) Amos Fiat Kira Goldner Anna R. Karlin Elias Koutsoupias June 6, 216 Remember that Time is Money Abstract Benjamin Franklin in Adice to a Young Tradesman (1748) Consider
More informationAll-Pay Auctions with Risk-Averse Players
All-Pay Auctions with Risk-Aerse Players Gadi Fibich Arieh Gaious Aner Sela December 17th, 2005 Abstract We study independent priate-alue all-pay auctions with risk-aerse players. We show that: 1) Players
More informationComparing Allocations under Asymmetric Information: Coase Theorem Revisited
Comparing Allocations under Asymmetric Information: Coase Theorem Revisited Shingo Ishiguro Graduate School of Economics, Osaka University 1-7 Machikaneyama, Toyonaka, Osaka 560-0043, Japan August 2002
More informationMicroeconomic Theory II Preliminary Examination Solutions
Microeconomic Theory II Preliminary Examination Solutions 1. (45 points) Consider the following normal form game played by Bruce and Sheila: L Sheila R T 1, 0 3, 3 Bruce M 1, x 0, 0 B 0, 0 4, 1 (a) Suppose
More informationOctober An Equilibrium of the First Price Sealed Bid Auction for an Arbitrary Distribution.
October 13..18.4 An Equilibrium of the First Price Sealed Bid Auction for an Arbitrary Distribution. We now assume that the reservation values of the bidders are independently and identically distributed
More informationColumbia University. Department of Economics Discussion Paper Series. Bidding With Securities: Comment. Yeon-Koo Che Jinwoo Kim
Columbia University Department of Economics Discussion Paper Series Bidding With Securities: Comment Yeon-Koo Che Jinwoo Kim Discussion Paper No.: 0809-10 Department of Economics Columbia University New
More informationPractice Problems. U(w, e) = p w e 2,
Practice Problems Information Economics (Ec 515) George Georgiadis Problem 1. Static Moral Hazard Consider an agency relationship in which the principal contracts with the agent. The monetary result of
More informationDay 3. Myerson: What s Optimal
Day 3. Myerson: What s Optimal 1 Recap Last time, we... Set up the Myerson auction environment: n risk-neutral bidders independent types t i F i with support [, b i ] and density f i residual valuation
More informationKIER DISCUSSION PAPER SERIES
KIER DISCUSSION PAPER SERIES KYOTO INSTITUTE OF ECONOMIC RESEARCH http://www.kier.kyoto-u.ac.jp/index.html Discussion Paper No. 657 The Buy Price in Auctions with Discrete Type Distributions Yusuke Inami
More informationAuctions. Michal Jakob Agent Technology Center, Dept. of Computer Science and Engineering, FEE, Czech Technical University
Auctions Michal Jakob Agent Technology Center, Dept. of Computer Science and Engineering, FEE, Czech Technical University AE4M36MAS Autumn 2014 - Lecture 12 Where are We? Agent architectures (inc. BDI
More informationAuctions. Michal Jakob Agent Technology Center, Dept. of Computer Science and Engineering, FEE, Czech Technical University
Auctions Michal Jakob Agent Technology Center, Dept. of Computer Science and Engineering, FEE, Czech Technical University AE4M36MAS Autumn 2015 - Lecture 12 Where are We? Agent architectures (inc. BDI
More informationTopics in Contract Theory Lecture 6. Separation of Ownership and Control
Leonardo Felli 16 January, 2002 Topics in Contract Theory Lecture 6 Separation of Ownership and Control The definition of ownership considered is limited to an environment in which the whole ownership
More informationTopics in Contract Theory Lecture 1
Leonardo Felli 7 January, 2002 Topics in Contract Theory Lecture 1 Contract Theory has become only recently a subfield of Economics. As the name suggest the main object of the analysis is a contract. Therefore
More informationOptimal Mixed Spectrum Auction
Optimal Mixed Spectrum Auction Alonso Silva Fernando Beltran Jean Walrand Electrical Engineering and Computer Sciences University of California at Berkeley Technical Report No. UCB/EECS-13-19 http://www.eecs.berkeley.edu/pubs/techrpts/13/eecs-13-19.html
More informationApril 29, X ( ) for all. Using to denote a true type and areport,let
April 29, 2015 "A Characterization of Efficient, Bayesian Incentive Compatible Mechanisms," by S. R. Williams. Economic Theory 14, 155-180 (1999). AcommonresultinBayesianmechanismdesignshowsthatexpostefficiency
More informationInformative advertising under duopoly
Informatie adertising under duopoly Scott McCracken June 6, 2011 Abstract We consider a two-stage duopoly model of costless adertising: in the first stage each firm simultaneously chooses the accuracy
More informationRevenue Equivalence and Mechanism Design
Equivalence and Design Daniel R. 1 1 Department of Economics University of Maryland, College Park. September 2017 / Econ415 IPV, Total Surplus Background the mechanism designer The fact that there are
More informationAll-pay auctions with risk-averse players
Int J Game Theory 2006) 34:583 599 DOI 10.1007/s00182-006-0034-5 ORIGINAL ARTICLE All-pay auctions with risk-aerse players Gadi Fibich Arieh Gaious Aner Sela Accepted: 28 August 2006 / Published online:
More informationGame Theory. Lecture Notes By Y. Narahari. Department of Computer Science and Automation Indian Institute of Science Bangalore, India July 2012
Game Theory Lecture Notes By Y. Narahari Department of Computer Science and Automation Indian Institute of Science Bangalore, India July 2012 The Revenue Equivalence Theorem Note: This is a only a draft
More informationAuctions. Agenda. Definition. Syllabus: Mansfield, chapter 15 Jehle, chapter 9
Auctions Syllabus: Mansfield, chapter 15 Jehle, chapter 9 1 Agenda Types of auctions Bidding behavior Buyer s maximization problem Seller s maximization problem Introducing risk aversion Winner s curse
More informationAuction is a commonly used way of allocating indivisible
Econ 221 Fall, 2018 Li, Hao UBC CHAPTER 16. BIDDING STRATEGY AND AUCTION DESIGN Auction is a commonly used way of allocating indivisible goods among interested buyers. Used cameras, Salvator Mundi, and
More informationRevenue Equivalence Theorem (RET)
Revenue Equivalence Theorem (RET) Definition Consider an auction mechanism in which, for n risk-neutral bidders, each has a privately know value drawn independently from a common, strictly increasing distribution.
More informationStrategy -1- Strategy
Strategy -- Strategy A Duopoly, Cournot equilibrium 2 B Mixed strategies: Rock, Scissors, Paper, Nash equilibrium 5 C Games with private information 8 D Additional exercises 24 25 pages Strategy -2- A
More informationCore Deviation Minimizing Auctions
Core Deviation Minimizing Auctions Isa E. Hafalir and Hadi Yektaş April 4, 014 Abstract In a stylized environment with complementary products, we study a class of dominant strategy implementable direct
More information6.254 : Game Theory with Engineering Applications Lecture 3: Strategic Form Games - Solution Concepts
6.254 : Game Theory with Engineering Applications Lecture 3: Strategic Form Games - Solution Concepts Asu Ozdaglar MIT February 9, 2010 1 Introduction Outline Review Examples of Pure Strategy Nash Equilibria
More informationMicroeconomic Theory (501b) Comprehensive Exam
Dirk Bergemann Department of Economics Yale University Microeconomic Theory (50b) Comprehensive Exam. (5) Consider a moral hazard model where a worker chooses an e ort level e [0; ]; and as a result, either
More informationPractice Problems 2: Asymmetric Information
Practice Problems 2: Asymmetric Information November 25, 2013 1 Single-Agent Problems 1. Nonlinear Pricing with Two Types Suppose a seller of wine faces two types of customers, θ 1 and θ 2, where θ 2 >
More informationCS599: Algorithm Design in Strategic Settings Fall 2012 Lecture 4: Prior-Free Single-Parameter Mechanism Design. Instructor: Shaddin Dughmi
CS599: Algorithm Design in Strategic Settings Fall 2012 Lecture 4: Prior-Free Single-Parameter Mechanism Design Instructor: Shaddin Dughmi Administrivia HW out, due Friday 10/5 Very hard (I think) Discuss
More informationAuctions 1: Common auctions & Revenue equivalence & Optimal mechanisms. 1 Notable features of auctions. use. A lot of varieties.
1 Notable features of auctions Ancient market mechanisms. use. A lot of varieties. Widespread in Auctions 1: Common auctions & Revenue equivalence & Optimal mechanisms Simple and transparent games (mechanisms).
More informationEconS Games with Incomplete Information II and Auction Theory
EconS 424 - Games with Incomplete Information II and Auction Theory Félix Muñoz-García Washington State University fmunoz@wsu.edu April 28, 2014 Félix Muñoz-García (WSU) EconS 424 - Recitation 9 April
More informationEcon 101A Final exam May 14, 2013.
Econ 101A Final exam May 14, 2013. Do not turn the page until instructed to. Do not forget to write Problems 1 in the first Blue Book and Problems 2, 3 and 4 in the second Blue Book. 1 Econ 101A Final
More informationMatching Markets and Google s Sponsored Search
Matching Markets and Google s Sponsored Search Part III: Dynamics Episode 9 Baochun Li Department of Electrical and Computer Engineering University of Toronto Matching Markets (Required reading: Chapter
More informationECON20710 Lecture Auction as a Bayesian Game
ECON7 Lecture Auction as a Bayesian Game Hanzhe Zhang Tuesday, November 3, Introduction Auction theory has been a particularly successful application of game theory ideas to the real world, with its uses
More informationHomework 3: Asymmetric Information
Homework 3: Asymmetric Information 1. Public Goods Provision A firm is considering building a public good (e.g. a swimming pool). There are n agents in the economy, each with IID private value θ i [0,
More informationRevenue Equivalence and Income Taxation
Journal of Economics and Finance Volume 24 Number 1 Spring 2000 Pages 56-63 Revenue Equivalence and Income Taxation Veronika Grimm and Ulrich Schmidt* Abstract This paper considers the classical independent
More informationAll Equilibrium Revenues in Buy Price Auctions
All Equilibrium Revenues in Buy Price Auctions Yusuke Inami Graduate School of Economics, Kyoto University This version: January 009 Abstract This note considers second-price, sealed-bid auctions with
More informationJanuary 26,
January 26, 2015 Exercise 9 7.c.1, 7.d.1, 7.d.2, 8.b.1, 8.b.2, 8.b.3, 8.b.4,8.b.5, 8.d.1, 8.d.2 Example 10 There are two divisions of a firm (1 and 2) that would benefit from a research project conducted
More informationLecture 5: Iterative Combinatorial Auctions
COMS 6998-3: Algorithmic Game Theory October 6, 2008 Lecture 5: Iterative Combinatorial Auctions Lecturer: Sébastien Lahaie Scribe: Sébastien Lahaie In this lecture we examine a procedure that generalizes
More informationUp till now, we ve mostly been analyzing auctions under the following assumptions:
Econ 805 Advanced Micro Theory I Dan Quint Fall 2007 Lecture 7 Sept 27 2007 Tuesday: Amit Gandhi on empirical auction stuff p till now, we ve mostly been analyzing auctions under the following assumptions:
More informationQuality Upgrades and (the Loss of) Market Power in a Dynamic Monopoly Model
Quality Upgrades and (the Loss of) Market Power in a Dynamic Monopoly Model James J. Anton Duke Uniersity Gary Biglaiser 1 Uniersity of North Carolina, Chapel Hill February 2007 PRELIMINARY- Comments Welcome
More informationCS 573: Algorithmic Game Theory Lecture date: March 26th, 2008
CS 573: Algorithmic Game Theory Lecture date: March 26th, 28 Instructor: Chandra Chekuri Scribe: Qi Li Contents Overview: Auctions in the Bayesian setting 1 1 Single item auction 1 1.1 Setting............................................
More informationUniversity of Michigan. July 1994
Preliminary Draft Generalized Vickrey Auctions by Jerey K. MacKie-Mason Hal R. Varian University of Michigan July 1994 Abstract. We describe a generalization of the Vickrey auction. Our mechanism extends
More informationEcon 101A Final exam May 14, 2013.
Econ 101A Final exam May 14, 2013. Do not turn the page until instructed to. Do not forget to write Problems 1 in the first Blue Book and Problems 2, 3 and 4 in the second Blue Book. 1 Econ 101A Final
More informationAuctions with Severely Bounded Communication
Journal of Artificial Intelligence Research 8 (007) 33 66 Submitted 05/06; published 3/07 Auctions with Severely Bounded Communication Liad Blumrosen Microsoft Research 065 La Avenida Mountain View, CA
More informationQuality, Upgrades and Equilibrium in a Dynamic Monopoly Market
Quality, Upgrades and Equilibrium in a Dynamic Monopoly Market James J. Anton and Gary Biglaiser August, 200 Abstract We examine an in nite horizon model of quality growth for a durable goods monopoly.
More informationECON 459 Game Theory. Lecture Notes Auctions. Luca Anderlini Spring 2017
ECON 459 Game Theory Lecture Notes Auctions Luca Anderlini Spring 2017 These notes have been used and commented on before. If you can still spot any errors or have any suggestions for improvement, please
More informationDissolving (In)effective Partnerships
Dissoling (In)effectie Partnerships John L. Turner March 2012 Abstract This paper studies the problem of partnership dissolution in the context of asymmetric information. Past work shows that the initial
More informationMicroeconomic Theory III Spring 2009
MIT OpenCourseWare http://ocw.mit.edu 14.123 Microeconomic Theory III Spring 2009 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. MIT 14.123 (2009) by
More informationAuctions. Microeconomics II. Auction Formats. Auction Formats. Many economic transactions are conducted through auctions treasury bills.
Auctions Microeconomics II Auctions Levent Koçkesen Koç University Many economic transactions are conducted through auctions treasury bills art work foreign exchange antiques publicly owned companies cars
More informationOn the Impossibility of Core-Selecting Auctions
On the Impossibility of Core-Selecting Auctions Jacob K. Goeree and Yuanchuan Lien November 10, 009 Abstract When goods are substitutes, the Vickrey auction produces efficient, core outcomes that yield
More informationParkes Mechanism Design 1. Mechanism Design I. David C. Parkes. Division of Engineering and Applied Science, Harvard University
Parkes Mechanism Design 1 Mechanism Design I David C. Parkes Division of Engineering and Applied Science, Harvard University CS 286r Spring 2003 Parkes Mechanism Design 2 Mechanism Design Central question:
More informationMicroeconomic Theory II Preliminary Examination Solutions Exam date: August 7, 2017
Microeconomic Theory II Preliminary Examination Solutions Exam date: August 7, 017 1. Sheila moves first and chooses either H or L. Bruce receives a signal, h or l, about Sheila s behavior. The distribution
More informationThe Myerson Satterthwaite Theorem. Game Theory Course: Jackson, Leyton-Brown & Shoham
Game Theory Course: Jackson, Leyton-Brown & Shoham Efficient Trade People have private information about the utilities for various exchanges of goods at various prices Can we design a mechanism that always
More informationHedonic Equilibrium. December 1, 2011
Hedonic Equilibrium December 1, 2011 Goods have characteristics Z R K sellers characteristics X R m buyers characteristics Y R n each seller produces one unit with some quality, each buyer wants to buy
More informationx. The saver is John Riley 7 December 2016 Econ 401a Final Examination Sketch of answers 1. Choice over time Then Adding,
John Riley 7 December 06 Econ 40a Final Eamination Sketch of answers Choice over time (a) y s, Adding, y ( r) s y s r r y y r r (b) The slope of the life-time budget line is r When r The initial optimum
More informationECO 426 (Market Design) - Lecture 8
ECO 426 (Market Design) - Lecture 8 Ettore Damiano November 23, 2015 Revenue equivalence Model: N bidders Bidder i has valuation v i Each v i is drawn independently from the same distribution F (e.g. U[0,
More informationECON Microeconomics II IRYNA DUDNYK. Auctions.
Auctions. What is an auction? When and whhy do we need auctions? Auction is a mechanism of allocating a particular object at a certain price. Allocating part concerns who will get the object and the price
More informationMeans of Payment and Timing of Mergers and Acquisitions in a Dynamic Economy
Means of Payment and Timing of Mergers and Acquisitions in a Dynamic Economy Alexander S. Gorbenko London Business School Andrey Malenko MIT Sloan School of Management This ersion: January 2014 We are
More informationAuctions Introduction
Auctions Introduction CPSC 532A Lecture 20 November 21, 2006 Auctions Introduction CPSC 532A Lecture 20, Slide 1 Lecture Overview 1 Recap 2 VCG caveats 3 Auctions 4 Standard auctions 5 More exotic auctions
More informationSocial Network Analysis
Lecture IV Auctions Kyumars Sheykh Esmaili Where Are Auctions Appropriate? Where sellers do not have a good estimate of the buyers true values for an item, and where buyers do not know each other s values
More informationMicroeconomic Theory II Preliminary Examination Solutions Exam date: June 5, 2017
Microeconomic Theory II Preliminary Examination Solutions Exam date: June 5, 07. (40 points) Consider a Cournot duopoly. The market price is given by q q, where q and q are the quantities of output produced
More informationOnline Appendix for "Optimal Liability when Consumers Mispredict Product Usage" by Andrzej Baniak and Peter Grajzl Appendix B
Online Appendix for "Optimal Liability when Consumers Mispredict Product Usage" by Andrzej Baniak and Peter Grajzl Appendix B In this appendix, we first characterize the negligence regime when the due
More informationChapter 3. Dynamic discrete games and auctions: an introduction
Chapter 3. Dynamic discrete games and auctions: an introduction Joan Llull Structural Micro. IDEA PhD Program I. Dynamic Discrete Games with Imperfect Information A. Motivating example: firm entry and
More informationTopics in Contract Theory Lecture 3
Leonardo Felli 9 January, 2002 Topics in Contract Theory Lecture 3 Consider now a different cause for the failure of the Coase Theorem: the presence of transaction costs. Of course for this to be an interesting
More informationAuction Theory - An Introduction
Auction Theory - An Introduction Felix Munoz-Garcia School of Economic Sciences Washington State University February 20, 2015 Introduction Auctions are a large part of the economic landscape: Since Babylon
More informationOptimal selling rules for repeated transactions.
Optimal selling rules for repeated transactions. Ilan Kremer and Andrzej Skrzypacz March 21, 2002 1 Introduction In many papers considering the sale of many objects in a sequence of auctions the seller
More information