Arbitration and Mediation

Slides:



Advertisements
Similar presentations
Mechanism Design with Execution Uncertainty
Advertisements

6.896: Topics in Algorithmic Game Theory Lecture 20 Yang Cai.
Seminar in Auctions and Mechanism Design Based on J. Hartline’s book: Approximation in Economic Design Presented by: Miki Dimenshtein & Noga Levy.
Optimal auction design Roger Myerson Mathematics of Operations research 1981.
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.
1. problem set 12 from Binmore’s Fun and Games. p.564 Ex. 41 p.565 Ex. 42.
Amparo Urbano (with P. Hernandez and J. Vila) University of Valencia. ERI-CES Pragmatic Languages with Universal Grammars: An Equilibrium Approach.
Mechanism Design and Auctions Jun Shu EECS228a, Fall 2002 UC Berkeley.
Mechanism Design. Overview Incentives in teams (T. Groves (1973)) Algorithmic mechanism design (Nisan and Ronen (2000)) - Shortest Path - Task Scheduling.
Agent Technology for e-Commerce Chapter 10: Mechanism Design Maria Fasli
An Algorithm for Automatically Designing Deterministic Mechanisms without Payments Vincent Conitzer and Tuomas Sandholm Computer Science Department Carnegie.
Non-Cooperative Computation Mark Pearson CS /01/03.
Automated Mechanism Design: Complexity Results Stemming From the Single-Agent Setting Vincent Conitzer and Tuomas Sandholm Computer Science Department.
Mechanisms for Making Crowds Truthful Andrew Mao, Sergiy Nesterko.
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)
Mechanism design for computationally limited agents (previous slide deck discussed the case where valuation determination was complex) Tuomas Sandholm.
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.
Mechanism Design II CS 886:Electronic Market Design Sept 27, 2004.
Contracting Under Imperfect Commitment PhD 279B December 3, 2007.
Enrica Carbone (UniBA) Giovanni Ponti (UA- UniFE) ESA-Luiss–30/6/2007 Positional Learning with Noise.
Mechanism design (strategic “voting”) Tuomas Sandholm Professor Computer Science Department Carnegie Mellon University.
6.853: Topics in Algorithmic Game Theory Fall 2011 Constantinos Daskalakis Lecture 22.
Mechanism Design with Strategic Mediators Moran Feldman EPFL Joint work with: Moshe Babaioff, Microsoft Research Moshe Tennenholtz, Technion.
Comp/Math 553: Algorithmic Game Theory Lecture 11
Information Design: A unified Perspective cn
Many Senders (part 3) L10.
Communication, Disclosure and Persuasion in Strategic Settings
Mechanism design for computationally limited agents (last lecture discussed the case where valuation determination was complex) Tuomas Sandholm Computer.
Many Senders L8.
CPS Mechanism design Michael Albert and Vincent Conitzer
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
Partly Verifiable Signals
Information Design: A unified Perspective
Implementation in Bayes-Nash equilibrium
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)
Information Design: Unobserved types
Partly Verifiable Signals (c.n.)
Disclosure (Persuasion) games
Pragmatics of Persuasion
Implementation in Bayes-Nash equilibrium
Partly Verifiable Signals (c.n.)
Today: basic Bayesian Persuasion
Strategic Information Transmission
Multidimensional Cheap Talk
Strategic Information Transmission
Vincent Conitzer Mechanism design Vincent Conitzer
Vincent Conitzer CPS 173 Mechanism design Vincent Conitzer
Comparative Cheap Talk
Vincent Conitzer Computer Science Department
Implementation in Bayes-Nash equilibrium
Information, Incentives, and Mechanism Design
Presentation transcript:

Arbitration and Mediation L17 Goltsman et al. (JET 2006) Institutional approach

Institutions CS assumes a particular extensive form of communication game Some institutions improve upon CS Two approaches Design of institutions given incentive constraints Particular extensive forms Mechanisms though which they improve communication How they compare to best CS equilibrium?

Sender-Receiver model Two agents: Sender (S) and Receiver (R) Type space: Preferences S sends message to intermediary, who makes recommendations to R Recommendation rule Intermediary: Arbitration (binding recommendations) Mediation (not binding) We look for rules that are ex ante optimal for R

Observations Commitment: Myerson’s revelation principle Direct truth telling mechanism Welfare rankings for R: - Arbitration - Mediation - SPN equilibrium in ``any’’ communication game Upper bounds For mediation and SPN equilibrium ex ante welfare of R and S aligned

Arbitration Problem: Incentive compatibility: Truth telling required to be ex post optimal for S (IC-S) Rule need not be (ex post) optimal for R.

Important trick Fix recommendation rule Sufficient statistics for S expected payoff Expectation is an ``action’’ and variance is a ``transfer’’

Incentive compatibility (IC-S) L: satisfies IC-S condition iff a) Is nondecreasing b) c) Proof

Incentive compatibility (IC-S) Is IC-S for some Is IC-S for some

Optimal arbitration rule Assume T: Optimal mechanism is deterministic with Melumad and Shibano (RAND 91) Remarks: Delegation with cap is optimal For bubbling is optimal for R (no information transmission) S -optimal rule

Heuristic argument :

Mediation Problem: Incentive compatibility: Truth telling required to be ex post optimal for S (IC-S) Rule has to be (ex post) optimal for R. Can optimal arbitration rule be implemented in a mediation setting?

Optimal Mediation Mechanism L: Upper bound for receivers ex ante utility is Partition T: Optimal mediation mechanism Mechanism is random Arbitrage mediation most informative equilibrium in CS Mediator’s only role is to introduce noise

Interpretation ``Broken’’ phone paradox Blume, Bord and Kawamura (TE 2007) With probability instead of signal receiver observes Informative equilibrium implements optimal mediation outcome Two effects of noise Makes the signal less informative Relaxes IC constraint for S fostering more truthful revelation The latter effect dominates

Negotiations Multistage cheap talk Aumann and Hart 2003, Krishna and Morgan 2004 Better than most informative CS Upper bound for welfare of R –mediation outcome-sometimes achieved Intuition: multistage noise allows for randomisation

Conclusions Commitment of external party improves welfa Delegation is optimal if feasible Noisy cheap talk can improve information transition Can be implemented as multistage cheap talk