Kamienica and Genzkow (AER 2011)

Slides:



Advertisements
Similar presentations
6.896: Topics in Algorithmic Game Theory Lecture 20 Yang Cai.
Advertisements

CHAPTER 8 More About Estimation. 8.1 Bayesian Estimation In this chapter we introduce the concepts related to estimation and begin this by considering.
Bayesian inference “Very much lies in the posterior distribution” Bayesian definition of sufficiency: A statistic T (x 1, …, x n ) is sufficient for 
Imperfect commitment Santiago Truffa. Agenda 1.“Authority and communication in Organizations” Wouter Dessein, RES “Contracting for information.
An Introduction to Variational Methods for Graphical Models.
Ai in game programming it university of copenhagen Statistical Learning Methods Marco Loog.
Visual Recognition Tutorial
Mechanism Design. Overview Incentives in teams (T. Groves (1973)) Algorithmic mechanism design (Nisan and Ronen (2000)) - Shortest Path - Task Scheduling.
. PGM: Tirgul 10 Parameter Learning and Priors. 2 Why learning? Knowledge acquisition bottleneck u Knowledge acquisition is an expensive process u Often.
Probabilistic Robotics Introduction Probabilities Bayes rule Bayes filters.
Adverse Selection & Renegotiation in Procurement (The Review of Economic Studies 1990) work of: Jean-Jacques Laffont & Jean Tirole presented by: Deepak.
0 Wireless Foundations 0July 7, 2004 Distributed Optimization of Power Allocation in Interference Channel Raul Etkin, Abhay Parekh, and David Tse Spectrum.
Asaf Cohen Department of Mathematics University of Michigan Financial Mathematics Seminar University of Michigan September 10,
Statistical Decision Theory
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.
Bayesian Networks Martin Bachler MLA - VO
EE 685 presentation Utility-Optimal Random-Access Control By Jang-Won Lee, Mung Chiang and A. Robert Calderbank.
Week 71 Hypothesis Testing Suppose that we want to assess the evidence in the observed data, concerning the hypothesis. There are two approaches to assessing.
Mechanism Design on Discrete Lines and Cycles Elad Dokow, Michal Feldman, Reshef Meir and Ilan Nehama.
Statistical Decision Theory Bayes’ theorem: For discrete events For probability density functions.
Abstract We offer a formal treatment of choice behaviour based on the premise that agents minimise the expected free energy of future outcomes. Crucially,
6.853: Topics in Algorithmic Game Theory Fall 2011 Constantinos Daskalakis Lecture 22.
Probabilistic Robotics Introduction Probabilities Bayes rule Bayes filters.
Game Theory Georg Groh, WS 08/09 Verteiltes Problemlösen.
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.
Keep the Adversary Guessing: Agent Security by Policy Randomization
Communication, Disclosure and Persuasion in Strategic Settings
Many Senders L8.
Lesson 2-2 AP Computer Science Principles
Information Design: Unobserved types
Comparative Cheap Talk
Inference in Bayesian Networks
Multidimensional Cheap Talk (Quasiconvex preferences)
Regime change Ec 517 October 2, 2017.
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
Markov ó Kalman Filter Localization
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
Bayesian Persuasion cn
Intro to Information Design (and some Basic Bayesian Persuasion)
CSE-490DF Robotics Capstone
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
An Introduction to Variational Methods for Graphical Models
Multidimensional Cheap Talk
Strategic Information Transmission
Basic Concepts of Optimization
Comparative Cheap Talk
Reinforcement Learning Dealing with Partial Observability
Weichao Mao, Zhenzhe Zheng, Fan Wu
Bayes Nash Implementation
Information, Incentives, and Mechanism Design
Presentation transcript:

Kamienica and Genzkow (AER 2011) Bayesian Persuasion L8 Kamienica and Genzkow (AER 2011)

Bayesian Persuasion Framework Two agents: Sender (S) and Receiver (R) Type space Action space . Message space Preferences S sends message, , R responds with an action S ex ante commits to Solution concept Important tool

KG Prosecutor/Judge example Story: prosecutor S and judge R Binary model Preferences For beliefs R optimal choice Expected S utility given common beliefs (no persuasion)

KG example: function and 2 information structures How large is the set of posteriors?

Set of Bayes plausible (distributions of) posteriors Aumann and Mashler (1995) Messages split prior into ``random’’ posteriors induces random posterior is Bayes plausible given if induced by some set of all Bayes plausible posteriors P: if and only if Heuristic proof Equivalent optimization problem

Concavification of value function Value function of the persuasion program P: Value function coincides with concave closure of . on Implication: is concave

Observations: Given prior , S has incentives totransmit information iff Concave for all beliefs No transmission of information Example: Convex only at the degenerate beliefs Full transition of information Examples: KG Prosecutor/Judge example?

KG example: function is neither concave nor concave How about Optimal transmission of information?

Characterization results Condition for incentives to transmit information Necessary: existence of beliefs that S would share Sufficient: Necessary + discretetness

Incentives to transmit information (necessity) Fix prior and let D: S would share beliefs with R if Example: Remark: verification of the condition requires graph of

Necessary condition P: S has incentives to transmit information only if exist that S would share Proof:

Transmission of information (sufficiency) D: R preferences are discrete at if Remarks: preferences are discrete, generically and continuous no is optimal for posterior in the neighborhood of

Transmission of information (sufficiency) P: Suppose at R preferences are discrete and there is that S would share. Then S benefits from transmission of information

Expected state model hard to work with when Suppose Expected S utility Exists Let be a concave closure of Can be used to make predictions

Expected state model For any prior is not a value function of the persuasion problem but its upper bound P: S benefits from transmission of information iff Not helpful in finding optimal message strategy

Summary Value function in the persuasion problem is concave A geometric tool to find optimal message strategy in 2 state example Some results characterizing persuasion Not clear if they this help to find optimal mechanism in a general model Limitations: settings with more than two states? Settings with two or more agents? Solutions: Settings with two or more agents 2-stage approach