Bargaining with uncertain commitment: An agreement theorem

Slides:



Advertisements
Similar presentations
Approximate Nash Equilibria in interesting games Constantinos Daskalakis, U.C. Berkeley.
Advertisements

Comparative Cheap Talk Archishman Chakraborty and Rick Harbaugh JET, forthcoming.
Nash Equilibrium: Illustrations
CPS Bayesian games and their use in auctions Vincent Conitzer
This Segment: Computational game theory Lecture 1: Game representations, solution concepts and complexity Tuomas Sandholm Computer Science Department Carnegie.
Simultaneous- Move Games with Mixed Strategies Zero-sum Games.
Game Theory “I Used to Think I Was Indecisive - But Now I’m Not So Sure” - Anonymous Mike Shor Lecture 5.
ECO290E: Game Theory Lecture 5 Mixed Strategy Equilibrium.
1 Chapter 14 – Game Theory 14.1 Nash Equilibrium 14.2 Repeated Prisoners’ Dilemma 14.3 Sequential-Move Games and Strategic Moves.
M9302 Mathematical Models in Economics Instructor: Georgi Burlakov 2.5.Repeated Games Lecture
EC3224 Autumn Lecture #04 Mixed-Strategy Equilibrium
 1. Introduction to game theory and its solutions.  2. Relate Cryptography with game theory problem by introducing an example.  3. Open questions and.
Of 7 10/01/2013LIDS Lunch: Communication Amid Uncertainty1 Communication Amid Uncertainty Madhu Sudan Microsoft Research.
Introduction to Game Theory
Game-theoretic analysis tools Necessary for building nonmanipulable automated negotiation systems.
J. Laurent-Lucchetti (U. Bern) J. Leroux and B. Sinclair-Desgagné (HEC Montréal) Splitting an uncertain (natural) capital.
ECO290E: Game Theory Lecture 4 Applications in Industrial Organization.
Dynamic Games of Complete Information.. Repeated games Best understood class of dynamic games Past play cannot influence feasible actions or payoff functions.
An Introduction to Game Theory Part IV: Games with Imperfect Information Bernhard Nebel.
ECON6036 1st semester Format of final exam Same as the mid term
Outline  In-Class Experiment on a Coordination Game  Test of Equilibrium Selection I :Van Huyck, Battalio, and Beil (1990)  Test of Equilibrium Selection.
THE PROBLEM OF MULTIPLE EQUILIBRIA NE is not enough by itself and must be supplemented by some other consideration that selects the one equilibrium with.
Job Market Signaling (Spence model)
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Bargaining and Negotiation Review.
Quantal Response Equilibrium APEC 8205: Applied Game Theory Fall 2007.
Outline  In-Class Experiment on Centipede Game  Test of Iterative Dominance Principle I: McKelvey and Palfrey (1992)  Test of Iterative Dominance Principle.
Extensive Game with Imperfect Information III. Topic One: Costly Signaling Game.
Extensive Game with Imperfect Information Part I: Strategy and Nash equilibrium.
Simulating Normal Random Variables Simulation can provide a great deal of information about the behavior of a random variable.
Nash Equilibrium - definition A mixed-strategy profile σ * is a Nash equilibrium (NE) if for every player i we have u i (σ * i, σ * -i ) ≥ u i (s i, σ.
Game Applications Chapter 29. Nash Equilibrium In any Nash equilibrium (NE) each player chooses a “best” response to the choices made by all of the other.
Games in the normal form- An application: “An Economic Theory of Democracy” Carl Henrik Knutsen 5/
EC941 - Game Theory Francesco Squintani Lecture 3 1.
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Review Midterm3/23 3/9.
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Bargaining and Negotiation Review.
UNIT III: COMPETITIVE STRATEGY
Anonymizing Web Services Through a Club Mechanism With Economic Incentives Mamata Jenamani Leszek Lilien Bharat Bhargava Department of Computer Sciences.
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Bargaining and Negotiation Review.
Communication Networks A Second Course Jean Walrand Department of EECS University of California at Berkeley.
Static Games of Incomplete Information.. Mechanism design Typically a 3-step game of incomplete info Step 1: Principal designs mechanism/contract Step.
The Agencies Method for Coalition Formation in Experimental Games John Nash (University of Princeton) Rosemarie Nagel (Universitat Pompeu Fabra, ICREA,
1 Bargaining & Markets u As before: Buyers and Sellers, δtp,δtp, δ t (1-p). u Matching: Seller meets a buyer with probability α. A buyer meets a seller.
Auction Theory Class 2 – Revenue equivalence 1. This class: revenue Revenue in auctions – Connection to order statistics The revelation principle The.
Private Knowledge vs. Common Knowledge Carlson and Van Dam (see Econometrica, 1991) and Morris and Shin (see AER, 1998)
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)
NOBEL WP Szept Stockholm Game Theory in Inter-domain Routing LÓJA Krisztina - SZIGETI János - CINKLER Tibor BME TMIT Budapest,
© 2009 Institute of Information Management National Chiao Tung University Lecture Note II-3 Static Games of Incomplete Information Static Bayesian Game.
Auction Seminar Optimal Mechanism Presentation by: Alon Resler Supervised by: Amos Fiat.
Any Questions from Last Class?. Chapter 15 Making Decisions with Uncertainty COPYRIGHT © 2008 Thomson South-Western, a part of The Thomson Corporation.
The Moral Hazard Problem Stefan P. Schleicher University of Graz
Nash equilibrium Nash equilibrium is defined in terms of strategies, not payoffs Every player is best responding simultaneously (everyone optimizes) This.
Intermediate Microeconomics
Game-theoretic analysis tools Tuomas Sandholm Professor Computer Science Department Carnegie Mellon University.
Topic 2: Designing the “optimal auction” Reminder of previous classes: Discussed 1st price and 2nd price auctions. Found equilibrium strategies. Saw that.
Bargaining Theory MIT Game Theory. Bargaining Theory Cooperative (Axiomatic) –Edgeworth –Nash Bargaining –Variations of Nash –Shapley Value Non-cooperative.
Regret Minimizing Equilibria of Games with Strict Type Uncertainty Stony Brook Conference on Game Theory Nathanaël Hyafil and Craig Boutilier Department.
Coordination with Local Information Munther Dahleh Alireza Tahbaz-Salehi, John Tsitsiklis Spyros Zoumpouli.
Lecture 5 Introduction to Game theory. What is game theory? Game theory studies situations where players have strategic interactions; the payoff that.
Auctions serve the dual purpose of eliciting preferences and allocating resources between competing uses. A less fundamental but more practical reason.
Introduction Many organizations use decision rules to alleviate incentive problems as opposed to incentive contracts The principal typically retains some.
Intermediate Microeconomics Game Theory and Oligopoly.
6.853: Topics in Algorithmic Game Theory Fall 2011 Constantinos Daskalakis Lecture 22.
Auctions serve the dual purpose of eliciting preferences and allocating resources between competing uses. A less fundamental but more practical reason.
Intermediate Microeconomics Game Theory. So far we have only studied situations that were not “strategic”. The optimal behavior of any given individual.
EC941 - Game Theory Prof. Francesco Squintani Lecture 6 1.
5.1.Static Games of Incomplete Information
Intermediate Microeconomics
Comparative Cheap Talk
Regime change Ec 517 October 2, 2017.
Information, Incentives, and Mechanism Design
Presentation transcript:

Bargaining with uncertain commitment: An agreement theorem Rohan Dutta Work in progress

Inefficiency in bilateral bargaining Asymmetric Information Kennan & Wilson (1990) Irrational Types Abreu & Gul (2000) Behavioral bias Babcock & Loewenstein (1997) Uncertain commitment Schelling (1956) Crawford(1982) Ellingsen & Miettinen(2008)

Acute level of multiplicity Crawford (1982) General Model Players simultaneously demand shares of a pie of size 1 If the demands are compatible payoffs If the demands are incompatible i finds out realization of random variable admits a continuous density with support Then a Bayesian game is played 1-z2+d-k1 , 1-z1+d-k2 z1, 1-z1-k2 0,0 1-z2-k1, z2 Accept Stick Acute level of multiplicity Asymmetric information Uncertain commitment Independent costs

Leading example in Crawford(1982) Cost is drawn from a binomial distribution Prob (ki=2>1) Prob (ki=0) Equilibria with positive probability of disagreement exist Asymmetric information in the second stage not needed for this result. Following incompatible demands the realized costs for both agents becomes common knowledge. 1-z2+d-k1 , 1-z1+d-k2 z1, 1-z1-k2 0,0 1-z2-k1, z2 Accept Stick

1-z2+d-k1 , 1-z1+d-k2 z1, 1-z1-k2 0,0 1-z2-k1, z2 Accept Stick Prob (ki=2>1) (1,1) is an equilibrium demand profile Prob (ki=0) i sticks when cost is high and accepts when ki=0 & k-i=2 If both the costs are 0 then 1 sticks and 2 accepts Payoff to player 1 Payoff to player 2 Deviation payoff to player 1 Deviation payoff to player 2 There are also multiple efficient equilibria No efficient equilibria exists if for both i

Prob (k1=k2=2) Prob (k1=k2=0) Independence of costs? 1-z2+d-2 , 1-z1+d-2 z1, 1-z1-2 0,0 1-z2-2, z2 Accept Stick 1-z2+d , 1-z1+d z1, 1-z1 0,0 1-z2, z2 Accept Stick (1,1) is an equilibrium demand profile If ki = 0 then play (Stick, Accept) If ki = 2 then play (Stick, Stick)

Another Example 1-z2+d-2 , 1-z1+d-2 z1, 1-z1-2 0,0 1-z2-2, z2 Accept Stick 1/3 : k=2 1-z2+d-1/5 , 1-z1+d-1/5 z1, 1-z1-1/5 0,0 1-z2-1/5, z2 Accept Stick 1/3 : k=1/5 1-z2+d , 1-z1+d z1, 1-z1 0,0 1-z2, z2 Accept Stick 1/3 : k=0 (4/5,4/5) is an equilibrium demand profile k=1/5 (Accept, Stick) k=0 (Stick, Accept) (0, 4/5) (4/5, 0) If z1 > 4/5 then (Accept, Stick) when k=0

As Players simultaneously demand shares of a pie of size 1 If the demands are compatible payoffs If the demands are incompatible The cost of backing down k is drawn from a strictly increasing continuous distribution with an interval for its support Player i gets to see k but with some noise Proposition : As the set of equilibrium demand profiles of comprises of only efficient profiles. The noise for i is distributed uniformly over its support and independent of the noise for -i Characterize the set of equilibria of this game as

Risk dominant outcome: (Accept, Stick) 1-z2+d-k , 1-z1+d-k z1, 1-z1-k 0,0 1-z2-k, z2 Accept Stick The highest observation by i where i changes her action from the (Accept, Stick) profile. Risk dominant outcome: (Accept, Stick) Carlsson & van Damme(1993) Pr(A2)=q Pr(A1)=q’

What about the multiplicity of efficient equilibria? With incompatible offers each agent has the incentive to make a lower (but still incompatible) demand than the other agent and force her to always concede in the second stage. No disagreement! What about the multiplicity of efficient equilibria? Small enough Profitable deviation if the probability of high costs is not too high. The (symmetric) set of equilibrium demand profiles that survives depends on the distribution function.

Conclusion: When facing the same cost of backing down, unless the agents believe that intermediate costs are impossible, the bargaining outcome will always be efficient. Claim: Even with independent costs as long as the supports for the random variables are intervals, there will be no inefficient equilibrium. There will, however, be multiple efficient equilibria when the expected cost of backing down is sufficiently high. How does the proof change? 2 dimensional global games argument to get rid of multiplicity in the second stage. For any pair of incompatible demands the state space will be divided into two risk dominance regions. The crucial tradeoff will be between making a higher demand and having a larger risk dominance region where you make the other party concede to your demand.

Sam Spade (The Maltese Falcon): If you kill me, how are you gonna get the bird? And if I know you can't afford to kill me, how are you gonna scare me into giving it to you?