Comparative Cheap Talk

Slides:



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

6.853: Topics in Algorithmic Game Theory Fall 2011 Constantinos Daskalakis Lecture 16.
6.896: Topics in Algorithmic Game Theory Lecture 20 Yang Cai.
Chapter 3 Preferences Choose the “best” thing one can “afford” Start with consumption bundles (a complete list of the goods that is involved in consumer’s.
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.
6.896: Topics in Algorithmic Game Theory Lecture 15 Constantinos Daskalakis.
Oligopoly Theory (5) First-Mover and Second-Mover Advantage
Bargaining with uncertain commitment: An agreement theorem
6.853: Topics in Algorithmic Game Theory Fall 2011 Constantinos Daskalakis Lecture 21.
INFORMATION ASYMMETRIES IN COMMON VALUE AUCTIONS WITH DISCRETE SIGNALS Vasilis Syrgkanis Microsoft Research, NYC Joint with David Kempe, USC Eva Tardos,
Contracting Under Imperfect Commitment PhD 279B December 3, 2007.
6.853: Topics in Algorithmic Game Theory Fall 2011 Constantinos Daskalakis Lecture 22.
Session 3 Review Distributions Pen’s parade, quantile function, cdf Size, spread, poverty Data Income vector, cdf Today Inequality and economics Welfare.
MAIN RESULT: We assume utility exhibits strategic complementarities. We show: Membership in larger k-core implies higher actions in equilibrium Higher.
Empirical Aspects of Plurality Elections David R. M. Thompson, Omer Lev, Kevin Leyton-Brown & Jeffrey S. Rosenschein COMSOC 2012 Kraków, Poland.
1 TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A AAA A AA A.
Comp/Math 553: Algorithmic Game Theory Lecture 11
Information Design: A unified Perspective cn
Many Senders (part 3) L10.
Communication, Disclosure and Persuasion in Strategic Settings
L02 Preferences.
Many Senders L8.
Information Design: Unobserved types
Multidimensional Cheap Talk (Quasiconvex preferences)
What properties would we expect preferences to exhibit?
Communication and Information Design
Arbitration and Mediation
Information Design: A unified Perspective
Information Design: A unified Perspective Prior information
Arbitration and Mediation
Partly Verifiable Signals
Information Design: A unified Perspective
Strategic Information Transmission
Many Senders L8 Gilligan and Khrehbiel (AJPS 1989)
Many Senders (part 2) L9.
Competition in Persuasion
Basic Cheap Talk (Welfare)
Strategic Information Transmission
Kamienica and Genzkow (AER 2011)
Bayesian Persuasion cn
Intro to Information Design (and some Basic Bayesian Persuasion)
General Equilibrium (Social Efficiency)
Information Design: Unobserved types
Partly Verifiable Signals (c.n.)
Lecture 6 Efficiency of Algorithms (2) (S&G, ch.3)
Disclosure (Persuasion) games
Pragmatics of Persuasion
Partly Verifiable Signals (c.n.)
Today: basic Bayesian Persuasion
Strategic Information Transmission
L02 Preferences.
Multidimensional Cheap Talk
Strategic Information Transmission
The Right of First Offer
General Equilibrium (Social Efficiency)
Chapter 3 Preferences Key Concept: characterize preferences by a binary comparison measuring at least as good as. Derive the indifference curves for a.
Comparative Cheap Talk
General Equilibrium (Social Efficiency)
General Equilibrium (Social Efficiency)
The Public Goods Environment
L02 Preferences.
L02 Preferences.
Where real stuff starts
L02 Preferences.
Implementation in Bayes-Nash equilibrium
Econ 805 Advanced Micro Theory 1
Bayes Nash Implementation
Normal Form (Matrix) Games
Information, Incentives, and Mechanism Design
Presentation transcript:

Comparative Cheap Talk Comparative cheap talk (JET 2007) Persuasion by Cheap Talk (AER 2010) Chakraborty an Harbaugh

Multidimensional Cheap Talk Two agents: Sender (S) and Receiver (R) Timing and actions: for each k=1,….K Sender observes state , sends message Receiver observes message , choses action Each issue k=1,…K is symmetric in terms of R and S (additive) preferences type distribution Important classes of preferences:

Previous lecture We assumed K=2, We have focused on ``ranking’’ equilibria, R-messages Type independent preferences of S Revealing R-messages is (weakly) incentive compatible Ranking equilibrium is partly informative, influential R-equilibrium dominates B-equilibirum if quasiconvex Type dependent (supermodual) preferences of S and R Revealing R-messages is (strictly) incentive compatible R-equilibrium may dominate B-equilibirum even with quasiconcave

Today Many symmetric issues K>2, Limit of complete ranking equilibrium as K Partial rankings (sender welfare non-monotonic) Asymmetric issues (biases) Small asymmetries (strict supermodularity) Non-existence of R equilibrium with large asymmetries Existence of incentive compatible type partitions (not R partitions) Next lecture: 4 applications

K issues K! number of distinct rankings (permutations) for K=5 this number is 120 for K=10 this number is 3628800 Type independent utility of S indifference curve is a K-1 dimensional manifold For each individual issue ranking more informative for higher K

Limit K be a c.d.f over types For each issue type. i.i.d P: Ex ante (per issue) welfare of S (R) asymptotically converges to fully informative one as

Heuristic argument

Quadratic CS model Preferences (Best) partition equilibrium versus (best) relative cheap talk equilbirium Ex ante welfare of S (welfare =R –b^2)

Partial Rankings Coarse equivalent classes (top ten students in a class) Complete ranking and bubbling are two extremes Partial rankings induce (first order) ranked posteriors, each for one class Sender’s welfare need not be monotone in completeness of a ranking

Example: Recommendation game Players: S: professor with 3 students each with quality , Message space =rankings R: future employer, binary action hire, not hire) Preferences Equilibria with (complete or partial) rankings exist

Example: Recommendation game Bubbling equilibrium Complete ranking equilibrium Partial rankings (my top 2 students are …)

Asymmetric issues Asymmetries - types are drawn from different distributions - sender may have stronger preferences for some issues - receiver may have biases too Asymmetries are common

Problem issues (uniform distribution), receiver Asymmetric S preferences Incentives to misreport 2 alternative solutions

Solution 1 Strict supermodularity of preferences Strict incentives to reveal rankings in symmetric setting R equilibrium exist with sufficiently small perturbations Levy and Razin (ECMA 2007) – non-existence of R equilibrium with large assymetries

Solution 2 (idea) Persuasion by Cheap Talk (AER 2010)

Problem issues (uniform distribution), receiver Asymmetric S preferences Exists partition for which expected values fall on the same indifference curve 2 alternative solutions

General argument compact and convex, absolutely continuous, full support R preferences S preferences, type independent, continuous

Arbitrary fine partitions (linear S utility) Argument extends for strictly quasivonvex preferences