Information Design: Unobserved types

Slides:



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

(More on) characterizing dominant-strategy implementation in quasilinear environments (see, e.g., Nisan’s review: Chapter 9 of Algorithmic Game Theory.
CPS Bayesian games and their use in auctions Vincent Conitzer
Naïve Bayes. Bayesian Reasoning Bayesian reasoning provides a probabilistic approach to inference. It is based on the assumption that the quantities 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
Mechanism Design and Auctions Jun Shu EECS228a, Fall 2002 UC Berkeley.
An Algorithm for Automatically Designing Deterministic Mechanisms without Payments Vincent Conitzer and Tuomas Sandholm Computer Science Department Carnegie.
Incentive Compatibility and the Bargaining Problem By Roger B. Myerson Presented by Anshi Liang
Common Knowledge: The Math. We need a way to talk about “private information”
Chapter 9 Games with Imperfect Information Bayesian Games.
Mechanisms for Making Crowds Truthful Andrew Mao, Sergiy Nesterko.
© 2009 Institute of Information Management National Chiao Tung University Lecture Note II-3 Static Games of Incomplete Information Static Bayesian Game.
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.
Automated Design of Multistage Mechanisms Tuomas Sandholm (Carnegie Mellon) Vincent Conitzer (Carnegie Mellon) Craig Boutilier (Toronto)
Games with Imperfect Information Bayesian Games. Complete versus Incomplete Information So far we have assumed that players hold the correct belief about.
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.
Regret Minimizing Equilibria of Games with Strict Type Uncertainty Stony Brook Conference on Game Theory Nathanaël Hyafil and Craig Boutilier Department.
Lecture 5 Financial Incentives This lecture is paired with our previous one that discussed employee benefits. Here we focus on the reasons why monetary.
Automated Mechanism Design Tuomas Sandholm Presented by Dimitri Mostinski November 17, 2004.
6.853: Topics in Algorithmic Game Theory Fall 2011 Constantinos Daskalakis Lecture 22.
Bayesian Algorithmic Mechanism Design Jason Hartline Northwestern University Brendan Lucier University of Toronto.
2.5 The Fundamental Theorem of Game Theory For any 2-person zero-sum game there exists a pair (x*,y*) in S  T such that min {x*V. j : j=1,...,n} =
1 TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A AAA A AA A.
Security Markets V Miloslav S Vošvrda Theory of Capital Markets.
Comp/Math 553: Algorithmic Game Theory Lecture 10
Comp/Math 553: Algorithmic Game Theory Lecture 11
Information Design: A unified Perspective cn
Many Senders (part 3) L10.
Bayesian games and mechanism design
Many Senders L8.
CPS Mechanism design Michael Albert and Vincent Conitzer
Information Design: Unobserved types
Comparative Cheap Talk
Arbitration and Mediation
Information Design: A unified Perspective
Information Design: A unified Perspective Prior information
Arbitration and Mediation
Information Design: A unified Perspective
Implementation in Bayes-Nash equilibrium
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
Polyhedron Here, we derive a representation of polyhedron and see the properties of the generators. We also see how to identify the generators. The results.
Kamienica and Genzkow (AER 2011)
Bayesian Persuasion cn
Intro to Information Design (and some Basic Bayesian Persuasion)
Polyhedron Here, we derive a representation of polyhedron and see the properties of the generators. We also see how to identify the generators. The results.
Partly Verifiable Signals (c.n.)
Pragmatics of Persuasion
Implementation in Bayes-Nash equilibrium
Partly Verifiable Signals (c.n.)
Today: basic Bayesian Persuasion
Strategic Information Transmission
Robust Mechanism Design with Correlated Distributions
Strategic Information Transmission
Vincent Conitzer Mechanism design Vincent Conitzer
Vincent Conitzer CPS 173 Mechanism design Vincent Conitzer
Games with Imperfect Information Bayesian Games
Comparative Cheap Talk
Derivatives in Action Chapter 7.
EASTERN MEDITERRANEAN UNIVERSITY DEPARTMENT OF INDUSTRIAL ENGINEERING IENG314 OPERATIONS RESEARCH II SAMIR SAMEER ABUYOUSSEF
Implementation in Bayes-Nash equilibrium
Bayes Nash Implementation
Information, Incentives, and Mechanism Design
Vincent Conitzer CPS Mechanism design Vincent Conitzer
Presentation transcript:

Information Design: Unobserved types L21 Bergmann and Morris 2017 Kolotilin, Li Mylovanow Zapelchelynuk 2015

Question So far: designer observes (and hence condition on) private information What if designer does not have access to such information? Today: design without private players information Two scenarios Designer can elicit private information Designer cannot elicit information

Basic Game Sender faces many Receives who ``play a game ’’ among each other A game: I players (receivers) Finite action space Type space: , prior Preferences: ``Prior’’ information structure Finite set of signals , Signal distribution We call it a basic game (of incomplete information), Communication rule

Obedience BNE in game (G,C) induces (expected) decision rule, Let be set of all BN decision rules in (G,C) Characterization: iff it satisfies obedience condition for G: Recommended action needs to be interim optimal Optimization domain for a designer is a polytope

Elicitation (Private Persuasion) What if designer observes state but not types Suppose designer can privately ask players about their types Communication rule and hence BNE decision rules are contingent on Incentives to tell the truth What is the adequate incentive compatibility condition? General mechanism design (Myerson 1991) Bayesian collective choice problems ( traditional MD) Bayesian games with communication (here)

Standard truth telling Decision rule satisfies truth telling condition if In ``basic’’ mechanism design, actions are controlled by the designer Suppose decision rule satisfies obedience and truthtelling Is attainable in BNE with communication?

Incentive compatibility Player simultaneously makes two choices Obedience + truthtelling: necessary but not sufficient for attainability We need immunity to double deviations Incentive compatibility condition (Myerson 91, Section 6.3) Let be a deviation function

Incentive compatibility (Myerson 91) D: Decision rule is incentive compatible iff it is immune to double deviations i.e., In binary state and action model obedience and truthtelling is sufficient for IC We show such example next

Example (Elicitation) Firm example Omniscient designer observes and hence conditions on Two independent problems with different ``posterior-priors’’

Obedience constraints Suppose Signal Signal Integrating out types gives the set of all

BCE BCE set for and

Additional truthtelling constraints Truthtelling constraint for signal g Truthtelling constraint for signal b

Obedience and truthtelling Implications for the feasible set Set of attainable BCE is strictly smaller than for omniscient designer More generally such set is weakly smaller and typically strictly smaller

No Elicitation (Public Persuasion) What if designer cannot privately ask players about their types? One option: recommendation Dramatically reduces set of attainable Can we do better than that? Let and Strategy recommendation This way recommendations can condition on agents types

Which are we loosing relative to elicitation? Two further restrictions on BCE set from no elicitation - public feasibility (mechanical constraint) -alternative (stronger) obedience constraint In the example none of the two restricts the set of attainable BCE No elucidation condition is vacuous for binary model

Public feasibility Heuristic argument Elicitation: arbitrary s.t. incentive compatibility constraints Public feasibility: payer’s strategy cannot vary in others type Let . Rule: both firms invest iff firm’s one signal is Is incentive compatible Is not publicly feasible In one player game public feasibility is vacuous

Obedience Tighter obedience constraint The player receives recommendation for any type Example Observation: public feasibility is vacuous

What are we loosing relative to elicitation

Two General results Set of attainable BCE with elicitation weakly larger than with no elicitation Binary model the two methods are equivalent For each departure example with strict inclusion