Contracting Under Imperfect Commitment PhD 279B December 3, 2007.

Slides:



Advertisements
Similar presentations
Comparative Cheap Talk Archishman Chakraborty and Rick Harbaugh JET, forthcoming.
Advertisements

(Single-item) auctions Vincent Conitzer v() = $5 v() = $3.
6.896: Topics in Algorithmic Game Theory Lecture 20 Yang Cai.
Auction Theory Class 5 – single-parameter implementation and risk aversion 1.
CPS Bayesian games and their use in auctions Vincent Conitzer
ECON 100 Tutorial: Week 9 office: LUMS C85.
Michael R. Baye, Managerial Economics and Business Strategy, 3e. ©The McGraw-Hill Companies, Inc., 1999 Managerial Economics & Business Strategy Chapter.
Multi-item auctions with identical items limited supply: M items (M smaller than number of bidders, n). Three possible bidder types: –Unit-demand bidders.
Game Theory in Wireless and Communication Networks: Theory, Models, and Applications Lecture 6 Auction Theory Zhu Han, Dusit Niyato, Walid Saad, Tamer.
Auction. Types of Auction  Open outcry English (ascending) auction Dutch (descending) auction  Sealed bid First-price Second-price (Vickrey)  Equivalence.
Private-value auctions: theory and experimental evidence (Part I) Nikos Nikiforakis The University of Melbourne.
Optimal auction design Roger Myerson Mathematics of Operations research 1981.
1. 2 Strategic Information Transmission A sender observes the true state t in y[0, 1] t is uniformly distributed The sender reports r to the receiver.
Imperfect commitment Santiago Truffa. Agenda 1.“Authority and communication in Organizations” Wouter Dessein, RES “Contracting for information.
Bundling Equilibrium in Combinatorial Auctions Written by: Presented by: Ron Holzman Rica Gonen Noa Kfir-Dahav Dov Monderer Moshe Tennenholtz.
Adverse Selection Asymmetric information is feature of many markets
A camper awakens to the growl of a hungry bear and sees his friend putting on a pair of running shoes, “You can’t outrun a bear,” scoffs the camper. His.
Lecture 4 on Individual Optimization Risk Aversion
Week 10 1 COS 444 Internet Auctions: Theory and Practice Spring 2008 Ken Steiglitz
Incomplete Contracts Renegotiation, Communications and Theory December 10, 2007.
Extensive Game with Imperfect Information III. Topic One: Costly Signaling Game.
Extensive Game with Imperfect Information Part I: Strategy and Nash equilibrium.
Competitive Analysis of Incentive Compatible On-Line Auctions Ron Lavi and Noam Nisan SISL/IST, Cal-Tech Hebrew University.
EC941 - Game Theory Francesco Squintani Lecture 3 1.
Yang Cai Sep 15, An overview of today’s class Myerson’s Lemma (cont’d) Application of Myerson’s Lemma Revelation Principle Intro to Revenue Maximization.
Communication Networks A Second Course Jean Walrand Department of EECS University of California at Berkeley.
Static Games of Incomplete Information.. Mechanism design Typically a 3-step game of incomplete info Step 1: Principal designs mechanism/contract Step.
Chapter 19 Equivalence Types of Auctions Strategic Equivalence
Auction Theory Class 2 – Revenue equivalence 1. This class: revenue Revenue in auctions – Connection to order statistics The revelation principle The.
ECON 6012 Cost Benefit Analysis Memorial University of Newfoundland
CPS 173 Mechanism design Vincent Conitzer
© 2009 Institute of Information Management National Chiao Tung University Lecture Note II-3 Static Games of Incomplete Information Static Bayesian Game.
Sequences of Take-It-or-Leave-it Offers: Near-Optimal Auctions Without Full Valuation Revelation Tuomas Sandholm and Andrew Gilpin Carnegie Mellon University.
Auction Seminar Optimal Mechanism Presentation by: Alon Resler Supervised by: Amos Fiat.
EC941 - Game Theory Prof. Francesco Squintani Lecture 5 1.
Combinatorial Auctions By: Shai Roitman
More on Social choice and implementations 1 TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AAA A Using slides by Uri.
6.853: Topics in Algorithmic Game Theory Fall 2011 Constantinos Daskalakis Lecture 21.
Mechanism Design CS 886 Electronic Market Design University of Waterloo.
Auction Theory תכנון מכרזים ומכירות פומביות Topic 7 – VCG mechanisms 1.
Yang Cai Oct 08, An overview of today’s class Basic LP Formulation for Multiple Bidders Succinct LP: Reduced Form of an Auction The Structure of.
Topic 2: Designing the “optimal auction” Reminder of previous classes: Discussed 1st price and 2nd price auctions. Found equilibrium strategies. Saw that.
Optimal mechanisms (part 2) seminar in auctions & mechanism design Presentor : orel levy.
Extensive Games with Imperfect Information
Decision theory under uncertainty
Mechanism Design II CS 886:Electronic Market Design Sept 27, 2004.
Auctions serve the dual purpose of eliciting preferences and allocating resources between competing uses. A less fundamental but more practical reason.
Introduction Many organizations use decision rules to alleviate incentive problems as opposed to incentive contracts The principal typically retains some.
6.853: Topics in Algorithmic Game Theory Fall 2011 Constantinos Daskalakis Lecture 22.
Auctions serve the dual purpose of eliciting preferences and allocating resources between competing uses. A less fundamental but more practical reason.
EC941 - Game Theory Prof. Francesco Squintani Lecture 6 1.
Journal of Economic Behavior and Organization Presented by: Kuan Chen.
Bayesian Algorithmic Mechanism Design Jason Hartline Northwestern University Brendan Lucier University of Toronto.
Dynamic Game Theory and the Stackelberg Model. Dynamic Game Theory So far we have focused on static games. However, for many important economic applications.
Advanced Subjects in GT Prepared by Rina Talisman Introduction Revenue Equivalence The Optimal Auction (Myerson 1981) Auctions.
The political economy of government debt Advanced Political Economics Fall 2011 Riccardo Puglisi.
Lecture 4 on Auctions Multiunit Auctions We begin this lecture by comparing auctions with monopolies. We then discuss different pricing schemes for selling.
Many Senders L8.
Arbitration and Mediation
Information Design: A unified Perspective Prior information
Arbitration and Mediation
Information Design: A unified Perspective
Strategic Information Transmission
Many Senders L8 Gilligan and Khrehbiel (AJPS 1989)
Many Senders (part 2) L9.
Intro to Information Design (and some Basic Bayesian Persuasion)
Strategic Information Transmission
Multidimensional Cheap Talk
Comparative Cheap Talk
Presentation transcript:

Contracting Under Imperfect Commitment PhD 279B December 3, 2007

Agenda – Selected Main Results 1. Authority and Communication in Organizations (Dessein, 2002) 2. Contracting for Information under Imperfect Commitment (Krishna and Morgan, February 2006 working paper)

Dessein’s Assumptions Starts with Crawford-Sobel (1982) model  m=state of nature or private information /type only known to sender – uniformly distributed  b = bias between preferences of Receiver and Sender  y = project / output chosen by Receiver (function of m) Looks at communication in a principal-agent setting Assumes bias systematic and predictable: b>0 Imperfect contracting approach: Projects cannot be contracted upon, but the principal can commit to never overruling agent by delegating to agent control over the critical resources (using contracts, job descriptions, company charters, sale of assets, etc.) Principal precommits to delegate or communicate Dessein, 2002

Principal’s Key Tradeoffs Utility tradeoff between loss of control when principal delegates authority and loss of information when principal and agent communicate Expected cost of loss of control is the bias, b Expected cost of loss of information under communication is the difference between the state of the world and the principal’s belief about the state of the world after receiving the message Dessein, 2002 m Delegate? Agent Implements yn yn Agent Implements

From CS, a message is a partition Figure 1 Lemma 1: The size of a partition element is always 4b larger than the size of the preceding one a 2 -a 1 =a 1 -a 0 +4b Proof  y 1 =(a 0 +a 1 )/2 and y 2 =(a 1 +a 2 )/2  At dividing point m=a 1 agent is indifferent between y 1 and y 2  Thus, a 1 = (y 1 + y 2 )/2 – b  (y 1 + y 2 )/2 = a 1 + b  y 1 + y 2 = 2(a 1 + b)  (a 0 +a 1 )/2 + (a 1 +a 2 )/2= 2(a 1 + b)  a 0 +2a 1 +a 2 = 4(a 1 + b)  a 2 -a 1 =a 1 -a 0 +4b QED Dessein, 2002 a2a2

Why does partition size matter? N(b)=number of partitions Good communication requires lots of partition elements. Bias gets smaller faster as N(b) grows. Thus, the average size of the partition element will be very large relative to the bias b For what N(b) is communication informative? When N(b)>3, A(b)>4b and When N(b)=2,  Principal chooses y*= a 0 +(a 1 -a 0 )/2 if m(a 0,a 1 )  Principal chooses y*= a 1 +(a 1 -a 0 )/2 +2b if m(a 0,a 1 )  and

Delegation is superior when communication is feasible (and b is small) Intuition from prior slide: N(b)>2 implies communication feasible but also that information loss exceeds bias Proposition 2: If F(m) is uniformly distributed over [-L,L], the principal prefers delegation to communication whenever b is such that informative communication is feasible Dessein, 2002

Also, compare utility of communication vs. delegation Principal’s expected utility under communication Find N that maximizes EU p For N>2, EU p <-b 2 Principal’s expected utility under delegation U(y,m)=-(y-m) 2 If delegating, E(U)=∫-(m+b-m) 2 =-b 2 Dessein, 2002

What happens when the bias is large? Informative communication is not possible Specifically, when b> ¼, N(b)=1 The agent does not communicate The principal optimally takes an uninformed decision Dessein, 2002 and Krishna and Morgan, 2004

Empirical Tests? See “The Flattening Firm: Evidence from Panel Data on the Changing Nature of Corporate Hierarchies” (Rajan and Wulf, 2006)  300 companies  10 years data

Critique of Dessein Omits issues of imperfect commitment: principal is assumed to be able to commit not to intervene in the project chosen by the agent (Krishna and Morgan, 2004) (Note: Dessein suggests intermediary as a commitment device)

Krishna and Morgan presentation overview Main results we will cover under imperfect commitment  Full revelation contracts are always feasible (Prop 3)  Full revelation contracts are never optimal (Prop 4) General compare and contrast to perfect commitment

Why care about imperfect commitment? Perfect commitment almost never exists in the real world  Principals often retain the value to exercise their discretion, regardless of the agent’s message e.g. CEOs and investment bankers

How Krishna and Morgan explore imperfect commitment Perfect commitment has been a critical assumption in mechanism design because it allows us to use the standard revelation principle However, under imperfect commitment, if agents reveal truthfully, principals are free to use the information to their own advantage. Knowing this, agents will generally be better off not revealing the whole truth In imperfect commitment, Krishna and Morgan assume the set of types Θ is a continuum, and derive a partial version of the revelation principle to get their results

Why the Revelation Principle matters Two reasons we use the revelation principle  Restrict attention to direct mechanisms  Allows us to only consider truth-telling equilibria Two major weaknesses of the revelation principle  Assumes players commit to their strategies  Assumes Θ is static

Prop 3: Under imperfect commitment, full revelation contracts are always feasible If truth-telling is the best response for the agent, then the following must be true Take the first order condition: Agent gives truthful message: Agent’s utilityTransfer

Prop 3 Proof (cont’d) First order condition We know the following: So, all full revelation contracts are downward sloping The least-cost full revelation contract is

Prop 3 Proof (cont’d) Intuition is that transfers can be used to get truth-telling Main idea of the proof of Prop 3: There exists some amount you can pay the agent to get him to tell the truth θ axis θ Transfer to agent to get truth 1 Stylized illustration:

Prop 3 Proof (cont’d) As θ goes to 1, the transfers needed to get truth-telling get smaller As θ goes to 0, the transfers needed to get truth-telling get larger θ axis θ Transfer to agent to get truth x*(θ) 1

Proposition 4 Under imperfect commitment full revelation contracts are never optimal.  A graphic example of the uniform quadratic  Proof

An Example: Uniform Quadratic b=.2 E[x]=-.2 x(θ) θ

An Example: Uniform Quadratic b=.2 E[x]=-.2 E[U]=-.2 x(θ) & Utils θ

An Example: Uniform Quadratic b=.2 E[x]=-.2 E[U]=-.2 z=.8 x z =.03 E[x z ]=-.158 x(θ) & Utils θ

An Example: Uniform Quadratic b=.2 E[x]=-.2 E[U]=-.2 z=.8 x z =.03 E[x z ]=-.158 E[U z ]~-.152 x(θ) & Utils θ

An Example: Uniform Quadratic x(θ) & Utils θ b=.2 E[x]=-.2 E[U]=-.2 z=.8 x z =.03 E[x z ]=-.158 E[U z ]~-.152

Proof: Part 1 - Feasible Contract Agent’s utility of project z Transfer from message z Agent’s Utility of pooling project. x(θ) that reveals θ when θ is in [0,z] z<1 and pools for θ in [z,1]. Let x z be the payment when θ=z For indifference at θ=z we need: Where: Given θ in [z,1] is the project selected from the pooling message By taking z close to 1, so x z >0 Like the full revelation contract, Incentive compatibility over θ in [0,z] requires: which is positive, so this contract is feasible.

So the proposed contract is feasible, but is it better than full revelation? The principal’s utility from this contract is: When z=1, this becomes the full revelation contract, so we’ll check if some z<1 is better than z=1 by taking the derivative of V and evaluating at 1. If the slope is negative the EU(z=1-ε)>EU(z=1) Proof: Part 2 – Principal’sUtility From revealed state less transfer From pooling information and no transfer.

Proof: Part 3 - Lots of Math Evaluating at z=1 Since the derivative is negative. So, at z slightly less than 1, Utility is higher than at z=1. Substituting in x(θ) and evaluating the derivative Since f(1)=0 and ∫ 1 0 _ f(θ)dθ=1 Substituting in x z and evaluating the derivative at z=1

Additional results for the uniform quadratic The optimal contract is full revelation below some α in [0,1), and pooling (like C.S.) to the right of α. In the optimal contract, the principal never pays a transfer for pooling messages (imprecise information).

Perfect commitment Perfect commitment allows the principal to commit to both transfers x and projects y Similarities with imperfect commitment  Full revelation is also feasible but NOT optimal  In optimal contracts, principal does not pay for imprecise information Differences with imperfect commitment  In some states, a compromise project is selected (between θ and θ+b)

Summary Full revelation contracts are always feasible (Prop 3) Full revelation contracts are never optimal (Prop 4) In an optimal contract under imperfect information, principal never pays for imprecise information (Prop 6) Perfect commitment results  Full revelation is also feasible and not optimal, principal does not pay for imprecise information  In some states, a compromise project is selected

Appendix

Informative communication (cont’d) Informative communication is feasible when b<b’, given by Dessein, 2002

Dessein: See paper for additional results TopicDessein’s Insight Amount of private information Delegation is more likely when the amount of private information of the agent is large Risk aversionThe more concave her utility function, the more attractive is the constant bias under delegation Generalization to other distributions For small or moderate biases, result generalizes to any distribution; for large bias, delegation inferior Value of an intermediary For moderate biases, the principal optimally delegates decision rights to an intermediary Delegation with veto power Cites political science paper by Gilligan and Krehbiel, House of Representatives can’t amend committee proposal under closed rule). Keeping a veto- right typically reduces the expected utility of the principal unless the incentive conflict is extreme

Crawford-Sobel Model (Cheap Talk) Assumptions:  = state of nature / world (the information) or private information /type only known to sender – uniformly distributed  b = bias between preferences of Receiver and Sender (b assumed > 0)  y = project / output chosen by Receiver (function of ) “Strategic Information Transmission” (Crawford and Sobel, 1982) and summary of Crawford and Sobel (Krishna and Morgan, 2004) message

Crawford-Sobel Utility (cont’d) Payoffs: quadratic loss functions Receiver’s payoff (b=0)Sender’s payoff b +b y Utility “Strategic Information Transmission” (Crawford and Sobel, 1982) and summary of Crawford and Sobel (Krishna and Morgan, 2004)

Revenue Equivalence Theorem Assumptions (i) each of a given number of risk-neutral potential buyers has a privately- known valuation independently drawn from a strictly-increasing atomless distribution (ii) No buyer wants more than one of the k identical indivisible prizes. Any mechanism in which (i) the prizes always go to the k buyers with the highest valuations and (ii) any bidder with the lowest feasible valuation expects zero surplus yields the same expected revenue (and results in each bidder making the same expected payment as a function of her valuation) Klemperer, 2003

Crawford-Sobel Result Preference divergence (b>0) leads to withholding of information by the sender (loss of information disappears when preferences are congruent b=0) Positive integer N(b) is the upper bound on the “size” (# of subintervals) of an equilibrium partition; there exists at least one equilibrium of each size from 1 through N(b) Of multiple equilibria, pareto-superior equilibrium (better communication) is that which has the largest number, N(b), of partition elements Strategic Information Transmission (Crawford and Sobel, 1982) and summary of Crawford and Sobel (Dessein, 2002)

Revelation Principle Assumptions For any Bayesian Nash equilibrium of a game of incomplete information There exists an associated revelation mechanism that has an equilibrium where the players truthfully report their types or [private values]. Wikipedia.org