QR 38 Bargaining, 4/24/07 I. The bargaining problem and Nash solution II. Alternating offers models.

Slides:



Advertisements
Similar presentations
Some Problems from Chapt 13
Advertisements

Nash’s Theorem Theorem (Nash, 1951): Every finite game (finite number of players, finite number of pure strategies) has at least one mixed-strategy Nash.
1 Predatory Conduct. 2 Predatory conduct is the implementation of a strategy designed specifically to deter rival firms from competing in a market. To.
Any Questions from Last Class?. Chapter 14 Bargaining COPYRIGHT © 2008 Thomson South-Western, a part of The Thomson Corporation. Thomson, the Star logo,
Game Theory “Доверяй, Но Проверяй” - Russian Proverb (Trust, but Verify) - Ronald Reagan Mike Shor Lecture 6.
Managerial Economics & Business Strategy
Game Theory. Learning Objectives Define game theory, and explain how it helps to better understand mutually interdependent management decisions Explain.
Game Theory “Доверяй, Но Проверяй” (“Trust, but Verify”) - Russian Proverb (Ronald Reagan) Topic 5 Repeated Games.
Games With No Pure Strategy Nash Equilibrium Player 2 Player
Non-Cooperative Game Theory To define a game, you need to know three things: –The set of players –The strategy sets of the players (i.e., the actions they.
Frank Cowell: Microeconomics Exercise MICROECONOMICS Principles and Analysis Frank Cowell January 2007.
Chapter 6 Game Theory © 2006 Thomson Learning/South-Western.
Chapter 6 Game Theory © 2006 Thomson Learning/South-Western.
Part I. Principles A.Markets B.Market failure C.Discounting & PV D.Dynamic efficiency E.Pollution solutions.
4 Why Should we Believe Politicians? Lupia and McCubbins – The Democratic Dilemma GV917.
Game Theory “Necessity never made a good bargain.” - Benjamin Franklin Mike Shor Lecture 13.
1 Unless otherwise noted, the content of this course material is licensed under a Creative Commons Attribution – Non-Commercial 3.0 License.
Game Theory The study of rational behavior among interdependent agents Agents have a common interest to make the pie as large as possible, but Agents have.
Games People Play. 8: The Prisoners’ Dilemma and repeated games In this section we shall learn How repeated play of a game opens up many new strategic.
Chapter 6 © 2006 Thomson Learning/South-Western Game Theory.
EC941 - Game Theory Prof. Francesco Squintani Lecture 8 1.
Chapter 16 Negotiation 1.Costly Agreements 2.Ultimatum game with Incomplete Information 3.Counteroffers with Incomplete Information 4.The revelation principle.
Chapter 11 Game Theory and Asymmetric Information
QR 38, 2/8/07 Elements of games I.The Columbus game II.Basic questions III.Terms.
David Bryce © Adapted from Baye © 2002 Game Theory: The Competitive Dynamics of Strategy MANEC 387 Economics of Strategy MANEC 387 Economics.
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Review Midterm3/21 3/7.
17. backward induction – ultimatums and bargaining take it or leave it offers. Two players. Split a dollar. (s,1-s) offer to 2. if accepts get (s,1-s).
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.
QR 38, 2/6/07 Overview of game theory I. Strategic interaction II. Game theory and international relations III. Deterrence.
Game Theory Here we study a method for thinking about oligopoly situations. As we consider some terminology, we will see the simultaneous move, one shot.
QR 38 3/20/07, More on repeated games in IR I.Folk theorem II.Other solutions to the PD III.Repeated PDs in practice.
Lecture Slides Dixit and Skeath Chapter 4
1 Section 2d Game theory Game theory is a way of thinking about situations where there is interaction between individuals or institutions. The parties.
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Review Midterm3/23 3/2.
QR 38, 2/22/07 Strategic form: dominant strategies I.Strategic form II.Finding Nash equilibria III.Strategic form games in IR.
QR 38 3/15/07, Repeated Games I I.The PD II.Infinitely repeated PD III.Patterns of cooperation.
Basic principle of finance money loses value as time goes on - in other words $100 today is worth more than $100 in a month (assuming ‘normal’ market conditions)
Bargaining over the Delta Michael Hanemann
Quantitative Reasoning 38 The Strategy of International Politics Professor Lisa Martin Head TF Yev Kirpichevsky TF Dilyan Donchev.
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Review Midterm3/19 3/5.
The Agencies Method for Coalition Formation in Experimental Games John Nash (University of Princeton) Rosemarie Nagel (Universitat Pompeu Fabra, ICREA,
Games People Play. 13: Bargaining In this section we shall learn How to break down a bargain into its fundamental determinants. Four ways a bargain may.
Chapter 12 & Module E Decision Theory & Game Theory.
“Life must be understood backward, but … it must be lived forward.”
Dynamic Games of complete information: Backward Induction and Subgame perfection - Repeated Games -
Bargaining Whoever offers to another a bargain of any kind, proposes to do this. Give me that which I want, and you shall have this which you want …; and.
Unions and Collective Bargaining Topic 4 Part I. Topic Outline Bargaining Models under Complete Information Applied to Collective Bargaining Nash’s Cooperative.
QR 38, 3/1/07 and 3/8/07 Mixed strategies I.Keeping the opponent indifferent II.Finding a mixed strategy equilibrium III.Odds ratios IV.Mixing in practice.
Negotiation 101 Fairness and the importance of looking ahead.
Topic 3 Games in Extensive Form 1. A. Perfect Information Games in Extensive Form. 1 RaiseFold Raise (0,0) (-1,1) Raise (1,-1) (-1,1)(2,-2) 2.
Dividing Mixed Numbers © Math As A Second Language All Rights Reserved next #7 Taking the Fear out of Math
제 10 장 게임이론 Game Theory: Inside Oligopoly
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.
© 2009 South-Western, a part of Cengage Learning, all rights reserved C H A P T E R Oligopoly.
1 Bargaining & Markets u Two populations: Buyers and Sellers u A sellers has 1 indivisible unit to sell u A Buyer has 1 unit of divisible money u If they.
Example 31: Solve the following game by equal gains method: Y I II I II I X II II
Bargaining games Econ 414. General bargaining games A common application of repeated games is to examine situations of two or more parties bargaining.
By: Donté Howell Game Theory in Sports. What is Game Theory? It is a tool used to analyze strategic behavior and trying to maximize his/her payoff of.
Nash Bargaining Solution and Alternating Offer Games MIT Game Theory.
1 Fahiem Bacchus, University of Toronto CSC384: Intro to Artificial Intelligence Game Tree Search I ● Readings ■ Chapter 6.1, 6.2, 6.3, 6.6 ● Announcements:
BUS 525: Managerial Economics Game Theory: Inside Oligopoly
Lecture V: Bargaining Recommended Reading: Dixit & Skeath, Chapter 17 Osborne, Chapter 6.1, 16 Powell, In the Shadow of Power, Ch. 3.
Q 2.1 Nash Equilibrium Ben
Management support systems II
Somebody’s got to do it. Somebody’s got to do it.
Game Theory: The Competitive Dynamics of Strategy
THE ECONOMY: THE CORE PROJECT
Game Theory: The Nash Equilibrium
Presentation transcript:

QR 38 Bargaining, 4/24/07 I. The bargaining problem and Nash solution II. Alternating offers models

I. The bargaining problem and Nash solution Bargaining constant in IR, but haven’t said much directly about it. What exactly is bargaining; how to represent it using game theory? Bargaining is in large part a coordination problem. Two parties need to agree on the distribution of a good. Many equilibria, but disagreement over which is preferred (distributional conflict).

Bargaining problems But failure to reach an agreement leaves all parties worse off. So bargaining involves: 1.Potential for mutual gains 2.Conflict over how to divide these gains Bargaining is not zero-sum: a surplus exists, compared to the situation where no bargain is reached.

Solutions A solution to a bargaining problem involves: Specification of situations in which a bargain will be reached How the surplus will be divided Most models, and Schelling’s discussion, focus on the second question

Types of bargaining models Two types of bargaining models, drawing on cooperative and non-cooperative game theory. Nash devised a cooperative solution Later the Nash bargaining solution was shown to be the equilibrium of a non- cooperative game as well

Two-player bargaining model Consider a two-person bargaining situation. If the parties reach an agreement, they get a total value v to split between themselves. If they don’t reach an agreement, A gets a and B gets b.

Payoffs a and b are called backstop payoffs, BATNA, or reservation points. Often set these equal to zero to simplify the problem. The surplus equals the total benefit from reaching an agreement: surplus=v-a-b

Solutions Assume that each player gets BATNA plus a fraction of the surplus: A gets the fraction h B gets k (=1-h). Let x be the total A gets: –x=a+h(v-a-b) –x-a=h(v-a-b) –This says that the additional benefit A gets from an agreement (x-a) is some fraction h of the total surplus.

Solutions Let y be the total B gets: –y=b+k(v-a-b) –y-b=k(v-a-b) (the benefit B gets is fraction k of the surplus) These are the Nash formulas. Think of them as dividing the surplus in the proportion h:k Can write (y-b)/(x-a)=k/h –Then think of k/h as the slope of the line specifying the solutions

Nash bargaining solution A’s payoff (x) B’s payoff (y) a b (a, b) Line with slope k/h v(=x+y) v Q a’ (a’, b) Q’

Nash bargaining solution A nice way to think about the problem, but it doesn’t tell us where h and k come from. Can think of h and k as bargaining strengths. Need more context to use this solution. –Nash assumed h=k; then get determinate solution for x and y.

Nash bargaining solution Note that being able to move the reversion point (a,b) in your direction provides you with a higher payoff. What would this mean in IR? –Usually making a threat that would hurt yourself if you had to implement it, like a trade war.

II. Alternating offers model To get more insight, need a model with more context. An important general model is an alternating offers model. A dynamic model, with some number of periods.

Alternating offers model In each period, one player has the opportunity to make an offer to the other. The other can accept or make a counteroffer. This process continues until an offer has been made and accepted.

Alternating offers model With a finite number of periods, can use rollback to find the equilibrium. But in an infinitely-repeated game, why would this process ever end? Have to assume that the surplus becomes less valuable over time; discounting. –This could result because the surplus itself is shrinking (some probability it will disappear, e.g.), or because the players are impatient. –The two are conceptually similar, although D&S present separately.

Solving alternating offers model Assume that two players are bargaining over the division of a dollar. A dollar tomorrow is as good as having only 95 cents today. –Remember how we used discount factors to address situations like this (repeated games). Assume BATNAs are zero.

Solving alternating offers The player making the offer suggests that he gets x. We want to solve for x using backward induction That is, x is the equilibrium outcome. Let A start. A knows that B will get x in the next round, because x is the equilibrium payoff to the player making the offer. So A has to offer something today that is worth the same as getting x in the next round.

Solving alternating offers So A has to offer B 0.95x now. Leaves A with x. But we called what A is offering x: So x=1-0.95x x=1/1.95 x=0.512 So, the equilibrium is for the player who gets to make the first offer to get The player who goes second will get =0.488

Solution The equilibrium is reached immediately even though an unlimited number of counteroffers are allowed That is, the outcome is efficient; the surplus does not decay. A first-mover advantage results: the player making the first offer gets more (x>1/2).

Solution with different discount rates This example assumed that the two players had the same discount factor (.95). What if the two players have different discount rates? For A, let a dollar tomorrow may be worth only 0.90 today. B’s discount rate is.95. –So A is willing to accept a smaller amount in order to be paid sooner. In equilibrium, the more impatient player gets less.

Different discount rates Let x be the amount A gets when he goes first Let y be the amount B gets when he starts A has to offer B 0.95y. –So x=1-0.95y B has to offer A 0.90x –So y=1-0.90x

Different discount rates We can solve these equations for x and y: x=1-.95y y=1-.9x x=1-.95(1-.9x)= x= x.145x=.05 x=0.345 y=1-.9(.345)=0.690

Different discount rates So if A goes first, A gets.345 and B gets =.655 If B goes first, A gets.31 and B gets.69 So A gets less than B because of impatience, even if A goes first

Generalized solution A sees $1 today as worth $(1+r) tomorrow B sees $1 today as worth $(1+s) tomorrow Means that A sees $1 tomorrow as worth $1/(1+r) today x=(s+rs)/(r+s+rs) y=(r+rs)/(r+s+rs)

Generalized solution rs is usually very small So it is approximately true that x=s/(r+s) y=r/(r+s) Then we can see x and y as the shares that go to each player (verify that x+y=1). Write as y/x=r/s The shares that players get are inversely proportional to their rates of impatience.

Solution a=1/(1+r) b=1/(1+s) When A makes an offer, has to give B the equivalent of getting y the next period; this is by. So: x=1-by y=1-ax x=1-b(1-ax)=1-b+abx x-abx=1-b x(1-ab)=1-b

Solution x=(1-b)/(1-ab)=(1-(1/1+s))/(1-(1/1+r)(1/1+s)) =(1+s-1)/(1+s-(1/1+r))=s/(1+s-(1/1+r)) =s(1+r)/((1+r)+s(1+r)-1) =(s+rs)/(1+r+s+rs-1) =(s+rs)/(r+s+rs)  s/(r+s) y=(r+rs)/(r+s+rs)  r/(r+s)