Working Some Problems. Problem 3.10 Students 1 and 2 can each exert study levels {1,2,3,4,5}. Student 1’s exam score will be X+1.5 with effort level x.

Slides:



Advertisements
Similar presentations
The Random Dresser Wilbur has – 3 left shoes, all of different colors – 5 right shoes, all of different colors – 4 right gloves, all of different colors.
Advertisements

N-Player Games. A symmetric N-person game. 1)All players have same strategy sets 2)If you switch two players strategies, you switch their payoffs and.
Private Information and Auctions. Auction Situations Private Value – Everybody knows their own value for the object – Nobody knows other peoples values.
Some Problems from Chapt 13
Nash Equilibrium: Illustrations
EC941 - Game Theory Prof. Francesco Squintani Lecture 4 1.
CPS Bayesian games and their use in auctions Vincent Conitzer
Pondering more Problems. Enriching the Alice-Bob story Go to AGo to B Go to A Alice Go to B Go to A Go to B Go shoot pool Alice.
Game Theory Assignment For all of these games, P1 chooses between the columns, and P2 chooses between the rows.
ECON 100 Tutorial: Week 9 office: LUMS C85.
Private Information and Auctions
Mechanism Design without Money Lecture 1 Avinatan Hassidim.
Clicker Question-A Chicken Game 0, 0 0, 1 1, 0 -10, -10 Swerve Hang Tough Swerve Hang Tough Player 2 Pllayer 1 Does either player have a dominant strategy?
PlayerFirst choice Second Choice Third Choice Fourth Choice Fifth Choice Boromir FrodoNobodyLegolasGimli FrodoNobodyBoromirLegolas FrodoNobodyGimliBoromir.
Auctions. Strategic Situation You are bidding for an object in an auction. The object has a value to you of $20. How much should you bid? Depends on auction.
Econ 805 Advanced Micro Theory 1 Dan Quint Fall 2007 Lecture 2 – Sept
Multi-item auctions with identical items limited supply: M items (M smaller than number of bidders, n). Three possible bidder types: –Unit-demand bidders.
For any player i, a strategy weakly dominates another strategy if (With at least one S -i that gives a strict inequality) strictly dominates if where.
EC3224 Autumn Lecture #04 Mixed-Strategy Equilibrium
Upper hemi-continuity Best-response correspondences have to be upper hemi-continuous for Kakutani’s fixed-point theorem to work Upper hemi-continuity.
Introduction to Game Theory
Working Some Problems. Telephone Game How about xexed strategies? Let Winnie call with probability p and wait with probability 1-p. For what values of.
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.
Wyatt Earp and the Gun Slinger
ECO290E: Game Theory Lecture 4 Applications in Industrial Organization.
An Introduction to Game Theory Part I: Strategic Games
GAME THEORY.
Nash Equilibrium: Theory. Strategic or Simultaneous-move Games Definition: A simultaneous-move game consists of: A set of players For each player, a set.
Dominance. Overview In this unit, we explore the notion of dominant strategies Dominance often requires weaker views of rationality than does standard.
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.
More on Extensive Form Games. Histories and subhistories A terminal history is a listing of every play in a possible course of the game, all the way to.
Games of pure conflict two person constant sum. Two-person constant sum game Sometimes called zero-sum game. The sum of the players’ payoffs is the same,
Reviewing Bayes-Nash Equilibria Two Questions from the midterm.
Final Lecture. ``Life can only be understood backwards; but it must be lived forwards.” Søren Kierkegaard Thoughts on subgame perfection?
Static Games and Cournot Competition
Dominant strategies Econ 171. Clicker Question 1, 3 5, 3 2, 4 7, 2 Player 2 Strategy A Strategy B Player 1 Strategy A Strategy B A ) Strategy A strictly.
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.
Nash Equilibrium Econ 171. Suggested Viewing A Student’s Suggestion: Video game theory lecture Open Yale Economics Ben Pollack’s Game Theory Lectures.
6.1 Consider a simultaneous game in which player A chooses one of two actions (Up or Down), and B chooses one of two actions (Left or Right). The game.
1 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.
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.
1 Section 2d Game theory Game theory is a way of thinking about situations where there is interaction between individuals or institutions. The parties.
Static Games of Complete Information: Subgame Perfection
EC941 - Game Theory Francesco Squintani Lecture 3 1.
Introduction to Game Theory
Dominant strategies. Clicker Question 1, 3 5, 3 2, 4 7, 2 Player 2 Strategy A Strategy B Player 1 Strategy A Strategy B A ) Strategy A strictly dominates.
Nash equilibrium Nash equilibrium is defined in terms of strategies, not payoffs Every player is best responding simultaneously (everyone optimizes) This.
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.
Chapters 29, 30 Game Theory A good time to talk about game theory since we have actually seen some types of equilibria last time. Game theory is concerned.
3.1.4 Types of Games. Strategic Behavior in Business and Econ Outline 3.1. What is a Game ? The elements of a Game The Rules of the Game:
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.
Final Lecture. Problem 2, Chapter 13 Exploring the problem Note that c, x yields the highest total payoff of 7 for each player. Is this a Nash equilibrium?
Strategic Behavior in Business and Econ Static Games of complete information: Dominant Strategies and Nash Equilibrium in pure and mixed strategies.
Auctions serve the dual purpose of eliciting preferences and allocating resources between competing uses. A less fundamental but more practical reason.
Auctions serve the dual purpose of eliciting preferences and allocating resources between competing uses. A less fundamental but more practical reason.
Games of pure conflict two-person constant sum games.
Pondering more Problems. Enriching the Alice-Bob story Go to AGo to B Go to A Alice Go to B Go to A Go to B Go shoot pool Alice.
Choose one of the numbers below. You will get 1 point if your number is the closest number to 3/4 of the average of the numbers chosen by all class members,
Microeconomics Course E John Hey. Examinations Go to Read.
Incomplete Information and Bayes-Nash Equilibrium.
Games, Strategies, and Decision Making By Joseph Harrington, Jr. First Edition Chapter 4: Stable Play: Nash Equilibria in Discrete Games with Two or Three.
Oil Lease Auctions and the Winners’ Curse. Geologists’ estimates of value differ widely Company that makes highest estimate bids the highest. Often loses.
Game theory basics A Game describes situations of strategic interaction, where the payoff for one agent depends on its own actions as well as on the actions.
Working Some Problems.
Nash Equilibrium: Theory
Bidding on an Antique.
Games Of Strategy Chapter 4 Dixit, Skeath, and Reiley
THE ECONOMY: THE CORE PROJECT
Game Theory: Day 6 What is Free Will?.
Presentation transcript:

Working Some Problems

Problem 3.10 Students 1 and 2 can each exert study levels {1,2,3,4,5}. Student 1’s exam score will be X+1.5 with effort level x. Student 2’s score will be x with effort level x. High score gets A, low score gets B. Payoff if your effort level is x and you get an A is 10-x. If your effort level is x and you get a B, payoff is 8-x.

What can we do with IDSDS? What is the lowest payoff you could get with effort level 0? What strategies are therefore strictly dominated?

What is left? ,810, 78, 8 19, 89, 79, 6 28, 88, 78, 6 Student 2 Student 1

More elimination Now 1 dominates 2 for student 1 0 dominates 1 for student , 88,8 19, 89,6 Student 2 Student 1

What now? What is (are) Nash equilibrium? What survives IDWDS? How do you interpret this?

Problem players each choose a number from 0 to 8. A player wins $100 if his number is exactly ½ of the average of the numbers chosen by the other 9 players. Solve for strategies that survive IDSDS. This should read IDWDS. (IDSDS won’t take you far.)

IDWDS Any number bigger than 4 is weakly dominated. Why? If nobody chooses a number bigger than 4, then 3 and 4 are weakly dominated. If nobody chooses a number bigger than 2, then 1 weakly dominates 2. If everybody chooses 0 or 1, then 0 dominates 1. Why? 1 will never win. 0/2=0, so 0 will win if everybody chooses 0.

Slight alteration to problem Suppose payoff is $1 if you answer 1 and 1 is not half of the average. Now what survives IDSDS?

Auctioning the crown jewels

The auction Two bidders, Sheik and Sultan Sultan can bid odd number 1,3,5,7,9 Sheik can bid even number 2,4,6,8 Jewels are worth 8 to Sultan, and 7 to Sheik Bidders submit a single sealed-bid. Jewels go to the high bidder at price he bids.

Payoff matrix ,50,30,10,-10,-3 35,00,30,10,-10,-2 53,0 0,10,-10,-2 71,0 0,-10,-2 9-1,0 0,-2 Sultan Sheik V is 8 V is 7

Nash equilibria Sultan bids 7, sheik either 6, 4, or 2

Problem 4.15 (payoffs to firm 1) 1234never never00000

Problem 4.15 full payoff matrix (by symmetry) 1234never 1-20, , -9-2, -216, 140, 0 2-9, -14-9, -93, -221, 145, 0 3-2,-2-2, 3-2, -216, 140, 0 41, 161, 211, 161, 125, 0 never0, 400, 450, 400, 250, 0 What strategies are strictly dominated?

Reduced payoff matrix , -93, -221, 1 3-2, 3-2, -216, 1 41, 211, 161, 1 Anything strictly dominant now? Are there any Nash equilibria? Describe the Nash equilibrium strategy profiles.

Problem 5.1a Players can request either $20 or $100. If fewer than 20% request $100, everybody gets what they asked for. If 20% or more request $100, everybody gets nothing. If there are 100,000 players, what are the Nash equilibria?

Clicker question A)All of the Nash equilibria have 20,000 requesting $100 and 80,000 requesting $20. B)All of the Nash equilibria have 19,999 requesting $100 and 81,001 reqeusting $20. C)The Nash equilibria include all outcomes where 20,001 or more people request $100 as well as the outcome where 19,999 demand $100. D)The Nash equilibria include all outcomes where 19,999 or more people request $100.

Problem 5.1b Players can request $20, request $100 or make no request. In order to make a request you have to pay $ If fewer than 20% of all players request $100, everybody gets what they asked for. If 20% or more request $100, everybody gets nothing. If there are 100,000 players, what are the Nash equilibria?

Clicker question With 100,000 players A)The only Nash equilibria have 19,999 requesting $20 and no players requesting $100. B) The only Nash equilibria have 19,999 requesting $100 and no players requesting $20. C)All of the Nash equilibria have 19,999 requesting $100 and 81,001 requesting $20. D)The Nash equilibria include all outcomes where 19,999 or more people request $100

Problem 5.1c Players can request $20, request $100 or make no request. In order to make a request you have to pay $ If fewer than 20% of all players request $100, everybody gets what they asked for. If 20% or more request $100, everybody gets nothing. If there are 100,000 players, what are the Nash equilibria?

Clicker question With 100,000 players A)The only Nash equilibria have 19,999 requesting $20 and no players requesting $100. B) The only Nash equilibria have 19,999 requesting $100 and no players requesting $20. C)All of the Nash equilibria have 19,999 requesting $100 and 81,001 requesting $20. D)The Nash equilibria include all outcomes where 19,999 or more people request $100

Problem 5.3 Commuting problem Cost of taking the toll road is 10 +x where x is the number who take the toll road. Cost of taking back road is 2y where y is the number who take the back road. There are 100 drivers in all and drivers must take one of these roads, so y=100-x. Find Nash equilibrium or equilibria.

First cut at problem Is there an outcome where drivers are indifferent about which road to take? If there is, it would be a Nash equilibrium, since if you went the other way it would take longer than going the way you are going. Indifference if 10+x=2 y =2(100-x). x=200-2x-10, so 3x=190, x=63.33 Not an integer. Now what.

Systematic answer In Nash equilibrium, it must also be that those who take back road are better off than if they switched to toll road. Currently cost to a back road guy is 2(100-x). If he took the toll road there would be x+1 people on the toll road. So staying on the back road is best response if 2(100-x)≤10+x+1 which implies 189≤3x and hence 63≤x.

Also: In Nash equilibrium, those who take toll road are better off than they would be if they switched to back road. If they switched to the back road then there would be 100-(x-1)=101-x drivers on the back road. This implies that 10+x≤2(101-x) or equivalently 3x≤192, or x≤64

So when is there a Nash equilibrium? When x≥63 and x≤64. Both are true if and only if x=63 or x=64. There is a Nash equilibrium if 63 take toll road and 37 take the back road. There is another Nash equilibrium if 64 take toll road and 36 take back road.

Ordering dinner

Diners’ Dilemma—The Menu ItemValuePrice Pasta$2114 Salmon$2621 Filet Mignon $2930

Strategic Form Payoffs: Two diners split the bill StrategyPastaSalmonSteak Pasta 7, 73.5, , 7 Salmon 8.5, 3.5 5, 5.5, 3.5 Steak7, ,.5 -1,-1 Diner 1 Diner 2

What if there are 4 diners? Lets think about it in a more general way. What does it cost me to order steak rather than pasta? My share of the bill goes up by (30-14)/4=4. Value to me of having steak rather than pasta is 29-21=8. So, no matter what the other guests are doing, I am better off ordering steak than pasta.

How about ordering salmon? If I order steak rather than salmon, my bill goes up by (30-21)/4=2.25. The value to me of my meal goes up by 29-26=3. This is true no matter what the other guests are ordering. So I am better off ordering steak than either salmon or pasta. Ordering steak is a dominant strategy for all players. The strategy profile where all order steak is the only Nash equilibrium.

A lousy outcome In the only Nash equilibrium, they all order steak, even though they would all be better off What do we make of this? Does this imply that Nash equilibrium is a useless concept?

Good luck on your midterm!

Protest game N citizens, different ones value protesting differently. Order them by value of protest v1>v2>…vN We can draw a “demand curve” for protesting: How many people would protest if cost is p. We also have something like a “supply curve”. What does it cost to protest if x people are protesting.

Lets draw them Two downward-sloping curves. Where is equilibrium? There can be more than one equilibrium.