Strategic Information Transmission

Slides:



Advertisements
Similar presentations
Advanced topics in Financial Econometrics Bas Werker Tilburg University, SAMSI fellow.
Advertisements

State Space Models. Let { x t :t T} and { y t :t T} denote two vector valued time series that satisfy the system of equations: y t = A t x t + v t (The.
6.853: Topics in Algorithmic Game Theory Fall 2011 Constantinos Daskalakis Lecture 16.
6.896: Topics in Algorithmic Game Theory Lecture 20 Yang Cai.
One-phase Solidification Problem: FEM approach via Parabolic Variational Inequalities Ali Etaati May 14 th 2008.
Mixed Strategies CMPT 882 Computational Game Theory Simon Fraser University Spring 2010 Instructor: Oliver Schulte.
COMP 553: Algorithmic Game Theory Fall 2014 Yang Cai Lecture 21.
ECO290E: Game Theory Lecture 5 Mixed Strategy Equilibrium.
How Bad is Selfish Routing? By Tim Roughgarden Eva Tardos Presented by Alex Kogan.
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.
Equilibrium Concepts in Two Player Games Kevin Byrnes Department of Applied Mathematics & Statistics.
6.896: Topics in Algorithmic Game Theory Lecture 15 Constantinos Daskalakis.
Non-cooperative Game Theory Notes by Alberto Bressan.
Rational Learning Leads to Nash Equilibrium Ehud Kalai and Ehud Lehrer Econometrica, Vol. 61 No. 5 (Sep 1993), Presented by Vincent Mak
Index FAQ Limits of Sequences of Real Numbers Sequences of Real Numbers Limits through Rigorous Definitions The Squeeze Theorem Using the Squeeze Theorem.
Auction Seminar Optimal Mechanism Presentation by: Alon Resler Supervised by: Amos Fiat.
Corporate Banking and Investment Risk tolerance and optimal portfolio choice Marek Musiela, BNP Paribas, London.
Nash equilibrium Nash equilibrium is defined in terms of strategies, not payoffs Every player is best responding simultaneously (everyone optimizes) This.
ECE 8443 – Pattern Recognition LECTURE 07: MAXIMUM LIKELIHOOD AND BAYESIAN ESTIMATION Objectives: Class-Conditional Density The Multivariate Case General.
Econ 805 Advanced Micro Theory 1 Dan Quint Fall 2007 Lecture 3 – Sept
Investment Performance Measurement, Risk Tolerance and Optimal Portfolio Choice Marek Musiela, BNP Paribas, London.
Contracting Under Imperfect Commitment PhD 279B December 3, 2007.
MAIN RESULT: We assume utility exhibits strategic complementarities. We show: Membership in larger k-core implies higher actions in equilibrium Higher.
EC941 - Game Theory Prof. Francesco Squintani Lecture 6 1.
5.1.Static Games of Incomplete Information
On the Difficulty of Achieving Equilibrium in Interactive POMDPs Prashant Doshi Dept. of Computer Science University of Georgia Athens, GA Twenty.
Security Markets V Miloslav S Vošvrda Theory of Capital Markets.
Comp/Math 553: Algorithmic Game Theory Lecture 11
A useful reduction (SAT -> game)
Information Design: A unified Perspective cn
Many Senders (part 3) L10.
Communication, Disclosure and Persuasion in Strategic Settings
Many Senders L8.
Information Design: Unobserved types
Comparative Cheap Talk
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)
The Curve Merger (Dvir & Widgerson, 2008)
Information Design: Unobserved types
Partly Verifiable Signals (c.n.)
Disclosure (Persuasion) games
Pragmatics of Persuasion
Partly Verifiable Signals (c.n.)
Today: basic Bayesian Persuasion
Multidimensional Cheap Talk
Toshiji Kawagoe Future University – Hakodate and Hirokazu Takizawa
Strategic Information Transmission
Controllability and Observability of Linear Dynamical Equations
Comparative Cheap Talk
Week 9 3. Applications of the LT to ODEs Theorem 1:
Linear Algebra Lecture 23.
Information Theoretical Analysis of Digital Watermarking
Bayes Nash Implementation
Presentation transcript:

Strategic Information Transmission Basic Cheap Talk L2 Strategic Information Transmission Crawford an Sobel (1982)

Road map Today We introduce a basic cheap talk game Fully characterize the set of PNB in terms of cutoffs Remarks: We will use alternative notation relative to the paper Use some more ``modern’’ arguments Next class: Derive equilibria in closed form in the quadratic model Compare them in terms of ex ante welfare (both S and R) Discuss some selection criteria

Cheap talk game Two agents: Sender (S) Receiver (R) Timing and actions: Sender observes state , sends message Receiver observes message , choses action Preferences: Prior distribution of types (uniform) Cheap talk (why?)

Preferences Assumptions: Useful facts: 1) Optimal action function is well defined and strictly monotone. 2) Suppose . Then (Topkis, Theorem 3.10.1)

Preferences 3) Let be such that. . Then 4) Increasing differences. Let . Then

PBN Equilibrium Sender Receiver beliefs strategy Equilibrium satisfies 1. 2. 3.

Simplifying observation R objective function is strictly concave – randomizing suboptimal Equilibrium satisfies 1. 2. 3.

Two (straightforward) observations Bubbling equilibrium exists for any preferences Assume no preference bias, . Fully revealing equilibrium exists. How about equilibrium with senders preference ares bias? In what follows we assume Useful fact 5:

Partition equilibrium (Definition) Cutoff vector partitions type space if Type induces action if D: PBN is a partition equilibrium if there exists a cutoff vector such that each type in induces unique action with probability one.

Partition equilibrium (Necessity) P: There exists such that any PBN equilibrium takes a form of a partition equilibrium with . cutoffs. Significance of this result: Any equilibrium at most partly revealing Any equilibrium defines a finite cutoff vector such that cutoff types are indifferent between neighbouring actions.

Step 1 Set of actions induced in equilibrium: Claim: There exists such that in any PBN cardinality of set is no grater than . Proof: Fix equilibrium and set

Step 1 (cd)

Step 1 (cd)

Step 2 Claim: There exists unique cutoff vector such that for each type induces action with probability one.

Sufficiency Let be a cutoff vector such that each cutsoff type is indifferent between neighboring actions P: There exists a partition equilibrium with the cutoff thresholds .

Main theorem T: Set of all PNB equilibria is fully characterized by the set of solutions to the difference equation Observations: Second order non-linear difference equation If it has a solution with N cutoffs, then it also has a solution with N-1 Some equilibria are better in than others in terms of welfare Within a quadratic setting equilibria can be derived in closed form