Nash Bargaining Solution and Alternating Offer Games MIT 14.126-Game Theory.

Slides:



Advertisements
Similar presentations
Introduction to Proofs
Advertisements

Chapter 3 Elementary Number Theory and Methods of Proof.
A Short Tutorial on Cooperative Games
1 Topics in Game Theory SS 2008 Avner Shaked. 2
3. Basic Topics in Game Theory. Strategic Behavior in Business and Econ Outline 3.1 What is a Game ? The elements of a Game The Rules of the.
1 EC9A4 Social Choice and Voting Lecture 3 EC9A4 Social Choice and Voting Lecture 3 Prof. Francesco Squintani
Social Choice Session 6 Carmen Pasca and John Hey.
Congestion Games with Player- Specific Payoff Functions Igal Milchtaich, Department of Mathematics, The Hebrew University of Jerusalem, 1993 Presentation.
M9302 Mathematical Models in Economics Instructor: Georgi Burlakov 2.5.Repeated Games Lecture
EC941 - Game Theory Lecture 7 Prof. Francesco Squintani
Negotiation A Lesson in Multiagent System Based on Jose Vidal’s book Fundamentals of Multiagent Systems Henry Hexmoor SIUC.
EC941 - Game Theory Prof. Francesco Squintani Lecture 8 1.
Lecture 4 on Individual Optimization Risk Aversion
Motivation: Condorcet Cycles Let people 1, 2 and 3 have to make a decision between options A, B, and C. Suppose they decide that majority voting is a good.
2 2.3 © 2012 Pearson Education, Inc. Matrix Algebra CHARACTERIZATIONS OF INVERTIBLE MATRICES.
Lecture 7 Negotiating Strategy 1.Axiomatic (Nash) Bargaining 2.Connection to Alternating Offers 3.Voting, Stability and Group Decisions.
Bargaining in-Bundle over Multiple Issues in Finite- Horizon Alternating-Offers Protocol Francesco Di Giunta and Nicola Gatti Politecnico di Milano Milan,
Job Market Signaling (Spence model)
Lecture 3 Negotiating Strategy Professor Keith Chen 1.Quick Review of the Alternating-Offers Model Thinking about the value of the future. 2.BATNA & ZOPA.
Incomplete Contracts Renegotiation, Communications and Theory December 10, 2007.
Static Games of Complete Information: Subgame Perfection
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Review Midterm3/23 3/2.
On the Aggregation of Preferences in Engineering Design Beth Allen University of Minnesota NSF DMI
A bargaining approach to the ordinal Shapley rule Juan Vidal-Puga The latest version of this paper can be found at
Bargaining over the Delta Michael Hanemann
Communication Networks A Second Course Jean Walrand Department of EECS University of California at Berkeley.
© 2009 Institute of Information Management National Chiao Tung University Lecture Notes II-2 Dynamic Games of Complete Information Extensive Form Representation.
1 EC9B6 Voting and Communication Lecture 1 Prof. Francesco Squintani
Decision Theory CHOICE (Social Choice) Professor : Dr. Liang Student : Kenwa Chu.
Methods of Proof & Proof Strategies
1 A1 Pareto A2 Symmetry A3 Invariance A4 IIA A1 Pareto A2 Symmetry A3 Invariance A4 IIA First, we show that there exists a function satisfying the axioms.
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)
Dynamic Games of complete information: Backward Induction and Subgame perfection - Repeated Games -
Game Theory is Evolving MIT , Fall Our Topics in the Course  Classical Topics Choice under uncertainty Cooperative games  Values  2-player.
EC941 - Game Theory Prof. Francesco Squintani Lecture 5 1.
Section 1.8. Section Summary Proof by Cases Existence Proofs Constructive Nonconstructive Disproof by Counterexample Nonexistence Proofs Uniqueness Proofs.
Unions and Collective Bargaining Topic 4 Part I. Topic Outline Bargaining Models under Complete Information Applied to Collective Bargaining Nash’s Cooperative.
Number Theory Project The Interpretation of the definition Andre (JianYou) Wang Joint with JingYi Xue.
Bargaining Theory MIT Game Theory. Bargaining Theory Cooperative (Axiomatic) –Edgeworth –Nash Bargaining –Variations of Nash –Shapley Value Non-cooperative.
Naïve Set Theory. Basic Definitions Naïve set theory is the non-axiomatic treatment of set theory. In the axiomatic treatment, which we will only allude.
Lecture 1 on Bargaining Setting the Agenda This lecture focuses on the well known problem of how to split the gains from trade or, more generally, mutual.
6.853: Topics in Algorithmic Game Theory Fall 2011 Constantinos Daskalakis Lecture 22.
Method of proofs.  Consider the statements: “Humans have two eyes”  It implies the “universal quantification”  If a is a Human then a has two eyes.
Game Theory (Microeconomic Theory (IV)) Instructor: Yongqin Wang School of Economics, Fudan University December, 2004.
EC941 - Game Theory Prof. Francesco Squintani Lecture 6 1.
Copyright © Cengage Learning. All rights reserved. CHAPTER 8 RELATIONS.
Chapter 5. Section 5.1 Climbing an Infinite Ladder Suppose we have an infinite ladder: 1.We can reach the first rung of the ladder. 2.If we can reach.
Bargaining games Econ 414. General bargaining games A common application of repeated games is to examine situations of two or more parties bargaining.
Decision Theory Lecture 4. Decision Theory – the foundation of modern economics Individual decision making – under Certainty Choice functions Revelead.
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} =
Now that we have set of pure strategies for each player, we need to find the payoffs to put the game in strategic form. Random payoffs. The actual outcome.
Lecture V: Bargaining Recommended Reading: Dixit & Skeath, Chapter 17 Osborne, Chapter 6.1, 16 Powell, In the Shadow of Power, Ch. 3.
L6: Risk Sharing and Asset Pricing1 Lecture 6: Risk Sharing and Asset Pricing The following topics will be covered: Pareto Efficient Risk Allocation –Defining.
Chapter 5 1. Chapter Summary  Mathematical Induction  Strong Induction  Recursive Definitions  Structural Induction  Recursive Algorithms.
A useful reduction (SAT -> game)
Game Theory: The Competitive Dynamics of Strategy
CHARACTERIZATIONS OF INVERTIBLE MATRICES
Theory of Games and Bargaining
Induction and recursion
EC941 - Game Theory Lecture 8 Prof. Francesco Squintani
Risk Chapter 11.
Chapter 14 & 15 Repeated Games.
I.4 Polyhedral Theory (NW)
Chapter 14 & 15 Repeated Games.
I.4 Polyhedral Theory.
Molly W. Dahl Georgetown University Econ 101 – Spring 2009
What do we agree on when we disagree
CHARACTERIZATIONS OF INVERTIBLE MATRICES
Presentation transcript:

Nash Bargaining Solution and Alternating Offer Games MIT Game Theory

Nash Bargaining Model Formulation Axioms & Implications

Elements  The bargaining set: S Utility pairs achievable by agreement When? Immediate agreement?  Disagreement point: d ∈ R 2 Result of infinitely delayed agreement? Payoff during bargaining? Outside option?  Solution: f(S,d) ∈ R 2 is the predicted bargaining outcome

Impossibility of Ordinal Theory  Fix (S,d) as follows  Represent payoffs “ equivalently ” by (u 1,u 2 ) where  Then, the bargaining set is:  Ordinal preferences over bargaining outcomes contain too little information to identify a unique solution.

Nash ’ s Initial Assumptions  Cardinalization by risk preference Why? What alternatives are there?  Assume bargaining set S is convex Why?

Nash ’ s Axioms  Independence of Irrelevant Alternatives (IIA) If f(S,d) ∈ T ⊂ S, then f(T,d)=f(S,d)  Independence of positive linear transformations (IPLT) Let h i (x i )=α i x i +β i, where α i >0, for i=1,2. Suppose a=f(S,d). Let S ’ =h(S) and d ’ =h(d). Then, f(S ’,d ’ )=h(a).  Efficiency f(S,d) is on the Pareto frontier of S  Symmetry Suppose d ’ =(d 2,d 1 ) and x ∈ S ⇔ (x 2,x 1 ) ∈ S ’. Then, f 1 (S,d)=f 2 (S ’,d ’ ) and f 2 (S,d)=f 1 (S ’,d ’ ).

Independence of Irrelevant Alternatives (IIA)  Statement of the IIA condition If f(S,d) ∈ T ⊂ S, then f(T,d)=f(S,d)  Definitions. Vex(x,y,d) = convex hull of {x,y,d}. xP d y means x=f(Vex(x,y,d),d). xPy means x=f(Vex(x,y,0),0)  By IIA, these are equivalent x=f(S,d) xP d y for all y in S

Efficiency  Statement of the efficiency condition f(S,d) is on the Pareto frontier of S  Implications The preference relations P d are “ increasing ”

Positive Linear Transformations  Statement of the IPLT condition Let h i (x i )=α i x i +β i, where α i >0, for i=1,2. Suppose a=f(S,d). Let S ’ =h(S) and d ’ =h(d). Then, f(S ’,d ’ )=h(a).  Implications xP d y if and only if (x-d)P(y-d) Suppose d=0 and x 1 x 2 =1.  If (x 1,x 2 )P(1,1) then (1,1)P(1/x 1,1/x 2 )=(x 2,x 1 )

Symmetry  Statement of the symmetry condition Suppose d ’ =(d 2,d 1 ) and x ∈ S ⇔ (x 2,x 1 ) ∈ S ’. Then, f 1 (S,d)=f 2 (S ’,d ’ ) and f 2 (S,d)=f 1 (S ’,d ’ ).  Implication When d=(0,0), (x 1,x 2 ) is indifferent to (x 2,x 1 ). IPLT + Symmetry imply x 1 x 2 =1 ⇒ x is indifferent to (1,1). x 1 x 2 =y 1 y 2 ⇒ x is indifferent to y.

A Nash Theorem  Theorem. The unique bargaining solution satisfying the four axioms is given by:  Question: Did we need convexity for this argument?

Alternating Offer Bargaining  Two models Both models have two bargainers, feasible set S Multiple rounds: bargainer #1 makes offers at odd rounds, #2 at even rounds An offer may be  Accepted, ending the game  Rejected, leading to another round  Possible outcomes No agreement is ever reached Agreement is reached at round t

Model #1: Risk of Breakdown  After each round with a rejection, there is some probability p that the game ends and players receive payoff pair d. Best equilibrium outcome for player one when it moves first is a pair (x 1,x 2 ) on the frontier of S. Worst equilibrium outcome for player two when it moves first is a pair (y 1,y 2 ) on the frontier of S. Relationships:

The Magical Nash Product  Manipulating the equations:  Taking d=(0,0), a solution is a 4-tuple (x 1,y 1, x 2,y 2 ) such that x 1 y 1 =x 2 y 2, as follows:

Main Result  Theorem. As p ‚ 0, (x 1,x 2 ) and (y 1,y 2 ) (functions of p) converge to f(S,d).  Proof. Note: y 1 =(1-p)x 1 and x 2 =(1-p)y 2 and … Nash bargaining solution

Commentary  Facts and representations Cardinal utility enters because risk is present The risk is that the disagreement point d may be the outcome. Comparative statics (risk aversion hurts a bargainer) is interpretable in these terms.

Outside Options  Modify the model so that at any time t, either bargainer can quit and cause the outcome z ∈ S to occur. Is z a suitable threat point?  Two cases: If z 1 ≤y 1 and z 2 ≤x 2, then the subgame perfect equilibrium outcome is unchanged. Otherwise, efficiency plus

Model #2: Time Preference  An outcome consists of an agreement x and date t.  Assumptions to model time preference A time indifferent agreement n exists Impatience: (x,0)P(n,0) and t<t ’ imply (x,t)P(x,t ’ ) Stationarity: (x,t)P(x ’,t ’ ) implies (x,t+s)P(x ’,t ’ +s). Time matters (+continuity): (x,0)P(y,0)P(n,0) implies there is some t such that (y,t)I(x,0).  Theorem. For all δ ∈ (0,1), there is a function u such that (x,t)P(x ’,t ’ ) if and only if u(x)δ t >u(x ’ )δ t’. In particular, u(n)=0.

Proof Exercise  Insight: Same axioms imply that preferences can be written as: v(x)-t.ln(δ)  Exercise: Interpret t as cash instead of time. State similar axioms about preferences over (agreement, payment) pairs. Use these to prove the quasi-linear representation that there exists a function v such that (x,0) is preferred to (y,t) if and only v(x)>v(y)+t.

Representing Time Preference  Theorem. Suppose that u and v are positive functions with the property that v(x)=[u(x)]A for some A>0. Then u(x)δ t and v(x)ε t represent the same preferences if and only if ε= δ A.  Proof. Exercise.

Comparative Statics  The following changes in preferences are equivalent From u(x)δ t to u(x)ε t From u(x)δ t to v(x)δ t, where v(x)=u(x) A and A=ln(δ)/ln(ε).  Hence, for fixed δ, greater impatience is associated with “ greater concavity ” of u.

Bargaining with Time Preference  This model is identical in form to the risk preference model, but has a different interpretation.  Fix δ ∈ (0,1) and corresponding utility functions u 1 and u 2 such that bargainer j ’ s preferences over outcome (z,t) are represented by x j = δ t u j (z). Best equilibrium outcome for player one when it moves first is a pair (x 1,x 2 ) on the frontier of S. Worst equilibrium outcome for player two when it moves first is a pair (y 1,y 2 ) on the frontier of S. Relationships:

General Conclusions  Cardinalization principle The proper way to cardinalize preferences depends on the source of bargaining losses that drives players to make a decision.  Outside option principle Outside options are not “ disagreement points ” and affect the outcome only if they are better for at least one party than the planned bargaining outcome.

End