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.

Slides:



Advertisements
Similar presentations
Some Problems from Chapt 13
Advertisements

Basics on Game Theory Class 2 Microeconomics. Introduction Why, What, What for Why Any human activity has some competition Human activities involve actors,
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?
This Segment: Computational game theory Lecture 1: Game representations, solution concepts and complexity Tuomas Sandholm Computer Science Department Carnegie.
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.
© 2009 Institute of Information Management National Chiao Tung University Game theory The study of multiperson decisions Four types of games Static games.
Stackelberg -leader/follower game 2 firms choose quantities sequentially (1) chooses its output; then (2) chooses it output; then the market clears This.
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.
Chapter 10 Game Theory and Strategic Behavior
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.
M9302 Mathematical Models in Economics Instructor: Georgi Burlakov 2.5.Repeated Games Lecture
Game Theory: Inside Oligopoly
ECO290E: Game Theory Lecture 9 Subgame Perfect Equilibrium.
Game-theoretic analysis tools Necessary for building nonmanipulable automated negotiation systems.
STRATEGIC DECISION MAKING
ECO290E: Game Theory Lecture 4 Applications in Industrial Organization.
An Introduction to Game Theory Part I: Strategic Games
Dynamic Games of Complete Information.. Repeated games Best understood class of dynamic games Past play cannot influence feasible actions or payoff functions.
Chapter 6 © 2006 Thomson Learning/South-Western Game Theory.
Sep. 5, 2013 Lirong Xia Introduction to Game Theory.
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.
Basics on Game Theory For Industrial Economics (According to Shy’s Plan)
Static Games of Complete Information: Equilibrium Concepts
Game Theory: Key Concepts Zero Sum Games Zero Sum Games Non – Zero Sum Games Non – Zero Sum Games Strategic Form Games  Lay out strategies Strategic Form.
© 2008 Pearson Addison Wesley. All rights reserved Chapter Fourteen Game Theory.
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.
APEC 8205: Applied Game Theory Fall 2007
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.
Static Games of Complete Information: Subgame Perfection
On Bounded Rationality and Computational Complexity Christos Papadimitriou and Mihallis Yannakakis.
Communication Networks A Second Course Jean Walrand Department of EECS University of California at Berkeley.
Reading Osborne, Chapters 5, 6, 7.1., 7.2, 7.7 Learning outcomes
ECON 2001 Microeconomics II nd semester Elliott Fan Economics, NTU Lecture 4 Microeconomics, Elliott Fan Lecture 4.
Social Choice Session 7 Carmen Pasca and John Hey.
Chapter 12 Choices Involving Strategy Copyright © 2014 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written.
ECO290E: Game Theory Lecture 12 Static Games of Incomplete Information.
Monetary Economics Game and Monetary Policymaking.
Nash equilibrium Nash equilibrium is defined in terms of strategies, not payoffs Every player is best responding simultaneously (everyone optimizes) This.
Dynamic Games of complete information: Backward Induction and Subgame perfection - Repeated Games -
Standard and Extended Form Games A Lesson in Multiagent System Based on Jose Vidal’s book Fundamentals of Multiagent Systems Henry Hexmoor, SIUC.
M9302 Mathematical Models in Economics Instructor: Georgi Burlakov 4.1.Dynamic Games of Incomplete Information Lecture
Dynamic Games & The Extensive Form
Chapters 29 and 30 Game Theory and Applications. Game Theory 0 Game theory applied to economics by John Von Neuman and Oskar Morgenstern 0 Game theory.
Public Policy Analysis MPA 404 Lecture 24. Previous Lecture Graphical Analysis of Tariff and Quota Game Theory; The prisoner's Dilemma.
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.
M9302 Mathematical Models in Economics Instructor: Georgi Burlakov 2.1.Dynamic Games of Complete and Perfect Information Lecture
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.
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.
Normal Form Games, Normal Form Games, Rationality and Iterated Rationality and Iterated Deletion of Dominated Strategies Deletion of Dominated Strategies.
Chapters 29 and 30 Game Theory and Applications. Game Theory 0 Game theory applied to economics by John Von Neuman and Oskar Morgenstern 0 Game theory.
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.
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.
M9302 Mathematical Models in Economics Instructor: Georgi Burlakov 2.1.Dynamic Games of Complete and Perfect Information Lecture
Chapter 12 Game Theory Presented by Nahakpam PhD Student 1Game Theory.
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.
Yuan Deng Vincent Conitzer Duke University
Learning 6.2 Game Theory.
Chapter 29 Game Theory Key Concept: Nash equilibrium and Subgame Perfect Nash equilibrium (SPNE)
Chapter 14 & 15 Repeated Games.
Chapter 14 & 15 Repeated Games.
Presentation transcript:

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 with the general analysis of strategic interaction. It can be used to study parlor games, political negotiation, and economic behaviors.

Normal form games: Prisoner’s dilemma. Defect 招 Coop 不招 Defect 招 -5,-5-1,-10 Coop 不招 -10,-1-2,-2

This game has a strictly dominant strategy. A dominant strategy is one which is optimal no matter what the other player does. Once a player has a st. dominant strategy, the task of predicting what other will do (the most interesting thing in game) becomes unnecessary. We may not be this lucky to have a st. dominant strategy all the time. But we might have a st. dominated strategy. So at least we can say we won’t play st. dominated strategies.

LR U2, 46, 3 M3, 33, 4 D5, 44, 3

One way to “solve” the game above is to use iterated elimination of strictly dominated strategies. So our story may go like, 1 is rational, so 1 will not play M. Given everyone knows this, 2 is rational, 2 will not play R. Given everyone knows this, 1 is rational, 1 will not play U. So (D, L) becomes our prediction. This process uses some common knowledge of rationality.

But, are you really a person who will play according to this logic of iterated elimination of strictly dominated strategies? Will you get the highest payoff if you do? Talk a bit about the games we played before and the cognitive hierarchy theory. Despite of this, theorists still feel that iterated elimination does not give sharp predictions.

BalletFootball Ballet2, 10, 0 Football0, 01,2

In battle of sexes game, iterated elimination does not help. A stronger solution, called Nash equilibrium, is often used. The concept of Nash equilibrium is this. A strategy profile (so every player has a part) is a Nash equilibrium, if given your opponent plays his equilibrium strategy, you play yours is a best response to that. In other words, players are best responding to each other.

Equivalently, we can say that given your opponent is playing equilibrium, you have no profitable deviation. That is exactly why we are looking at the reaction function in Cournot competition. A reaction function is simply a function that gives you the best response to every possibly plays of your opponent. We then intersect the two reaction functions to get Nash equilibrium where both are best responding.

In the battle of sexes game, there are two pure Nash equilibria, (ballet, ballet) and (football, football). Notice that in Nash equilibrium, a player’s is checking that he is best responding to his opponent’s play. In other words, implicitly we are assuming that a player’s belief is correct, or consistent with opponent’s play. So Nash equilibrium has two important components: best responding and correct beliefs.

There are some interesting empirical works supporting Nash equilibrium. For instance, football players in penalty kicks. Yet there are also reasons sometimes people don’t feel comfortable playing Nash equilibrium. Or sometimes we can even coordinate better than Nash. Look at the coordination games we played.

leftright top1, 01, 1 bottom-1000, 02, 1

In the literature, there is a well- recognized “problem” with Nash equilibrium about empty threats. Suppose in the first class meeting I came in and announced: “I want total dedication from my students, so you should drop all the other courses and just take my course. This will guarantee you spend all the efforts in my class. If you do not do so, I will not let you take the final and you will fail.”

Now it is a sequential game. You first decide whether you will drop other courses and then if you do not, I decide whether I will bar you from the final. My threat of not letting you take the final seems not credible (an empty threat) since at the final, what is the point of baring you from exam if my purpose is to increase your efforts in the course and efforts are done?

Moreover, NTU is a serious institution. So you expect that at the final, I will not carry out the threats and hence you will not drop other courses. That is a NE.

Now another Nash equilibrium looks like this. You take my threats seriously and you drop all other courses. Since you drop all courses I don’t need to carry out my threats of barring you from the exam. So my empty threat is never tested. I am very happy with the outcome. And you, given your pessimistic belief, are also doing what is the best for yourself. This does not seem very reasonable. So we want to rule out NE of this kind.

This brings us to Subgame Perfect Nash equilibrium (SPNE). A subgame is just like a game, so let us talk a bit about game trees. Drop ---- (2,5) Don’t Drop -----Bar (0,-5) -----Don’t Bar (4,2) So for SPNE, we solve backwards.

Talk about the sheep-lion story. The Stackelberg equilibrium is an SPNE. We are now equipped with NE and SPNE, it seems enough so what else can theorists do? There are still lots of things. For one, look at finite repetition of PD game. Defect all the time is the unique SPNE. But do you really believe in that?

One potential answer is to appeal to infinite horizon. Remember last time when we talked about repeated Cournot. With repeated interactions, as long as the future is important enough, we might be afraid of future punishment, which makes current cooperation possible. This is the result of Folk theorem. Another interesting direction is, do we really believe that people are so rational?

Can not-so-rational players play out equilibrium? Talk a bit about traffic and social conventions.