Many Senders L8 Gilligan and Khrehbiel (AJPS 1989)

Slides:



Advertisements
Similar presentations
Eliciting Honest Feedback 1.Eliciting Honest Feedback: The Peer-Prediction Model (Miller, Resnick, Zeckhauser) 2.Minimum Payments that Reward Honest Feedback.
Advertisements

 1. Introduction to game theory and its solutions.  2. Relate Cryptography with game theory problem by introducing an example.  3. Open questions and.
1 Regret-based Incremental Partial Revelation Mechanism Design Nathanaël Hyafil, Craig Boutilier AAAI 2006 Department of Computer Science University of.
4 Why Should we Believe Politicians? Lupia and McCubbins – The Democratic Dilemma GV917.
Game-theoretic analysis tools Necessary for building nonmanipulable automated negotiation systems.
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
Rational Learning Leads to Nash Equilibrium Ehud Kalai and Ehud Lehrer Econometrica, Vol. 61 No. 5 (Sep 1993), Presented by Vincent Mak
Robust Mechanisms for Information Elicitation Aviv Zohar & Jeffrey S. Rosenschein.
Nov 2003Group Meeting #2 Distributed Optimization of Power Allocation in Interference Channel Raul Etkin, Abhay Parekh, and David Tse Spectrum Sharing.
Renegotiation Design with Unverifiable Info Dylan B. Minor.
Extensive Game with Imperfect Information III. Topic One: Costly Signaling Game.
Non-Cooperative Computation Mark Pearson CS /01/03.
Extensive Game with Imperfect Information Part I: Strategy and Nash equilibrium.
Alternating-Offers Bargaining under One-Sided Uncertainty on Deadlines Francesco Di Giunta and Nicola Gatti Dipartimento di Elettronica e Informazione.
1 Game Theory Sequential bargaining and Repeated Games Univ. Prof.dr. M.C.W. Janssen University of Vienna Winter semester Week 46 (November 14-15)
Automated Design of Multistage Mechanisms Tuomas Sandholm (Carnegie Mellon) Vincent Conitzer (Carnegie Mellon) Craig Boutilier (Toronto)
Dynamic Games & The Extensive Form
Regret Minimizing Equilibria of Games with Strict Type Uncertainty Stony Brook Conference on Game Theory Nathanaël Hyafil and Craig Boutilier Department.
Paul Milgrom and Nancy Stokey Journal of Economic Thoery,1982.
Extensive Games with Imperfect Information
EC941 - Game Theory Prof. Francesco Squintani Lecture 6 1.
Linear Programming Chap 2. The Geometry of LP  In the text, polyhedron is defined as P = { x  R n : Ax  b }. So some of our earlier results should.
On the Difficulty of Achieving Equilibrium in Interactive POMDPs Prashant Doshi Dept. of Computer Science University of Georgia Athens, GA Twenty.
Q 2.1 Nash Equilibrium Ben
Information Design: A unified Perspective cn
Many Senders (part 3) L10.
Communication, Disclosure and Persuasion in Strategic Settings
Piecewise Polynomials and Splines
AP CSP: Sending Binary Messages with the Internet Simulator
Many Senders L8.
CPS Mechanism design Michael Albert and Vincent Conitzer
Information Design: Unobserved types
Comparative Cheap Talk
On the Size of Pairing-based Non-interactive Arguments
Multidimensional Cheap Talk (Quasiconvex preferences)
Communication and Information Design
Arbitration and Mediation
Applied Mechanism Design For Social Good
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
When Security Games Go Green
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)
Information Design: Unobserved types
Partly Verifiable Signals (c.n.)
Presented By Aaron Roth
Disclosure (Persuasion) games
Pragmatics of Persuasion
Partly Verifiable Signals (c.n.)
Today: basic Bayesian Persuasion
Strategic Information Transmission
Multidimensional Cheap Talk
Toshiji Kawagoe Future University – Hakodate and Hirokazu Takizawa
Strategic Information Transmission
Vincent Conitzer Mechanism design Vincent Conitzer
Vincent Conitzer CPS 173 Mechanism design Vincent Conitzer
Comparative Cheap Talk
Multiagent Systems Repeated Games © Manfred Huber 2018.
M9302 Mathematical Models in Economics
A handbook on validation methodology. Metrics.
Presentation transcript:

Many Senders L8 Gilligan and Khrehbiel (AJPS 1989) Krishna and Morgan (APSR 2001) Battaglini (ECMA 2002) Ambrus and Takahashi (TE 2008) Ambrus and Lu (GEB 2014)

Observations Two benefits from consulting multiple senders Confirming facts and punishing conflicting information Eliciting information along common interests, aggregating Battaglini (2002) : a thriller with a happy end General message: (almost) full revelation is robustly feasible under mild conditions even without off equilibrium punishment Conceptual contributions Revelation principle for games Robustness (Trembling hand ) criterion

Multidimensional Cheap Talk Agents: Two senders and Receiver Timing and actions: State Each sender observes signal Senders simultaneously send Receiver observes messages , choses action Preferences We first assume

PBN Equilibrium Strategies: Senders Receives Posterior D: Equilibrium s.t. 1. 2. 3.

Revelation principle Fully revealing equilibrium: Truthful revelation Message space Equilibrium strategies L:Suppose fully revealing equilibrium exists. Then there exists a truthfully revealing equilibrium with degenerate beliefs (in and out of equilibrium). Nonexistence of fully revealing e can be established in a simple setting Revelation principle stronger than in MD

Proof of revelation principle First we show revelation principle and then degeneracy of beliefs Let be a PBN equilibrium

Existence of a fully revealing equilibrium (d=1) Krishna and Morgan (APSR 2001) Battaglini (ECMA 2002): Necessary and sufficient condition Assume one dimensional state space, (hard case) Opposite biases P: Fully revealing equilibrium exists if and only if Idea: Discrepancies penalized with extreme action (off equilibrium) Problem: sequential rationality and existence of extreme action

Observation Consider messages Does enforce truth telling Penalty has to be message dependent Can we always find extreme action penalizing a liar? Can we support extreme actions with beliefs?

Proof Consider report What. enforces truth telling (assuming truth telling of for

Proof L: Fully revealing equilibrium exists iff for any pair set is nonempty

Proof L: Fully revealing equilibrium exists iff for any pair set is nonempty

Example Messages R action R beliefs

Substantive insight Fully revealing equilibium exists under mild assumptions Is such equilibrium plausible? Ad hoc off-equilibrium beliefs Discontinuity: negligible discrepancy results in dramatic changes in beliefs Introspection: FR equilibrium is just a theoretical peculiarity No widely accepted belief refinement for continuous types

``Battaglini’s’’ trembling hand Robust equilibrium Consider a game with signals For each game find equilibrium Limit of a sequence of equilibria as is a robust equilibrium Game specific analog of ``trembling hand’’ Restrictions Discrepancies interpreted as expert mistakes ``All reports on equilibrium path

(Non)Existence of fully revealing equilibrium Assume P: For biases large enough there does not exist robust fully revealing equilibrium for any W Robust equilibrium refines away all equilibra Implication: full revelation should not be observed in reasonable settings ``Battaglini’s’’ trembling hand Heuristic argument With mistakes, expected value cannot be different from combination of reports This rules our extreme actions as punishments

Two alternative solutions to the problem Solution to nonexistence problem - Battaglini: multidimensional type spaces - Ambrus and Lue: Almost fully revealing equilibrium

Example Outcomes Quadratic preferences with biases Message space Equilibrium

Proof

Proof

Battaglini Assume dimensional state space Quadratic preferences with arbitrarily large biases independent bias vectors P: Robust fully revealing equilibrium exists

Extensions Preferences (quasiconcavity in outcomes) Dimensionality

Proof

Proof cn

Proof cn

Proof cn

Proof cn

Proof cn

Proof cn

Non-existence of robust equilibira Complication:: revelation principle does not apply Full revelation Large sets may support robust beliefs that are not robust with truthtelling

Heuristic argument Complication:: revelation principle does not apply Full revelation Large sets may support robust beliefs that are not supportable with truth telling

Heuristic argument Suppose Any two elements of must be apart. With sufficiently large bias is one to one

Heuristic argument Suppose By analogous argument one to one Three possible events (on equilibrium path)

Heuristic argument Suppose By analogous argument one to one Three possible events (on equilibrium path)

Heuristic argument consider