Intro to Information Design (and some Basic Bayesian Persuasion)

Slides:



Advertisements
Similar presentations
Chapter 17: Making Complex Decisions April 1, 2004.
Advertisements

6.896: Topics in Algorithmic Game Theory Lecture 20 Yang Cai.
1 University of Southern California Keep the Adversary Guessing: Agent Security by Policy Randomization Praveen Paruchuri University of Southern California.
Joint Strategy Fictitious Play Sherwin Doroudi. “Adapted” from J. R. Marden, G. Arslan, J. S. Shamma, “Joint strategy fictitious play with inertia for.
1 Regret-based Incremental Partial Revelation Mechanism Design Nathanaël Hyafil, Craig Boutilier AAAI 2006 Department of Computer Science University of.
Imperfect commitment Santiago Truffa. Agenda 1.“Authority and communication in Organizations” Wouter Dessein, RES “Contracting for information.
Adverse Selection Asymmetric information is feature of many markets
Extensive Game with Imperfect Information III. Topic One: Costly Signaling Game.
Extensive Game with Imperfect Information Part I: Strategy and Nash equilibrium.
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.
Mechanisms for Making Crowds Truthful Andrew Mao, Sergiy Nesterko.
Automated Design of Multistage Mechanisms Tuomas Sandholm (Carnegie Mellon) Vincent Conitzer (Carnegie Mellon) Craig Boutilier (Toronto)
Game-theoretic analysis tools Tuomas Sandholm Professor Computer Science Department Carnegie Mellon University.
1 Model 3 (Strategic informed trader) Kyle (Econometrica 1985) The economy A group of three agents trades a risky asset for a risk-less asset. One insider.
Mechanism design. Goal of mechanism design Implementing a social choice function f(u 1, …, u |A| ) using a game Center = “auctioneer” does not know the.
Regret Minimizing Equilibria of Games with Strict Type Uncertainty Stony Brook Conference on Game Theory Nathanaël Hyafil and Craig Boutilier Department.
Automated Mechanism Design Tuomas Sandholm Presented by Dimitri Mostinski November 17, 2004.
ECO290E: Game Theory Lecture 13 Dynamic Games of Incomplete Information.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Competitive Scheduling in Wireless Networks with Correlated Channel State Ozan.
Enrica Carbone (UniBA) Giovanni Ponti (UA- UniFE) ESA-Luiss–30/6/2007 Positional Learning with Noise.
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.
Coordination and Learning in Dynamic Global Games: Experimental Evidence Olga Shurchkov MIT The Economic Science Association World Meeting 2007.
Bayesian Algorithmic Mechanism Design Jason Hartline Northwestern University Brendan Lucier University of Toronto.
Game Theory Georg Groh, WS 08/09 Verteiltes Problemlösen.
Risk Aversion and Optimal Reserve Prices in First and Second-Price Auctions Audrey Hu University of Amsterdam Stephen A. Matthews University of Pennsylvania.
Comp/Math 553: Algorithmic Game Theory Lecture 11
Information Design: A unified Perspective cn
Many Senders (part 3) L10.
Keep the Adversary Guessing: Agent Security by Policy Randomization
Communication, Disclosure and Persuasion in Strategic Settings
Carnegie Mellon University
Many Senders L8.
Information Design: Unobserved types
Comparative Cheap Talk
Multidimensional Cheap Talk (Quasiconvex preferences)
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
Econ 805 Advanced Micro Theory 1
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
Information Design: Unobserved types
Partly Verifiable Signals (c.n.)
Disclosure (Persuasion) games
Pragmatics of Persuasion
Partly Verifiable Signals (c.n.)
Today: basic Bayesian Persuasion
Strategic Information Transmission
Robust Mechanism Design with Correlated Distributions
Miguel A. Sanchez Villalba October 2004
Multidimensional Cheap Talk
Toshiji Kawagoe Future University – Hakodate and Hirokazu Takizawa
Equlibrium Selection in Stochastic Games
Strategic Information Transmission
Comparative Cheap Talk
Game Theory Solutions 1 Find the saddle point for the game having the following payoff table. Use the minimax criterion to find the best strategy for.
Bayes Nash Implementation
Information, Incentives, and Mechanism Design
Auction Theory תכנון מכרזים ומכירות פומביות
Presentation transcript:

Intro to Information Design (and some Basic Bayesian Persuasion) L7

General information Design Two agents: Sender (S) (designer) and Receivers (R) Type space Action space. . Message space Preferences S message strategy Relative to cheap talk: S commits to information structure objective: ex ante welfare of S Players (R), strategies and payoffs, along with define Bayesian game Each BN equilibrium generates unique decision rule Let be a set of equilibrium decision rules in game Solution concept

Remarks Problem can be easily accommodated Adversarial (robust) approach Harder, no revelation principle Gains popularity recently Alternative: receivers with private information Bayesian persuasion problem is a (very) special case One receiver Max max criterion S no private information Type independent preferences of S

Big picture Cheap talk: no commitment power, S and R maximizes ex post welfare Mechanism design (Arbitration) Single receiver (designer), potentially many senders Commitment by R R maximizes ex ante welfare, S welfare ex post Information design (Bayesian Persuasion) Single sender, potentially many receivers Commitment by S S maximizes ex ante welfare, R welfare ex post (with respect to posterior) General mechanism design (Myerson 82)

Senders commitment Sender ex ante commits to message strategy, maximizes ex ante welfare Literal information designer (KG 2011): Legal mandate (a prosecutor and a judge) Coarse grading policies Rating agencies Public tests of the products (medical drug trials) Metaphorical information designer Minimal revenue in auctions (BBM 2017) Maximal volatility of aggregate output (BHM 2017) Welfare outcomes (BBM 2017)

Main lessons Substantive Insights : Conditions for (full or partial) information transmission Obfuscation of information (outcome manipulation) Less power to manipulate if R more informed (more precise prior) Many R: Private vs public signals Technical insights: Concavification of value function Two stage procedure (feasible outcome =correlated equilibrium)

Information Design Literature Discussed papers: Kamienica and Genzkow (AER 2011) Bergmann and Morris (2017) Genzkow and Kamienica (REStud 2017) Other important papers: Bergmann and Morris (ECMA 2013, TE 2016) Mathavet Perego and Taneva (2016) Bergmann Heumann and Morris (JET 2015) Bergmann, Brooks, and Morris (2017) Kolotlin, Mylovanov and Zapechelnyuk (2015)

Dynamic Information Design Papers: Ely (AER 2017) Ely Frankel and Kamienica (JPE 2015) Doval and Ely (2016)

Bayesian persuasion Two agents: Sender (S) and Receiver (R) Type space Action space . Message space Preferences Timing (1) S commits to experiment (2) S observes type, sends message according to distribution (3) R observes message choses action Let Solution: strategy

Example 1: Persuasion in a quadratic model State space Preferences: Fix Best response of R Ex ante welfare of S Optimal persuasion rule:

Example 1: Persuasion in a quadratic model Relative to cheap talk: - No multiplicity of equilibria - S could commit to ``bubbling’’ but in this example it is suboptimal Relative to Arbitration (Mechanism Design) - Commitment benefits more the side that cannot commit Problem more interesting with type independent preferences of S

Example 2: KG example Story: prosecutor S and judge R Binary model Preferences Cheap talk prediction?

Beliefs and expected utility of S Fix R beliefs over types Expected R utility given beliefs R best response given Expected utility as a function of beliefs (no persuasion) Think of S as manipulating ex post beliefs

Example 2: KG example Value function

Information structures Value function

Information structures Value function