UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Review Midterm3/21 3/7.

Slides:



Advertisements
Similar presentations
An Introduction to Game Theory Part V: Extensive Games with Perfect Information Bernhard Nebel.
Advertisements

Ultimatum Game Two players bargain (anonymously) to divide a fixed amount between them. P1 (proposer) offers a division of the “pie” P2 (responder) decides.
M9302 Mathematical Models in Economics Instructor: Georgi Burlakov 3.1.Dynamic Games of Complete but Imperfect Information Lecture
Infinitely Repeated Games. In an infinitely repeated game, the application of subgame perfection is different - after any possible history, the continuation.
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.
Negotiation A Lesson in Multiagent System Based on Jose Vidal’s book Fundamentals of Multiagent Systems Henry Hexmoor SIUC.
Game Theory: Inside Oligopoly
ECO290E: Game Theory Lecture 9 Subgame Perfect Equilibrium.
1 Deter Entry. 2 Here we see a model of deterring entry by an existing monopoly firm. We will also introduce the notion of a sequential, or dynamic, game.
M9302 Mathematical Models in Economics Instructor: Georgi Burlakov 3.1.Dynamic Games of Complete but Imperfect Information Lecture
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.
EC941 - Game Theory Prof. Francesco Squintani Lecture 8 1.
EC102: Class 9 Christina Ammon.
Todd and Steven Divide the Estate Problem Bargaining over 100 pounds of gold Round 1: Todd makes offer of Division. Steven accepts or rejects. Round.
Chapter 11 Game Theory and Asymmetric Information
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).
B OUNDED R ATIONALITY in L ABORATORY B ARGAINING with A SSYMETRIC I NFORMATION Timothy N. Cason and Stanley S. Reynolds Economic Theory, 25, (2005)
The Bargain 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 …;
QR 38 Bargaining, 4/24/07 I. The bargaining problem and Nash solution II. Alternating offers models.
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Review Midterm3/19 3/12.
Extensive-form games: applications Stackelberg model Spence-Dixit model Rubinstein bargaining model.
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.
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.
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.
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 II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Review Midterm3/19 3/5.
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Bargaining and Negotiation Review.
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Bargaining and Negotiation Review.
Introduction to Game Theory
Reading Osborne, Chapters 5, 6, 7.1., 7.2, 7.7 Learning outcomes
Dynamic Games of complete information: Backward Induction and Subgame perfection - Repeated Games -
EC941 - Game Theory Prof. Francesco Squintani Lecture 5 1.
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.
Dynamic Games & The Extensive Form
Todd and Steven Divide the Estate Problem Bargaining over 100 pounds of gold Round 1: Todd makes offer of Division. Steven accepts or rejects. Round.
Negotiation 101 Fairness and the importance of looking ahead.
Lecture 7 Course Summary The tools of strategy provide guiding principles that that should help determine the extent and nature of your professional interactions.
Extensive Games with Imperfect Information
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.
Chapter ElevenCopyright 2009 Pearson Education, Inc. Publishing as Prentice Hall. 1 Chapter 11 Game Theory and Asymmetric Information.
제 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.
Subgames and Credible Threats (with perfect information) Econ 171.
Chapter 6 Extensive Form Games With Perfect Information (Illustrations)
Dynamic games, Stackelburg Cournot and Bertrand
Extensive Form Games With Perfect Information (Illustrations)
Chapter 16 Oligopoly and Game Theory. “Game theory is the study of how people behave in strategic situations. By ‘strategic’ we mean a situation in which.
Bargaining games Econ 414. General bargaining games A common application of repeated games is to examine situations of two or more parties bargaining.
Extensive Form (Dynamic) Games With Perfect Information (Theory)
Econ 545, Spring 2016 Industrial Organization Dynamic Games.
Entry Deterrence Players Two firms, entrant and incumbent Order of play Entrant decides to enter or stay out. If entrant enters, incumbent decides to fight.
Dynamic Game Theory and the Stackelberg Model. Dynamic Game Theory So far we have focused on static games. However, for many important economic applications.
ECO290E: Game Theory Lecture 10 Examples of Dynamic Games.
Second lecture: The theory of monopoly, monopsony and bilateral monopoly: the standard microeconomic theory and its limits. Third lecture: The theory of.
Dynamic Games of complete information: Backward Induction and Subgame perfection.
Lecture V: Bargaining Recommended Reading: Dixit & Skeath, Chapter 17 Osborne, Chapter 6.1, 16 Powell, In the Shadow of Power, Ch. 3.
Somebody’s got to do it. Somebody’s got to do it.
Examples of Laboratory Experiments
Games & Politics Evgeniya Lukinova.
Managerial Economics Kyle Anderson
Learning 6.2 Game Theory.
Alternative-offer bargainging
Molly W. Dahl Georgetown University Econ 101 – Spring 2009
UNIT II: The Basic Theory
Presentation transcript:

UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Review Midterm3/21 3/7

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 it is this manner that we obtain from one another the far greater part of those good offices we stand in need of. It is not from the benevolence of the butcher, the brewer, or the baker that we expect our dinner, but from their regard to their own interest. -- A. Smith, 1776

Bargaining We Play a Game Bargaining Games Subgame Perfection Alternating Offers and Shrinking Pies

We Play a Game PROPOSER RESPONDERPlayer # ____ Offer $ _____ Accept Reject

The Ultimatum Game OFFERS REJECTED ACCEPTED N = 20 Mean = $ Offers > 0 Rejected 1 Offer < 1.00 (20%) Accepted (3/6/00)

The Ultimatum Game OFFERS REJECTED ACCEPTED N = 33 Mean = $ Offers > 0 Rejected 1 Offer < $1 (20%) Accepted (2/28/01)

The Ultimatum Game OFFERS REJECTED ACCEPTED N = 37 Mean = $ Offers > 0 Rejected* 3 Offers < $1 (20%) Accepted (2/27/02) * 1 subject offered 0

The Ultimatum Game OFFERS REJECTED ACCEPTED N = 12 Mean = $ Offers > 0 Rejected 0 Offers < 1.00 (20%) Accepted (7/10/03)

The Ultimatum Game OFFERS REJECTED ACCEPTED N = 17 Mean = $ Offers > 0 Rejected 0 Offers < 1.00 (20%) Accepted (3/10/04)

The Ultimatum Game OFFERS REJECTED ACCEPTED N = 12 Mean = $ Offers > 0 Rejected 1 Offer < 1.00 (20%) Accepted (3/9/05)

The Ultimatum Game OFFERS REJECTED ACCEPTED N = 131 Mean = $ Offers > 0 Rejected 6/26 Offers < 1.00 (20%) Accepted Pooled data

The Ultimatum Game P 1 P /9 4/4 25/27 2/2 3/3 20/28 13/15 N = 131 Mean = $ Offers > 0 Rejected 6/26 Offers < 1.00 (20%) Accepted Pooled data 6/7 3/17

The Ultimatum Game P 1 P What is the lowest acceptable offer? 9/9 4/4 25/27 2/2 3/3 20/28 13/15 N = 131 Mean = $ Offers > 0 Rejected 6/26 Offers < 1.00 (20%) Accepted Pooled data 6/7 3/17

The Ultimatum Game Theory predicts very low offers will be made and accepted. Experiments show: Mean offers are 30-40% of the total Mode = 50% Offers <20% are rare and usually rejected Guth Schmittberger, and Schwarze (1982) Kahnemann, Knetsch, and Thaler (1986) Also, Camerer and Thaler (1995)

The Ultimatum Game Theory predicts very low offers will be made and accepted. Experiments show: Mean offers are 30-40% of the total Mode = 50% Offers <20% are rare and usually rejected Guth Schmittberger, and Schwarze (1982) Kahnemann, Knetsch, and Thaler (1986) Also, Camerer and Thaler (1995) How would you advise Proposer? What do you think would happen if the game were repeated?

The Ultimatum Game How can we explain the divergence between predicted and observed results? Stakes are too low Fairness –Relative shares matter –Endowments matter –Culture, norms, or “manners” People make mistakes Time/Impatience

Bargaining Games Bargaining involves (at least) 2 players who face the the opportunity of a profitable joint venture, provided they can agree in advance on a division between them. Bargaining involves a combination of common as well as conflicting interests. The central issue in all bargaining games is credibility: the strategic use of threats, bluffs, and promises.

Bargaining Games P P 1 Disagreement point Two players have the opportunity to share $1, if they can agree on a division beforehand. Each writes down a number. If they add to $1, each gets her number; if not; they each get 0. Every division s.t. x + (1-x) = 1 is a NE. Divide a Dollar P 1 = x; P 2 = 1-x.

Subgame: a part (or subset) of an extensive game, starting at a singleton node (not the initial node) and continuing to payoffs. Subgame Perfect Nash Equilibrium (SPNE): a NE achieved by strategies that also constitute NE in each subgame. eliminates NE in which the players threats are not credible. selects the outcome that would be arrived at via backwards induction. Subgame Perfection

(0,0) (3,1) 1 2 Subgame Perfection (2,2) Chain Store Game A firm (Player 1) is considering whether to enter the market of a monopolist (Player 2). Player 2 can then choose to fight the entrant, or not. Enter Don’t Enter Fight Don’t Fight Subgame

(0,0) (3,1) 1 2 Subgame Perfection (2,2) Chain Store Game Enter Don’t Fight Don’t 0, 0 3, 1 2, 2 2, 2 Fight Don’t Enter Don’t NE = {(E,D), (D,F)}, but Fight for Player 2 is an incredible threat.

(0,0) (3,1) 1 2 Subgame Perfection (2,2) Chain Store Game Enter Don’t Fight Don’t 0, 0 3, 1 2, 2 2, 2 Fight Don’t Enter Don’t Subgame Perfect Nash Equilibrium (SPNE) = {(ED)}

A (ccept) 2 H (igh) 1 L (ow) R (eject) 5,5 0,0 8,2 0,0 Proposer (Player 1) can make High Offer (50-50%) or Low Offer (80-20%). Subgame Perfection Mini-Ultimatum Game

A (ccept) 2 H (igh) 1 L (ow) R (eject) H 5,5 0,0 5,5 0,0 L 8,2 0,0 0,0 8,2 AARRARRA 5,5 0,0 8,2 0,0 Subgame Perfect Nash Equilibrium SPNE = {(L,AA)} (H,AR) and (L,RA) involve incredible threats. Subgame Perfection Mini-Ultimatum Game

2 H 1 L 2 H 5,5 0,0 5,5 0,0 L 8,2 1,9 1,9 8,2 5,5 0,0 8,2 1,9 AARRARRA Subgame Perfection

2 H 1 L H 5,5 0,0 5,5 0,0 L 8,2 1,9 1,9 8,2 5,5 0,0 1,9 SPNE = {(H,AR)} AARRARRA Subgame Perfection

Alternating Offer Bargaining Game Two players are to divide a sum of money (S) is a finite number (N) of alternating offers. Player 1 (‘Buyer’) goes first; Player 2 (‘Seller’) can either accept or counter offer, and so on. The game continues until an offer is accepted or N is reached. If no offer is accepted, the players each get zero. A. Rubinstein, 1982

Alternating Offer Bargaining Game Two players are to divide a sum of money (S) is a finite number (N) of alternating offers. Player 1 (‘Buyer’) goes first; Player 2 (‘Seller’) can either accept or counter offer, and so on. The game continues until an offer is accepted or N is reached. If no offer is accepted, the players each get zero. 1 (a,S-a) 2 (b,S-b) 1 (c,S-c) (0,0)

Alternating Offer Bargaining Game 1 (a,S-a) 2 (b,S-b) 1 (4.99, 0.01) (0,0) S = $5.00 N = 3

Alternating Offer Bargaining Game 1 (4.99,0.01) 2 (b,S-b) 1 (4.99,0.01) (0,0) S = $5.00 N = 3 SPNE = (4.99,0.01) The game reduces to an Ultimatum Game

Now consider what happens if the sum to be divided decreases with each round of the game (e.g., transaction costs, risk aversion, impatience). Let S = Sum of money to be divided N = Number of rounds  = Discount parameter Shrinking Pie Game

S = $5.00 N = 3  = (a,S-a) 2 (b,S-b) 1 (c,S-c) (0,0)

Shrinking Pie Game S = $5.00 N = 3  = (3.74,1.26)2 (1.25, 1.25) 1 (1.24,0.01) (0,0) 1

Shrinking Pie Game S = $5.00 N = 4  = (3.13,1.87)2 (0.64,1.86) 1 (0.63,0.62) 2 (0.01, 0.61) (0,0) 1

Shrinking Pie Game P 1 P N = 1 (4.99, 0.01) 2(2.50, 2.50) 3(3.74, 1.26) 4(3.13, 1.87) 5(3.43, 1.57)… This series converges to (S/(1+  ), S – S/(1+  )) = (3.33, 1.67) This pair {S/(1+  ),S-S/(1+  )} are the payoffs of the unique SPNE. for  = ½

Shrinking Pie Game Optimal Offer (O*) expressed as a share of the total sum to be divided = [S-S/(1+  )]/S O* =  /(1+  SPNE = {1- [  /(1+  )],  /(1+  )} Thus both  =1 and  =0 are special cases of Rubinstein’s model: When  =1 (no bargaining costs), O* = 1/2 When  =0, game collapses to the ultimatum version and O* = 0 (+  )

Shrinking Pie Game

Bargaining & Negotiation Bargaining games are fundamental to understanding the price determination mechanism in “small” markets. The central issue in all bargaining games is credibility: the strategic use of threats, bluffs, and promises. When information is asymmetric, profitable exchanges may be “left on the table.” In such cases, there is an incentive to make oneself credible (e.g., appraisals; audits; “reputable” agents; brand names; lemons laws; “corporate governance”).

Bargaining & Negotiation In real-world negotiations, players often have incomplete, asymmetric, or private information, e.g., only the seller of a used car knows its true quality and hence its true value. Making agreements is made all the more difficult “when trust and good faith are lacking and there is no legal recourse for breach of contract” (Schelling, 1960: 20). Rubinstein’s solution: If a bargaining game is played in a series of alternating offers, and if a speedy resolution is preferred to one that takes longer, then there is only one offer that a rational player should make, and the only rational thing for the opponent to do is accept it immediately!

Next Time 3/14Review 3/21MIDTERM