Social Choice Session 7 Carmen Pasca and John Hey.

Slides:



Advertisements
Similar presentations
Social Networks 101 P ROF. J ASON H ARTLINE AND P ROF. N ICOLE I MMORLICA.
Advertisements

Infinitely Repeated Games
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.
This Segment: Computational game theory Lecture 1: Game representations, solution concepts and complexity Tuomas Sandholm Computer Science Department Carnegie.
Chapter Twenty-Eight Game Theory. u Game theory models strategic behavior by agents who understand that their actions affect the actions of other agents.
Operations Research Assistant Professor Dr. Sana’a Wafa Al-Sayegh 2 nd Semester ITGD4207 University of Palestine.
The basics of Game Theory Understanding strategic behaviour.
1 Game Theory. By the end of this section, you should be able to…. ► In a simultaneous game played only once, find and define:  the Nash equilibrium.
Chapter 6 Game Theory © 2006 Thomson Learning/South-Western.
Chapter 6 Game Theory © 2006 Thomson Learning/South-Western.
EC3224 Autumn Lecture #04 Mixed-Strategy Equilibrium
What is a game?. Game: a contest between players with rules to determine a winner. Strategy: a long term plan of action designed to achieve a particular.
Game-theoretic analysis tools Necessary for building nonmanipulable automated negotiation systems.
Game Theory: Strategy and Equilibrium
Economics 202: Intermediate Microeconomic Theory 1.HW #6 on website. Due Thursday. 2.No new reading for Thursday, should be done with Ch 8, up to page.
An Introduction to Game Theory Part I: Strategic Games
2008/02/06Lecture 21 ECO290E: Game Theory Lecture 2 Static Games and Nash Equilibrium.
Chapter 6 © 2006 Thomson Learning/South-Western Game Theory.
Eponine Lupo.  Game Theory is a mathematical theory that deals with models of conflict and cooperation.  It is a precise and logical description of.
EC102: Class 9 Christina Ammon.
A camper awakens to the growl of a hungry bear and sees his friend putting on a pair of running shoes, “You can’t outrun a bear,” scoffs the camper. His.
Chapter 12 Choices Involving Strategy McGraw-Hill/Irwin Copyright © 2008 by The McGraw-Hill Companies, Inc. All Rights Reserved.
Algoritmi per Sistemi Distribuiti Strategici
Chapter Twenty-Eight Game Theory. u Game theory models strategic behavior by agents who understand that their actions affect the actions of other agents.
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Review Midterm3/19 3/12.
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.
An introduction to game theory Today: The fundamentals of game theory, including Nash equilibrium.
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.
An introduction to game theory Today: The fundamentals of game theory, including Nash equilibrium.
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.
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 II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Bargaining and Negotiation Review.
Today: Some classic games in game theory
An introduction to game theory Today: The fundamentals of game theory, including Nash equilibrium.
Game Theory Statistics 802. Lecture Agenda Overview of games 2 player games representations 2 player zero-sum games Render/Stair/Hanna text CD QM for.
ECON 2001 Microeconomics II nd semester Elliott Fan Economics, NTU Lecture 4 Microeconomics, Elliott Fan Lecture 4.
Dynamic Games of complete information: Backward Induction and Subgame perfection - Repeated Games -
Microeconomics 2 John Hey. Game theory (and a bit of bargaining theory) A homage to John Nash. Born Still alive (as far as Google knows). Spent.
Standard and Extended Form Games A Lesson in Multiagent System Based on Jose Vidal’s book Fundamentals of Multiagent Systems Henry Hexmoor, SIUC.
Bayes-Nash equilibrium with Incomplete Information.
Dynamic Games & The Extensive Form
Game-theoretic analysis tools Tuomas Sandholm Professor Computer Science Department Carnegie Mellon University.
Game Theory: introduction and applications to computer networks Game Theory: introduction and applications to computer networks Lecture 2: two-person non.
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.
Public Policy Analysis MPA 404 Lecture 24. Previous Lecture Graphical Analysis of Tariff and Quota Game Theory; The prisoner's Dilemma.
The Science of Networks 6.1 Today’s topics Game Theory Normal-form games Dominating strategies Nash equilibria Acknowledgements Vincent Conitzer, Michael.
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.
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.
Frank Cowell: Microeconomics Game Theory: Basics MICROECONOMICS Principles and Analysis Frank Cowell March 2004.
Mixed Strategies and Repeated Games
Strategic Behavior in Business and Econ Static Games of complete information: Dominant Strategies and Nash Equilibrium in pure and mixed strategies.
Intermediate Microeconomics Game Theory. So far we have only studied situations that were not “strategic”. The optimal behavior of any given individual.
5.1.Static Games of Incomplete Information
Managerial Economics Game Theory Aalto University School of Science Department of Industrial Engineering and Management January 12 – 28, 2016 Dr. Arto.
Lec 23 Chapter 28 Game Theory.
M9302 Mathematical Models in Economics Instructor: Georgi Burlakov 2.1.Dynamic Games of Complete and Perfect Information Lecture
ECONOMICS Paul Krugman | Robin Wells with Margaret Ray and David Anderson SECOND EDITION in MODULES.
Game theory Chapter 28 and 29
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.
Microeconomics Course E
Game theory Chapter 28 and 29
Choices Involving Strategy
Chapter 29 Game Theory Key Concept: Nash equilibrium and Subgame Perfect Nash equilibrium (SPNE)
Molly W. Dahl Georgetown University Econ 101 – Spring 2009
UNIT II: The Basic Theory
Lecture Game Theory.
Presentation transcript:

Social Choice Session 7 Carmen Pasca and John Hey

Strategic Decision Making: Game Theory Later on in the course (sessions 15 and 16) we will turn to Social Contract Theory. Some of that material will refer to the book by Ken Binmore Game Theory and the Social Contract (volumes 1 and 2) in which he draws heavily on Game Theory. To prepare ourselves for that, and for the material on Public Goods in sessions 8 and 9 (and some of session 10), we will in this session study the rudiments of Game Theory. We will study simple static games, sequential games, dynamic (repeated) games, and possibly evolutionary games. The key concept is that of a Nash Equilibrium in such games (not that we necessarily agree with it).

We start simple We begin by considering two person simultaneous-play games where each player has just two choices. We present the game with a payoff matrix. For example: Note that this is colour-coded. Player 2 LeftRight Player 1 Up16,1410,12 Down4,64,62,02,0

What does this mean? Let us define the rules and take our time. Players 1 and 2 choose independently and simultaneously. They get the payoffs colour-coded in the table. For example, if Player 1 chooses Up and Player 2 chooses Right then Player 1 gets payoff 10 and Player 2 gets payoff 12. Player 2 LeftRight Player 1 Up16,1410,12 Down4,64,62,02,0

Prediction in this game Here it is simple: Whatever player 2 chooses, it is best for Player 1 to choose Up. Whatever player 1 chooses, it is best for Player 2 to choose Left. Both players have a dominating choice. Prediction: (Up,Left). Player 2 LeftRight Player 1 Up16,1410,12 Down4,64,62,02,0

Here it is less simple Whatever player 2 chooses, it is best for Player 1 to choose Up. If Player 1 chooses Up (Down), it is best for Player 2 to choose Left (Right). What should Player 2 do? He/she can work out that Player 1 is going to choose Up so it is best for Player 2 to play Left. Prediction: Up, Left. This is a Nash Equilibrium (defined later). Player 2 LeftRight Player 1 Up16,1410,12 Down4,64,62,10

Even less simple If Player 1 chooses Up (Down), it is best for Player 2 to choose Left (Right). If Player 2 chooses Left (Right), it is best for Player 1 to choose Up (Down). Here Nash steps in. He defines a Nash Equilibrium as when each player is choosing his or her best given the choice of the other. Here we have two Nash Equilibria (Up,Left) and (Down,Right). In the previous two games just one both at (Up,Left). Player 2 LeftRight Player 1 Up16,142,12 Down4,64,68,10

Nash Equilibrium A general definition: A Nash Equilibrium in a two-person game is when each player is doing what is best for him or her given what the other player is doing. In this latter game there are two Nash Equilibrium. These are both NE in Pure Strategies. We can also have NE in Mixed Strategies – here players play probabilistically. There is an example in the next slide. Note that in this example there are no Nash Equilibria in pure strategies.

Mixed Strategy Nash Equilibrium Note that there are no Nash Equilibria in pure strategies. However there is a Nash Equilibrium in mixed strategies with Player 1 playing Up and Down with equal probabilities and Player 2 playing Left and Right with equal probabilities. Player 2 LeftRight Player 1 Up10,-10-10,10 Down-10,1010,-10

Asymmetric Mixed Strategy Nash Equilibrium Again there is no Nash Equilibrium in pure strategies. Suppose Player 1 plays Up with probability p and Player 2 plays Left with probability q. These must satisfy: 1q + 0(1-q) = 0q+ 3(1-q) and 2p + 5(1-p) = 4p + 2(1-p). (Why?) Hence p = ⅗ and q = ¾. Player 2 LeftRight Player 1 Up1,21,20,40,4 Down0,50,53,23,2

The Prisoner’s Dilemma This is a very famous example. It is very similar, as we will see, to the Public Goods game which we shall study in detail later. We start with general values where a>c d>b and b>a. Is there a unique NE in pure strategies? YES (Up,Left) Player 2 LeftRight Player 1 Upa,aa,ad,cd,c Downc,dc,db,bb,b

Now let us take some particular numbers Take a=10, c=0,b=20,d=30 (Up,Left) is the unique Nash Equilibrium. Note that both players have a dominant strategy. Note that (Down,Right) Pareto Dominates this. ( Better for both.) But it is not a Nash Equilibrium. Player 2 LeftRight Player 1 Up10,1030,0 Down0,3020,20

Now let us take some other numbers Take a=10, c=0,b=1000,d=1010 Again (Up,Left) is the unique Nash Equilibrium. Again that both players have a dominant strategy. Again (Down,Right) pareto dominates this. Again it is not a Nash Equilibrium. Player 2 LeftRight Player 1 Up10,101010,0 Down0, ,1000

Note the oddity The unique Nash Equilibrium is Pareto Dominated by (Down,Right) …. …the latter is simply better for both players… …but both have a direct incentive to play in a way that they end up at the Nash Equilibrium. What about pre-play communication? Both have an incentive to cheat on any pre-play agreement unless it is binding in some way. What about repetition? Let us suppose we play the game n times. To find the solution we need to backward induct.

Playing the game n times (n fixed and known) Players use Backward Induction In the n th play we get (Up,Left) as the NE. because of this in the (n-1) th play we get (Up,Left). … because of this in the 1 st play we get (Up,Left). Player 2 LeftRight Player 1 Up10,101010,0 Down0, ,1000

Other possibilities If we play the game an infinite or a random number of times we might get (Down,Right). Also we might get what is called a Tit for Tat strategy.Tit for Tat In this Player 1 plays Down until Player 2 plays Left, and plays Up until Player 2 plays Right… …and Player 2 plays Right until Player 1 plays Up, and plays Left until Player 1 plays Down. What happens with this Tit for Tat strategy is that we end up at (Down,Right) all the time. Jolly Good!

Change the rules from simultaneous to sequential Player 1 goes first and then Player 2: what happens? We end up still at (Up,Left). Why? Player 2 goes first and then Player 1: what happens? We end up still at (Up,Left). Why? Is this always true in whatever the game? Player 2 LeftRight Player 1 Up10,101010,0 Down0, ,1000

Other Games We have studied the solution concepts and some interesting games. Other games are of interest for economics. These include: Coordination Games (for example, Battle of the Sexes). Games of Competition. Games of Coexistence. Bargaining Games (we will meet these again later).

Battle of the Sexes (Coordination Game) Two NE in Pure Strategies: (Up,Left) and (Down,Right). Mixed Strategy NE with p=2/3 and q=2/9. If you had to predict behaviour in this game, what would you predict? Player 2 LeftRight Player 1 Up8,48,42,12,1 Down1,21,24,84,8

Competition Game If x<0 then NE is (Up,Left) If 0<x<1 then NE is (Down,Left) If x>1 no NE in pure strategies – there is a mixed NE with p and q depending on x. Player 2 LeftRight Player 1 Up0,00,02,-2 Downx,-x1,-1

The Hawk-Dove Game (Coexistence Game) Players are Bears. Up and Left is Hawk and Down and Right is Dove. Pure NE are (Left,Down) and (Up,Right). [(Down,Right) is not.] There is a mixed NE with p=4/9 and q=4/9. Prediction? Player 2 LeftRight Player 1 Up-5,-58,08,0 Down0,80,84,44,4

The Public Good Game We will come across this later. There are N people in society, each with an income m. They each independently and simultaneously and without communication choose an amount x to donate to the ‘public good’. The total amount donated is multiplied by some number k and distributed equally to everyone. So individual n gets (m-x n ) – what is left over of his income – plus k(x 1 +…+x 1 )/N. What do people contribute? Game theory/Nash Equilibrium???

Let us take a simple example Three people in society (N=3) each with income 100. Suppose the multiplier, k, is 2. Suppose 1 donates 0, 2 donates 50 and 3 donates 100. Total public good is 150. Multiplied by 2 it becomes 300. When distributed equally everyone gets 100. Thus: 1 ends up with = ends up with = ends up with = 100. What do you think is the Nash Equilibrium? What is the Social Optimum?

An amusing evolutionary game Two Players repeatedly playing the Coordination Game shown earlier. Eventually they learn to coordinate on one of the two NE. A variant: before each repetition either a Yellow light flashes or a Green light flashes. Note there is no information in the light. Experimental evidence shows that behaviour gets to a NE even quicker! Weird!

Conclusion Game theory is based on Nash Equilibrium… …everyone doing what is best for them given what everyone else is doing. We have seen that it leads to what we would call ‘antisocial’ outcomes. Conclusion? If Game Theory is correct, the state needs to intervene (in, for example, the provision of Public Goods). But is it correct? Everywhere? (Sweden/Italy)